{"id":26318993,"url":"https://github.com/wittyicon29/dsa","last_synced_at":"2025-10-07T12:31:50.245Z","repository":{"id":156428702,"uuid":"585174032","full_name":"wittyicon29/DSA","owner":"wittyicon29","description":"Some problems of leetcode on various techniques and concepts of DSA ","archived":false,"fork":false,"pushed_at":"2025-06-21T09:01:02.000Z","size":594,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-06-24T15:08:36.904Z","etag":null,"topics":["algorithms","data-structures","leetcode"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/wittyicon29.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2023-01-04T14:03:20.000Z","updated_at":"2025-06-21T09:01:04.000Z","dependencies_parsed_at":"2024-07-16T09:45:14.744Z","dependency_job_id":"84574550-e653-4672-8143-a23477c2fda1","html_url":"https://github.com/wittyicon29/DSA","commit_stats":null,"previous_names":["wittyicon29/dsa"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/wittyicon29/DSA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wittyicon29%2FDSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wittyicon29%2FDSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wittyicon29%2FDSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wittyicon29%2FDSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/wittyicon29","download_url":"https://codeload.github.com/wittyicon29/DSA/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wittyicon29%2FDSA/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261700845,"owners_count":23196504,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","data-structures","leetcode"],"created_at":"2025-03-15T15:17:14.401Z","updated_at":"2025-10-07T12:31:50.181Z","avatar_url":"https://github.com/wittyicon29.png","language":"Java","readme":"A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/wittyicon29/DSA-Java-/tree/master/0001-two-sum) |\n| [0011-container-with-most-water](https://github.com/wittyicon29/DSA-Java-/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/wittyicon29/DSA-Java-/tree/master/0015-3sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/wittyicon29/DSA-Java-/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0033-search-in-rotated-sorted-array](https://github.com/wittyicon29/DSA-Java-/tree/master/0033-search-in-rotated-sorted-array) |\n| [0037-sudoku-solver](https://github.com/wittyicon29/DSA-Java-/tree/master/0037-sudoku-solver) |\n| [0039-combination-sum](https://github.com/wittyicon29/DSA-Java-/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/wittyicon29/DSA-Java-/tree/master/0040-combination-sum-ii) |\n| [0042-trapping-rain-water](https://github.com/wittyicon29/DSA-Java-/tree/master/0042-trapping-rain-water) |\n| [0046-permutations](https://github.com/wittyicon29/DSA-Java-/tree/master/0046-permutations) |\n| [0048-rotate-image](https://github.com/wittyicon29/DSA-Java-/tree/master/0048-rotate-image) |\n| [0049-group-anagrams](https://github.com/wittyicon29/DSA-Java-/tree/master/0049-group-anagrams) |\n| [0051-n-queens](https://github.com/wittyicon29/DSA-Java-/tree/master/0051-n-queens) |\n| [0053-maximum-subarray](https://github.com/wittyicon29/DSA-Java-/tree/master/0053-maximum-subarray) |\n| [0074-search-a-2d-matrix](https://github.com/wittyicon29/DSA-Java-/tree/master/0074-search-a-2d-matrix) |\n| [0075-sort-colors](https://github.com/wittyicon29/DSA-Java-/tree/master/0075-sort-colors) |\n| [0084-largest-rectangle-in-histogram](https://github.com/wittyicon29/DSA/tree/master/0084-largest-rectangle-in-histogram) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/wittyicon29/DSA-Java-/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0128-longest-consecutive-sequence](https://github.com/wittyicon29/DSA-Java-/tree/master/0128-longest-consecutive-sequence) |\n| [0169-majority-element](https://github.com/wittyicon29/DSA-Java-/tree/master/0169-majority-element) |\n| [0215-kth-largest-element-in-an-array](https://github.com/wittyicon29/DSA-Java-/tree/master/0215-kth-largest-element-in-an-array) |\n| [0217-contains-duplicate](https://github.com/wittyicon29/DSA-Java-/tree/master/0217-contains-duplicate) |\n| [0238-product-of-array-except-self](https://github.com/wittyicon29/DSA-Java-/tree/master/0238-product-of-array-except-self) |\n| [0239-sliding-window-maximum](https://github.com/wittyicon29/DSA/tree/master/0239-sliding-window-maximum) |\n| [0347-top-k-frequent-elements](https://github.com/wittyicon29/DSA-Java-/tree/master/0347-top-k-frequent-elements) |\n| [0485-max-consecutive-ones](https://github.com/wittyicon29/DSA-Java-/tree/master/0485-max-consecutive-ones) |\n| [0496-next-greater-element-i](https://github.com/wittyicon29/DSA/tree/master/0496-next-greater-element-i) |\n| [0540-single-element-in-a-sorted-array](https://github.com/wittyicon29/DSA-Java-/tree/master/0540-single-element-in-a-sorted-array) |\n| [0787-sliding-puzzle](https://github.com/wittyicon29/DSA-Java-/tree/master/0787-sliding-puzzle) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/wittyicon29/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [1063-best-sightseeing-pair](https://github.com/wittyicon29/DSA-Java-/tree/master/1063-best-sightseeing-pair) |\n| [1207-delete-nodes-and-return-forest](https://github.com/wittyicon29/DSA/tree/master/1207-delete-nodes-and-return-forest) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/wittyicon29/DSA-Java-/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n| [2692-take-gifts-from-the-richest-pile](https://github.com/wittyicon29/DSA-Java-/tree/master/2692-take-gifts-from-the-richest-pile) |\n| [2846-robot-collisions](https://github.com/wittyicon29/DSA/tree/master/2846-robot-collisions) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0053-maximum-subarray](https://github.com/wittyicon29/DSA-Java-/tree/master/0053-maximum-subarray) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0169-majority-element](https://github.com/wittyicon29/DSA-Java-/tree/master/0169-majority-element) |\n| [0215-kth-largest-element-in-an-array](https://github.com/wittyicon29/DSA-Java-/tree/master/0215-kth-largest-element-in-an-array) |\n| [0347-top-k-frequent-elements](https://github.com/wittyicon29/DSA-Java-/tree/master/0347-top-k-frequent-elements) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/wittyicon29/DSA/tree/master/0005-longest-palindromic-substring) |\n| [0042-trapping-rain-water](https://github.com/wittyicon29/DSA-Java-/tree/master/0042-trapping-rain-water) |\n| [0053-maximum-subarray](https://github.com/wittyicon29/DSA-Java-/tree/master/0053-maximum-subarray) |\n| [0062-unique-paths](https://github.com/wittyicon29/DSA-Java-/tree/master/0062-unique-paths) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/wittyicon29/DSA-Java-/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/wittyicon29/DSA/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0131-palindrome-partitioning](https://github.com/wittyicon29/DSA-Java-/tree/master/0131-palindrome-partitioning) |\n| [1063-best-sightseeing-pair](https://github.com/wittyicon29/DSA-Java-/tree/master/1063-best-sightseeing-pair) |\n## Two Pointers\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/wittyicon29/DSA/tree/master/0005-longest-palindromic-substring) |\n| [0011-container-with-most-water](https://github.com/wittyicon29/DSA-Java-/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/wittyicon29/DSA-Java-/tree/master/0015-3sum) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/wittyicon29/DSA-Java-/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/wittyicon29/DSA-Java-/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/wittyicon29/DSA/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0042-trapping-rain-water](https://github.com/wittyicon29/DSA-Java-/tree/master/0042-trapping-rain-water) |\n| [0075-sort-colors](https://github.com/wittyicon29/DSA-Java-/tree/master/0075-sort-colors) |\n| [0141-linked-list-cycle](https://github.com/wittyicon29/DSA-Java-/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/wittyicon29/DSA-Java-/tree/master/0142-linked-list-cycle-ii) |\n| [0151-reverse-words-in-a-string](https://github.com/wittyicon29/DSA/tree/master/0151-reverse-words-in-a-string) |\n| [0160-intersection-of-two-linked-lists](https://github.com/wittyicon29/DSA-Java-/tree/master/0160-intersection-of-two-linked-lists) |\n| [0165-compare-version-numbers](https://github.com/wittyicon29/DSA/tree/master/0165-compare-version-numbers) |\n| [0234-palindrome-linked-list](https://github.com/wittyicon29/DSA-Java-/tree/master/0234-palindrome-linked-list) |\n| [0295-find-median-from-data-stream](https://github.com/wittyicon29/DSA-Java-/tree/master/0295-find-median-from-data-stream) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/wittyicon29/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0908-middle-of-the-linked-list](https://github.com/wittyicon29/DSA-Java-/tree/master/0908-middle-of-the-linked-list) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/wittyicon29/DSA-Java-/tree/master/0015-3sum) |\n| [0049-group-anagrams](https://github.com/wittyicon29/DSA-Java-/tree/master/0049-group-anagrams) |\n| [0075-sort-colors](https://github.com/wittyicon29/DSA-Java-/tree/master/0075-sort-colors) |\n| [0169-majority-element](https://github.com/wittyicon29/DSA-Java-/tree/master/0169-majority-element) |\n| [0215-kth-largest-element-in-an-array](https://github.com/wittyicon29/DSA-Java-/tree/master/0215-kth-largest-element-in-an-array) |\n| [0217-contains-duplicate](https://github.com/wittyicon29/DSA-Java-/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/wittyicon29/DSA-Java-/tree/master/0242-valid-anagram) |\n| [0295-find-median-from-data-stream](https://github.com/wittyicon29/DSA-Java-/tree/master/0295-find-median-from-data-stream) |\n| [0347-top-k-frequent-elements](https://github.com/wittyicon29/DSA-Java-/tree/master/0347-top-k-frequent-elements) |\n| [0726-number-of-atoms](https://github.com/wittyicon29/DSA/tree/master/0726-number-of-atoms) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/wittyicon29/DSA/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [2846-robot-collisions](https://github.com/wittyicon29/DSA/tree/master/2846-robot-collisions) |\n## Math\n|  |\n| ------- |\n| [0013-roman-to-integer](https://github.com/wittyicon29/DSA/tree/master/0013-roman-to-integer) |\n| [0048-rotate-image](https://github.com/wittyicon29/DSA-Java-/tree/master/0048-rotate-image) |\n| [0050-powx-n](https://github.com/wittyicon29/DSA-Java-/tree/master/0050-powx-n) |\n| [0062-unique-paths](https://github.com/wittyicon29/DSA-Java-/tree/master/0062-unique-paths) |\n## Matrix\n|  |\n| ------- |\n| [0037-sudoku-solver](https://github.com/wittyicon29/DSA-Java-/tree/master/0037-sudoku-solver) |\n| [0048-rotate-image](https://github.com/wittyicon29/DSA-Java-/tree/master/0048-rotate-image) |\n| [0074-search-a-2d-matrix](https://github.com/wittyicon29/DSA-Java-/tree/master/0074-search-a-2d-matrix) |\n| [0787-sliding-puzzle](https://github.com/wittyicon29/DSA-Java-/tree/master/0787-sliding-puzzle) |\n## Binary Search\n|  |\n| ------- |\n| [0033-search-in-rotated-sorted-array](https://github.com/wittyicon29/DSA-Java-/tree/master/0033-search-in-rotated-sorted-array) |\n| [0074-search-a-2d-matrix](https://github.com/wittyicon29/DSA-Java-/tree/master/0074-search-a-2d-matrix) |\n| [0540-single-element-in-a-sorted-array](https://github.com/wittyicon29/DSA-Java-/tree/master/0540-single-element-in-a-sorted-array) |\n## Recursion\n|  |\n| ------- |\n| [0021-merge-two-sorted-lists](https://github.com/wittyicon29/DSA-Java-/tree/master/0021-merge-two-sorted-lists) |\n| [0025-reverse-nodes-in-k-group](https://github.com/wittyicon29/DSA-Java-/tree/master/0025-reverse-nodes-in-k-group) |\n| [0050-powx-n](https://github.com/wittyicon29/DSA-Java-/tree/master/0050-powx-n) |\n| [0206-reverse-linked-list](https://github.com/wittyicon29/DSA-Java-/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/wittyicon29/DSA-Java-/tree/master/0234-palindrome-linked-list) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/wittyicon29/DSA-Java-/tree/master/0001-two-sum) |\n| [0003-longest-substring-without-repeating-characters](https://github.com/wittyicon29/DSA-Java-/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0013-roman-to-integer](https://github.com/wittyicon29/DSA/tree/master/0013-roman-to-integer) |\n| [0037-sudoku-solver](https://github.com/wittyicon29/DSA-Java-/tree/master/0037-sudoku-solver) |\n| [0049-group-anagrams](https://github.com/wittyicon29/DSA-Java-/tree/master/0049-group-anagrams) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0128-longest-consecutive-sequence](https://github.com/wittyicon29/DSA-Java-/tree/master/0128-longest-consecutive-sequence) |\n| [0138-copy-list-with-random-pointer](https://github.com/wittyicon29/DSA-Java-/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/wittyicon29/DSA-Java-/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/wittyicon29/DSA-Java-/tree/master/0142-linked-list-cycle-ii) |\n| [0146-lru-cache](https://github.com/wittyicon29/DSA/tree/master/0146-lru-cache) |\n| [0160-intersection-of-two-linked-lists](https://github.com/wittyicon29/DSA-Java-/tree/master/0160-intersection-of-two-linked-lists) |\n| [0169-majority-element](https://github.com/wittyicon29/DSA-Java-/tree/master/0169-majority-element) |\n| [0217-contains-duplicate](https://github.com/wittyicon29/DSA-Java-/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/wittyicon29/DSA-Java-/tree/master/0242-valid-anagram) |\n| [0347-top-k-frequent-elements](https://github.com/wittyicon29/DSA-Java-/tree/master/0347-top-k-frequent-elements) |\n| [0460-lfu-cache](https://github.com/wittyicon29/DSA/tree/master/0460-lfu-cache) |\n| [0496-next-greater-element-i](https://github.com/wittyicon29/DSA/tree/master/0496-next-greater-element-i) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/wittyicon29/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0726-number-of-atoms](https://github.com/wittyicon29/DSA/tree/master/0726-number-of-atoms) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/wittyicon29/DSA/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1207-delete-nodes-and-return-forest](https://github.com/wittyicon29/DSA/tree/master/1207-delete-nodes-and-return-forest) |\n## Counting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/wittyicon29/DSA-Java-/tree/master/0169-majority-element) |\n| [0347-top-k-frequent-elements](https://github.com/wittyicon29/DSA-Java-/tree/master/0347-top-k-frequent-elements) |\n## Combinatorics\n|  |\n| ------- |\n| [0062-unique-paths](https://github.com/wittyicon29/DSA-Java-/tree/master/0062-unique-paths) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/wittyicon29/DSA-Java-/tree/master/0128-longest-consecutive-sequence) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/wittyicon29/DSA-Java-/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0005-longest-palindromic-substring](https://github.com/wittyicon29/DSA/tree/master/0005-longest-palindromic-substring) |\n| [0008-string-to-integer-atoi](https://github.com/wittyicon29/DSA/tree/master/0008-string-to-integer-atoi) |\n| [0013-roman-to-integer](https://github.com/wittyicon29/DSA/tree/master/0013-roman-to-integer) |\n| [0014-longest-common-prefix](https://github.com/wittyicon29/DSA/tree/master/0014-longest-common-prefix) |\n| [0020-valid-parentheses](https://github.com/wittyicon29/DSA/tree/master/0020-valid-parentheses) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/wittyicon29/DSA/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0038-count-and-say](https://github.com/wittyicon29/DSA/tree/master/0038-count-and-say) |\n| [0049-group-anagrams](https://github.com/wittyicon29/DSA-Java-/tree/master/0049-group-anagrams) |\n| [0131-palindrome-partitioning](https://github.com/wittyicon29/DSA-Java-/tree/master/0131-palindrome-partitioning) |\n| [0151-reverse-words-in-a-string](https://github.com/wittyicon29/DSA/tree/master/0151-reverse-words-in-a-string) |\n| [0165-compare-version-numbers](https://github.com/wittyicon29/DSA/tree/master/0165-compare-version-numbers) |\n| [0242-valid-anagram](https://github.com/wittyicon29/DSA-Java-/tree/master/0242-valid-anagram) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0686-repeated-string-match](https://github.com/wittyicon29/DSA/tree/master/0686-repeated-string-match) |\n| [0726-number-of-atoms](https://github.com/wittyicon29/DSA/tree/master/0726-number-of-atoms) |\n| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/wittyicon29/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |\n## Sliding Window\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/wittyicon29/DSA-Java-/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0239-sliding-window-maximum](https://github.com/wittyicon29/DSA/tree/master/0239-sliding-window-maximum) |\n## Linked List\n|  |\n| ------- |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/wittyicon29/DSA-Java-/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0021-merge-two-sorted-lists](https://github.com/wittyicon29/DSA-Java-/tree/master/0021-merge-two-sorted-lists) |\n| [0025-reverse-nodes-in-k-group](https://github.com/wittyicon29/DSA-Java-/tree/master/0025-reverse-nodes-in-k-group) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/wittyicon29/DSA/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/wittyicon29/DSA/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0138-copy-list-with-random-pointer](https://github.com/wittyicon29/DSA-Java-/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/wittyicon29/DSA-Java-/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/wittyicon29/DSA-Java-/tree/master/0142-linked-list-cycle-ii) |\n| [0146-lru-cache](https://github.com/wittyicon29/DSA/tree/master/0146-lru-cache) |\n| [0160-intersection-of-two-linked-lists](https://github.com/wittyicon29/DSA-Java-/tree/master/0160-intersection-of-two-linked-lists) |\n| [0206-reverse-linked-list](https://github.com/wittyicon29/DSA-Java-/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/wittyicon29/DSA-Java-/tree/master/0234-palindrome-linked-list) |\n| [0237-delete-node-in-a-linked-list](https://github.com/wittyicon29/DSA-Java-/tree/master/0237-delete-node-in-a-linked-list) |\n| [0460-lfu-cache](https://github.com/wittyicon29/DSA/tree/master/0460-lfu-cache) |\n| [0908-middle-of-the-linked-list](https://github.com/wittyicon29/DSA-Java-/tree/master/0908-middle-of-the-linked-list) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/wittyicon29/DSA/tree/master/0020-valid-parentheses) |\n| [0042-trapping-rain-water](https://github.com/wittyicon29/DSA-Java-/tree/master/0042-trapping-rain-water) |\n| [0084-largest-rectangle-in-histogram](https://github.com/wittyicon29/DSA/tree/master/0084-largest-rectangle-in-histogram) |\n| [0094-binary-tree-inorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/wittyicon29/DSA/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0144-binary-tree-preorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0155-min-stack](https://github.com/wittyicon29/DSA/tree/master/0155-min-stack) |\n| [0173-binary-search-tree-iterator](https://github.com/wittyicon29/DSA/tree/master/0173-binary-search-tree-iterator) |\n| [0232-implement-queue-using-stacks](https://github.com/wittyicon29/DSA/tree/master/0232-implement-queue-using-stacks) |\n| [0234-palindrome-linked-list](https://github.com/wittyicon29/DSA-Java-/tree/master/0234-palindrome-linked-list) |\n| [0496-next-greater-element-i](https://github.com/wittyicon29/DSA/tree/master/0496-next-greater-element-i) |\n| [0726-number-of-atoms](https://github.com/wittyicon29/DSA/tree/master/0726-number-of-atoms) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/wittyicon29/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/wittyicon29/DSA-Java-/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n| [2846-robot-collisions](https://github.com/wittyicon29/DSA/tree/master/2846-robot-collisions) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0042-trapping-rain-water](https://github.com/wittyicon29/DSA-Java-/tree/master/0042-trapping-rain-water) |\n| [0084-largest-rectangle-in-histogram](https://github.com/wittyicon29/DSA/tree/master/0084-largest-rectangle-in-histogram) |\n| [0496-next-greater-element-i](https://github.com/wittyicon29/DSA/tree/master/0496-next-greater-element-i) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/wittyicon29/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/wittyicon29/DSA-Java-/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0215-kth-largest-element-in-an-array](https://github.com/wittyicon29/DSA-Java-/tree/master/0215-kth-largest-element-in-an-array) |\n| [0239-sliding-window-maximum](https://github.com/wittyicon29/DSA/tree/master/0239-sliding-window-maximum) |\n| [0295-find-median-from-data-stream](https://github.com/wittyicon29/DSA-Java-/tree/master/0295-find-median-from-data-stream) |\n| [0347-top-k-frequent-elements](https://github.com/wittyicon29/DSA-Java-/tree/master/0347-top-k-frequent-elements) |\n| [2692-take-gifts-from-the-richest-pile](https://github.com/wittyicon29/DSA-Java-/tree/master/2692-take-gifts-from-the-richest-pile) |\n## Bucket Sort\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/wittyicon29/DSA-Java-/tree/master/0347-top-k-frequent-elements) |\n## Quickselect\n|  |\n| ------- |\n| [0215-kth-largest-element-in-an-array](https://github.com/wittyicon29/DSA-Java-/tree/master/0215-kth-largest-element-in-an-array) |\n| [0347-top-k-frequent-elements](https://github.com/wittyicon29/DSA-Java-/tree/master/0347-top-k-frequent-elements) |\n## Prefix Sum\n|  |\n| ------- |\n| [0238-product-of-array-except-self](https://github.com/wittyicon29/DSA-Java-/tree/master/0238-product-of-array-except-self) |\n## Backtracking\n|  |\n| ------- |\n| [0037-sudoku-solver](https://github.com/wittyicon29/DSA-Java-/tree/master/0037-sudoku-solver) |\n| [0039-combination-sum](https://github.com/wittyicon29/DSA-Java-/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/wittyicon29/DSA-Java-/tree/master/0040-combination-sum-ii) |\n| [0046-permutations](https://github.com/wittyicon29/DSA-Java-/tree/master/0046-permutations) |\n| [0051-n-queens](https://github.com/wittyicon29/DSA-Java-/tree/master/0051-n-queens) |\n| [0131-palindrome-partitioning](https://github.com/wittyicon29/DSA-Java-/tree/master/0131-palindrome-partitioning) |\n## Design\n|  |\n| ------- |\n| [0146-lru-cache](https://github.com/wittyicon29/DSA/tree/master/0146-lru-cache) |\n| [0155-min-stack](https://github.com/wittyicon29/DSA/tree/master/0155-min-stack) |\n| [0173-binary-search-tree-iterator](https://github.com/wittyicon29/DSA/tree/master/0173-binary-search-tree-iterator) |\n| [0232-implement-queue-using-stacks](https://github.com/wittyicon29/DSA/tree/master/0232-implement-queue-using-stacks) |\n| [0295-find-median-from-data-stream](https://github.com/wittyicon29/DSA-Java-/tree/master/0295-find-median-from-data-stream) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0460-lfu-cache](https://github.com/wittyicon29/DSA/tree/master/0460-lfu-cache) |\n## Data Stream\n|  |\n| ------- |\n| [0295-find-median-from-data-stream](https://github.com/wittyicon29/DSA-Java-/tree/master/0295-find-median-from-data-stream) |\n## Queue\n|  |\n| ------- |\n| [0232-implement-queue-using-stacks](https://github.com/wittyicon29/DSA/tree/master/0232-implement-queue-using-stacks) |\n| [0239-sliding-window-maximum](https://github.com/wittyicon29/DSA/tree/master/0239-sliding-window-maximum) |\n## Doubly-Linked List\n|  |\n| ------- |\n| [0146-lru-cache](https://github.com/wittyicon29/DSA/tree/master/0146-lru-cache) |\n| [0460-lfu-cache](https://github.com/wittyicon29/DSA/tree/master/0460-lfu-cache) |\n## Monotonic Queue\n|  |\n| ------- |\n| [0239-sliding-window-maximum](https://github.com/wittyicon29/DSA/tree/master/0239-sliding-window-maximum) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/wittyicon29/DSA/tree/master/0014-longest-common-prefix) |\n## String Matching\n|  |\n| ------- |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/wittyicon29/DSA/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0686-repeated-string-match](https://github.com/wittyicon29/DSA/tree/master/0686-repeated-string-match) |\n## Simulation\n|  |\n| ------- |\n| [2692-take-gifts-from-the-richest-pile](https://github.com/wittyicon29/DSA-Java-/tree/master/2692-take-gifts-from-the-richest-pile) |\n| [2846-robot-collisions](https://github.com/wittyicon29/DSA/tree/master/2846-robot-collisions) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/wittyicon29/DSA/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/wittyicon29/DSA/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/wittyicon29/DSA/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/wittyicon29/DSA/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0110-balanced-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0110-balanced-binary-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/wittyicon29/DSA/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/wittyicon29/DSA/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/wittyicon29/DSA/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0144-binary-tree-preorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0173-binary-search-tree-iterator](https://github.com/wittyicon29/DSA/tree/master/0173-binary-search-tree-iterator) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/wittyicon29/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0543-diameter-of-binary-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/wittyicon29/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0662-maximum-width-of-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0662-maximum-width-of-binary-tree) |\n| [0774-maximum-depth-of-n-ary-tree](https://github.com/wittyicon29/DSA/tree/master/0774-maximum-depth-of-n-ary-tree) |\n| [0783-search-in-a-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0783-search-in-a-binary-search-tree) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/wittyicon29/DSA/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/wittyicon29/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [1207-delete-nodes-and-return-forest](https://github.com/wittyicon29/DSA/tree/master/1207-delete-nodes-and-return-forest) |\n| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/wittyicon29/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |\n| [3058-maximum-number-of-k-divisible-components](https://github.com/wittyicon29/DSA-Java-/tree/master/3058-maximum-number-of-k-divisible-components) |\n## Depth-First Search\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/wittyicon29/DSA/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/wittyicon29/DSA/tree/master/0101-symmetric-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0110-balanced-binary-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/wittyicon29/DSA/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/wittyicon29/DSA/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/wittyicon29/DSA/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0144-binary-tree-preorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/wittyicon29/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0543-diameter-of-binary-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/wittyicon29/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0662-maximum-width-of-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0662-maximum-width-of-binary-tree) |\n| [0774-maximum-depth-of-n-ary-tree](https://github.com/wittyicon29/DSA/tree/master/0774-maximum-depth-of-n-ary-tree) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/wittyicon29/DSA/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1207-delete-nodes-and-return-forest](https://github.com/wittyicon29/DSA/tree/master/1207-delete-nodes-and-return-forest) |\n| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/wittyicon29/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |\n| [3058-maximum-number-of-k-divisible-components](https://github.com/wittyicon29/DSA-Java-/tree/master/3058-maximum-number-of-k-divisible-components) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/wittyicon29/DSA/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/wittyicon29/DSA/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/wittyicon29/DSA/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/wittyicon29/DSA/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0110-balanced-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0110-balanced-binary-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/wittyicon29/DSA/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/wittyicon29/DSA/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/wittyicon29/DSA/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0144-binary-tree-preorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/wittyicon29/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0173-binary-search-tree-iterator](https://github.com/wittyicon29/DSA/tree/master/0173-binary-search-tree-iterator) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/wittyicon29/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0543-diameter-of-binary-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/wittyicon29/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0662-maximum-width-of-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0662-maximum-width-of-binary-tree) |\n| [0783-search-in-a-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0783-search-in-a-binary-search-tree) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/wittyicon29/DSA/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/wittyicon29/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [1207-delete-nodes-and-return-forest](https://github.com/wittyicon29/DSA/tree/master/1207-delete-nodes-and-return-forest) |\n| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/wittyicon29/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/wittyicon29/DSA/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/wittyicon29/DSA/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/wittyicon29/DSA/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/wittyicon29/DSA/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/wittyicon29/DSA/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/wittyicon29/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0662-maximum-width-of-binary-tree](https://github.com/wittyicon29/DSA/tree/master/0662-maximum-width-of-binary-tree) |\n| [0774-maximum-depth-of-n-ary-tree](https://github.com/wittyicon29/DSA/tree/master/0774-maximum-depth-of-n-ary-tree) |\n| [0787-sliding-puzzle](https://github.com/wittyicon29/DSA-Java-/tree/master/0787-sliding-puzzle) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/wittyicon29/DSA/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0098-validate-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0173-binary-search-tree-iterator](https://github.com/wittyicon29/DSA/tree/master/0173-binary-search-tree-iterator) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/wittyicon29/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/wittyicon29/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0783-search-in-a-binary-search-tree](https://github.com/wittyicon29/DSA/tree/master/0783-search-in-a-binary-search-tree) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/wittyicon29/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n## Iterator\n|  |\n| ------- |\n| [0173-binary-search-tree-iterator](https://github.com/wittyicon29/DSA/tree/master/0173-binary-search-tree-iterator) |\n## Graph\n|  |\n| ------- |\n| [3189-find-champion-ii](https://github.com/wittyicon29/DSA-Java-/tree/master/3189-find-champion-ii) |\n## Greedy\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/wittyicon29/DSA-Java-/tree/master/0011-container-with-most-water) |\n\u003c!---LeetCode Topics End--\u003e","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwittyicon29%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwittyicon29%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwittyicon29%2Fdsa/lists"}