{"id":23908435,"url":"https://github.com/bmukesh23/dsa","last_synced_at":"2026-06-21T14:31:53.093Z","repository":{"id":247050453,"uuid":"824886629","full_name":"bmukesh23/DSA","owner":"bmukesh23","description":"DSA Practice","archived":false,"fork":false,"pushed_at":"2026-01-15T17:16:23.000Z","size":764,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-01-15T20:08:18.626Z","etag":null,"topics":["java","sql"],"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/bmukesh23.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,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2024-07-06T08:13:30.000Z","updated_at":"2026-01-15T17:16:29.000Z","dependencies_parsed_at":"2024-08-06T21:08:35.425Z","dependency_job_id":"0470351e-f409-4f20-8422-9d60ca0694aa","html_url":"https://github.com/bmukesh23/DSA","commit_stats":null,"previous_names":["bmukesh23/dsa"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/bmukesh23/DSA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bmukesh23%2FDSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bmukesh23%2FDSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bmukesh23%2FDSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bmukesh23%2FDSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bmukesh23","download_url":"https://codeload.github.com/bmukesh23/DSA/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bmukesh23%2FDSA/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34613080,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-21T02:00:05.568Z","response_time":54,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["java","sql"],"created_at":"2025-01-05T04:37:34.692Z","updated_at":"2026-06-21T14:31:53.086Z","avatar_url":"https://github.com/bmukesh23.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"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## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/bmukesh23/DSA/tree/master/0002-add-two-numbers) |\n| [0007-reverse-integer](https://github.com/bmukesh23/DSA/tree/master/0007-reverse-integer) |\n| [0009-palindrome-number](https://github.com/bmukesh23/DSA/tree/master/0009-palindrome-number) |\n| [0013-roman-to-integer](https://github.com/bmukesh23/DSA/tree/master/0013-roman-to-integer) |\n| [0048-rotate-image](https://github.com/bmukesh23/DSA/tree/master/0048-rotate-image) |\n| [0050-powx-n](https://github.com/bmukesh23/DSA/tree/master/0050-powx-n) |\n| [0189-rotate-array](https://github.com/bmukesh23/DSA/tree/master/0189-rotate-array) |\n| [0268-missing-number](https://github.com/bmukesh23/DSA/tree/master/0268-missing-number) |\n| [1013-fibonacci-number](https://github.com/bmukesh23/DSA/tree/master/1013-fibonacci-number) |\n| [1370-count-number-of-nice-subarrays](https://github.com/bmukesh23/DSA/tree/master/1370-count-number-of-nice-subarrays) |\n| [1406-subtract-the-product-and-sum-of-digits-of-an-integer](https://github.com/bmukesh23/DSA/tree/master/1406-subtract-the-product-and-sum-of-digits-of-an-integer) |\n| [2032-largest-odd-number-in-string](https://github.com/bmukesh23/DSA/tree/master/2032-largest-odd-number-in-string) |\n| [2050-count-good-numbers](https://github.com/bmukesh23/DSA/tree/master/2050-count-good-numbers) |\n| [2324-find-triangular-sum-of-an-array](https://github.com/bmukesh23/DSA/tree/master/2324-find-triangular-sum-of-an-array) |\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/bmukesh23/DSA/tree/master/0001-two-sum) |\n| [0004-median-of-two-sorted-arrays](https://github.com/bmukesh23/DSA/tree/master/0004-median-of-two-sorted-arrays) |\n| [0015-3sum](https://github.com/bmukesh23/DSA/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/bmukesh23/DSA/tree/master/0018-4sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0031-next-permutation](https://github.com/bmukesh23/DSA/tree/master/0031-next-permutation) |\n| [0033-search-in-rotated-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0033-search-in-rotated-sorted-array) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0035-search-insert-position](https://github.com/bmukesh23/DSA/tree/master/0035-search-insert-position) |\n| [0039-combination-sum](https://github.com/bmukesh23/DSA/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/bmukesh23/DSA/tree/master/0040-combination-sum-ii) |\n| [0042-trapping-rain-water](https://github.com/bmukesh23/DSA/tree/master/0042-trapping-rain-water) |\n| [0045-jump-game-ii](https://github.com/bmukesh23/DSA/tree/master/0045-jump-game-ii) |\n| [0048-rotate-image](https://github.com/bmukesh23/DSA/tree/master/0048-rotate-image) |\n| [0053-maximum-subarray](https://github.com/bmukesh23/DSA/tree/master/0053-maximum-subarray) |\n| [0055-jump-game](https://github.com/bmukesh23/DSA/tree/master/0055-jump-game) |\n| [0056-merge-intervals](https://github.com/bmukesh23/DSA/tree/master/0056-merge-intervals) |\n| [0057-insert-interval](https://github.com/bmukesh23/DSA/tree/master/0057-insert-interval) |\n| [0073-set-matrix-zeroes](https://github.com/bmukesh23/DSA/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/bmukesh23/DSA/tree/master/0074-search-a-2d-matrix) |\n| [0075-sort-colors](https://github.com/bmukesh23/DSA/tree/master/0075-sort-colors) |\n| [0078-subsets](https://github.com/bmukesh23/DSA/tree/master/0078-subsets) |\n| [0079-word-search](https://github.com/bmukesh23/DSA/tree/master/0079-word-search) |\n| [0081-search-in-rotated-sorted-array-ii](https://github.com/bmukesh23/DSA/tree/master/0081-search-in-rotated-sorted-array-ii) |\n| [0088-merge-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0088-merge-sorted-array) |\n| [0090-subsets-ii](https://github.com/bmukesh23/DSA/tree/master/0090-subsets-ii) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0118-pascals-triangle](https://github.com/bmukesh23/DSA/tree/master/0118-pascals-triangle) |\n| [0119-pascals-triangle-ii](https://github.com/bmukesh23/DSA/tree/master/0119-pascals-triangle-ii) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/bmukesh23/DSA/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0128-longest-consecutive-sequence](https://github.com/bmukesh23/DSA/tree/master/0128-longest-consecutive-sequence) |\n| [0136-single-number](https://github.com/bmukesh23/DSA/tree/master/0136-single-number) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0162-find-peak-element](https://github.com/bmukesh23/DSA/tree/master/0162-find-peak-element) |\n| [0169-majority-element](https://github.com/bmukesh23/DSA/tree/master/0169-majority-element) |\n| [0189-rotate-array](https://github.com/bmukesh23/DSA/tree/master/0189-rotate-array) |\n| [0216-combination-sum-iii](https://github.com/bmukesh23/DSA/tree/master/0216-combination-sum-iii) |\n| [0217-contains-duplicate](https://github.com/bmukesh23/DSA/tree/master/0217-contains-duplicate) |\n| [0229-majority-element-ii](https://github.com/bmukesh23/DSA/tree/master/0229-majority-element-ii) |\n| [0240-search-a-2d-matrix-ii](https://github.com/bmukesh23/DSA/tree/master/0240-search-a-2d-matrix-ii) |\n| [0268-missing-number](https://github.com/bmukesh23/DSA/tree/master/0268-missing-number) |\n| [0283-move-zeroes](https://github.com/bmukesh23/DSA/tree/master/0283-move-zeroes) |\n| [0287-find-the-duplicate-number](https://github.com/bmukesh23/DSA/tree/master/0287-find-the-duplicate-number) |\n| [0435-non-overlapping-intervals](https://github.com/bmukesh23/DSA/tree/master/0435-non-overlapping-intervals) |\n| [0455-assign-cookies](https://github.com/bmukesh23/DSA/tree/master/0455-assign-cookies) |\n| [0485-max-consecutive-ones](https://github.com/bmukesh23/DSA/tree/master/0485-max-consecutive-ones) |\n| [0493-reverse-pairs](https://github.com/bmukesh23/DSA/tree/master/0493-reverse-pairs) |\n| [0496-next-greater-element-i](https://github.com/bmukesh23/DSA/tree/master/0496-next-greater-element-i) |\n| [0503-next-greater-element-ii](https://github.com/bmukesh23/DSA/tree/master/0503-next-greater-element-ii) |\n| [0540-single-element-in-a-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0540-single-element-in-a-sorted-array) |\n| [0735-asteroid-collision](https://github.com/bmukesh23/DSA/tree/master/0735-asteroid-collision) |\n| [0792-binary-search](https://github.com/bmukesh23/DSA/tree/master/0792-binary-search) |\n| [0890-lemonade-change](https://github.com/bmukesh23/DSA/tree/master/0890-lemonade-change) |\n| [0943-sum-of-subarray-minimums](https://github.com/bmukesh23/DSA/tree/master/0943-sum-of-subarray-minimums) |\n| [0966-binary-subarrays-with-sum](https://github.com/bmukesh23/DSA/tree/master/0966-binary-subarrays-with-sum) |\n| [1046-max-consecutive-ones-iii](https://github.com/bmukesh23/DSA/tree/master/1046-max-consecutive-ones-iii) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/bmukesh23/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [1364-tuple-with-same-product](https://github.com/bmukesh23/DSA/tree/master/1364-tuple-with-same-product) |\n| [1370-count-number-of-nice-subarrays](https://github.com/bmukesh23/DSA/tree/master/1370-count-number-of-nice-subarrays) |\n| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/bmukesh23/DSA/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/bmukesh23/DSA/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n| [1646-kth-missing-positive-number](https://github.com/bmukesh23/DSA/tree/master/1646-kth-missing-positive-number) |\n| [1755-defuse-the-bomb](https://github.com/bmukesh23/DSA/tree/master/1755-defuse-the-bomb) |\n| [1878-check-if-array-is-sorted-and-rotated](https://github.com/bmukesh23/DSA/tree/master/1878-check-if-array-is-sorted-and-rotated) |\n| [1927-maximum-ascending-subarray-sum](https://github.com/bmukesh23/DSA/tree/master/1927-maximum-ascending-subarray-sum) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/bmukesh23/DSA/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [2227-sum-of-subarray-ranges](https://github.com/bmukesh23/DSA/tree/master/2227-sum-of-subarray-ranges) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/bmukesh23/DSA/tree/master/2271-rearrange-array-elements-by-sign) |\n| [2324-find-triangular-sum-of-an-array](https://github.com/bmukesh23/DSA/tree/master/2324-find-triangular-sum-of-an-array) |\n| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/bmukesh23/DSA/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |\n| [3429-special-array-i](https://github.com/bmukesh23/DSA/tree/master/3429-special-array-i) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/bmukesh23/DSA/tree/master/0001-two-sum) |\n| [0003-longest-substring-without-repeating-characters](https://github.com/bmukesh23/DSA/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0013-roman-to-integer](https://github.com/bmukesh23/DSA/tree/master/0013-roman-to-integer) |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/bmukesh23/DSA/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0073-set-matrix-zeroes](https://github.com/bmukesh23/DSA/tree/master/0073-set-matrix-zeroes) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0128-longest-consecutive-sequence](https://github.com/bmukesh23/DSA/tree/master/0128-longest-consecutive-sequence) |\n| [0138-copy-list-with-random-pointer](https://github.com/bmukesh23/DSA/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/bmukesh23/DSA/tree/master/0141-linked-list-cycle) |\n| [0146-lru-cache](https://github.com/bmukesh23/DSA/tree/master/0146-lru-cache) |\n| [0160-intersection-of-two-linked-lists](https://github.com/bmukesh23/DSA/tree/master/0160-intersection-of-two-linked-lists) |\n| [0169-majority-element](https://github.com/bmukesh23/DSA/tree/master/0169-majority-element) |\n| [0205-isomorphic-strings](https://github.com/bmukesh23/DSA/tree/master/0205-isomorphic-strings) |\n| [0217-contains-duplicate](https://github.com/bmukesh23/DSA/tree/master/0217-contains-duplicate) |\n| [0229-majority-element-ii](https://github.com/bmukesh23/DSA/tree/master/0229-majority-element-ii) |\n| [0242-valid-anagram](https://github.com/bmukesh23/DSA/tree/master/0242-valid-anagram) |\n| [0268-missing-number](https://github.com/bmukesh23/DSA/tree/master/0268-missing-number) |\n| [0424-longest-repeating-character-replacement](https://github.com/bmukesh23/DSA/tree/master/0424-longest-repeating-character-replacement) |\n| [0460-lfu-cache](https://github.com/bmukesh23/DSA/tree/master/0460-lfu-cache) |\n| [0496-next-greater-element-i](https://github.com/bmukesh23/DSA/tree/master/0496-next-greater-element-i) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/bmukesh23/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0966-binary-subarrays-with-sum](https://github.com/bmukesh23/DSA/tree/master/0966-binary-subarrays-with-sum) |\n| [1364-tuple-with-same-product](https://github.com/bmukesh23/DSA/tree/master/1364-tuple-with-same-product) |\n| [1370-count-number-of-nice-subarrays](https://github.com/bmukesh23/DSA/tree/master/1370-count-number-of-nice-subarrays) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/bmukesh23/DSA/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n| [1890-sum-of-beauty-of-all-substrings](https://github.com/bmukesh23/DSA/tree/master/1890-sum-of-beauty-of-all-substrings) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/bmukesh23/DSA/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0042-trapping-rain-water](https://github.com/bmukesh23/DSA/tree/master/0042-trapping-rain-water) |\n| [0045-jump-game-ii](https://github.com/bmukesh23/DSA/tree/master/0045-jump-game-ii) |\n| [0053-maximum-subarray](https://github.com/bmukesh23/DSA/tree/master/0053-maximum-subarray) |\n| [0055-jump-game](https://github.com/bmukesh23/DSA/tree/master/0055-jump-game) |\n| [0118-pascals-triangle](https://github.com/bmukesh23/DSA/tree/master/0118-pascals-triangle) |\n| [0119-pascals-triangle-ii](https://github.com/bmukesh23/DSA/tree/master/0119-pascals-triangle-ii) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/bmukesh23/DSA/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/bmukesh23/DSA/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0131-palindrome-partitioning](https://github.com/bmukesh23/DSA/tree/master/0131-palindrome-partitioning) |\n| [0435-non-overlapping-intervals](https://github.com/bmukesh23/DSA/tree/master/0435-non-overlapping-intervals) |\n| [0678-valid-parenthesis-string](https://github.com/bmukesh23/DSA/tree/master/0678-valid-parenthesis-string) |\n| [0943-sum-of-subarray-minimums](https://github.com/bmukesh23/DSA/tree/master/0943-sum-of-subarray-minimums) |\n| [1013-fibonacci-number](https://github.com/bmukesh23/DSA/tree/master/1013-fibonacci-number) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/bmukesh23/DSA/tree/master/0002-add-two-numbers) |\n| [0021-merge-two-sorted-lists](https://github.com/bmukesh23/DSA/tree/master/0021-merge-two-sorted-lists) |\n| [0025-reverse-nodes-in-k-group](https://github.com/bmukesh23/DSA/tree/master/0025-reverse-nodes-in-k-group) |\n| [0050-powx-n](https://github.com/bmukesh23/DSA/tree/master/0050-powx-n) |\n| [0206-reverse-linked-list](https://github.com/bmukesh23/DSA/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/bmukesh23/DSA/tree/master/0234-palindrome-linked-list) |\n| [1013-fibonacci-number](https://github.com/bmukesh23/DSA/tree/master/1013-fibonacci-number) |\n| [2050-count-good-numbers](https://github.com/bmukesh23/DSA/tree/master/2050-count-good-numbers) |\n## Memoization\n|  |\n| ------- |\n| [1013-fibonacci-number](https://github.com/bmukesh23/DSA/tree/master/1013-fibonacci-number) |\n## Two Pointers\n|  |\n| ------- |\n| [0015-3sum](https://github.com/bmukesh23/DSA/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/bmukesh23/DSA/tree/master/0018-4sum) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/bmukesh23/DSA/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/bmukesh23/DSA/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0031-next-permutation](https://github.com/bmukesh23/DSA/tree/master/0031-next-permutation) |\n| [0042-trapping-rain-water](https://github.com/bmukesh23/DSA/tree/master/0042-trapping-rain-water) |\n| [0061-rotate-list](https://github.com/bmukesh23/DSA/tree/master/0061-rotate-list) |\n| [0075-sort-colors](https://github.com/bmukesh23/DSA/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0088-merge-sorted-array) |\n| [0125-valid-palindrome](https://github.com/bmukesh23/DSA/tree/master/0125-valid-palindrome) |\n| [0141-linked-list-cycle](https://github.com/bmukesh23/DSA/tree/master/0141-linked-list-cycle) |\n| [0148-sort-list](https://github.com/bmukesh23/DSA/tree/master/0148-sort-list) |\n| [0151-reverse-words-in-a-string](https://github.com/bmukesh23/DSA/tree/master/0151-reverse-words-in-a-string) |\n| [0160-intersection-of-two-linked-lists](https://github.com/bmukesh23/DSA/tree/master/0160-intersection-of-two-linked-lists) |\n| [0165-compare-version-numbers](https://github.com/bmukesh23/DSA/tree/master/0165-compare-version-numbers) |\n| [0189-rotate-array](https://github.com/bmukesh23/DSA/tree/master/0189-rotate-array) |\n| [0234-palindrome-linked-list](https://github.com/bmukesh23/DSA/tree/master/0234-palindrome-linked-list) |\n| [0283-move-zeroes](https://github.com/bmukesh23/DSA/tree/master/0283-move-zeroes) |\n| [0287-find-the-duplicate-number](https://github.com/bmukesh23/DSA/tree/master/0287-find-the-duplicate-number) |\n| [0455-assign-cookies](https://github.com/bmukesh23/DSA/tree/master/0455-assign-cookies) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/bmukesh23/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0908-middle-of-the-linked-list](https://github.com/bmukesh23/DSA/tree/master/0908-middle-of-the-linked-list) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/bmukesh23/DSA/tree/master/2271-rearrange-array-elements-by-sign) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/bmukesh23/DSA/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0008-string-to-integer-atoi](https://github.com/bmukesh23/DSA/tree/master/0008-string-to-integer-atoi) |\n| [0013-roman-to-integer](https://github.com/bmukesh23/DSA/tree/master/0013-roman-to-integer) |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/bmukesh23/DSA/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0020-valid-parentheses](https://github.com/bmukesh23/DSA/tree/master/0020-valid-parentheses) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/bmukesh23/DSA/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0038-count-and-say](https://github.com/bmukesh23/DSA/tree/master/0038-count-and-say) |\n| [0079-word-search](https://github.com/bmukesh23/DSA/tree/master/0079-word-search) |\n| [0125-valid-palindrome](https://github.com/bmukesh23/DSA/tree/master/0125-valid-palindrome) |\n| [0131-palindrome-partitioning](https://github.com/bmukesh23/DSA/tree/master/0131-palindrome-partitioning) |\n| [0151-reverse-words-in-a-string](https://github.com/bmukesh23/DSA/tree/master/0151-reverse-words-in-a-string) |\n| [0165-compare-version-numbers](https://github.com/bmukesh23/DSA/tree/master/0165-compare-version-numbers) |\n| [0205-isomorphic-strings](https://github.com/bmukesh23/DSA/tree/master/0205-isomorphic-strings) |\n| [0242-valid-anagram](https://github.com/bmukesh23/DSA/tree/master/0242-valid-anagram) |\n| [0402-remove-k-digits](https://github.com/bmukesh23/DSA/tree/master/0402-remove-k-digits) |\n| [0424-longest-repeating-character-replacement](https://github.com/bmukesh23/DSA/tree/master/0424-longest-repeating-character-replacement) |\n| [0678-valid-parenthesis-string](https://github.com/bmukesh23/DSA/tree/master/0678-valid-parenthesis-string) |\n| [0686-repeated-string-match](https://github.com/bmukesh23/DSA/tree/master/0686-repeated-string-match) |\n| [0812-rotate-string](https://github.com/bmukesh23/DSA/tree/master/0812-rotate-string) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/bmukesh23/DSA/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1078-remove-outermost-parentheses](https://github.com/bmukesh23/DSA/tree/master/1078-remove-outermost-parentheses) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/bmukesh23/DSA/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/bmukesh23/DSA/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |\n| [1890-sum-of-beauty-of-all-substrings](https://github.com/bmukesh23/DSA/tree/master/1890-sum-of-beauty-of-all-substrings) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/bmukesh23/DSA/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2032-largest-odd-number-in-string](https://github.com/bmukesh23/DSA/tree/master/2032-largest-odd-number-in-string) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/bmukesh23/DSA/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/bmukesh23/DSA/tree/master/0018-4sum) |\n| [0056-merge-intervals](https://github.com/bmukesh23/DSA/tree/master/0056-merge-intervals) |\n| [0075-sort-colors](https://github.com/bmukesh23/DSA/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0088-merge-sorted-array) |\n| [0148-sort-list](https://github.com/bmukesh23/DSA/tree/master/0148-sort-list) |\n| [0169-majority-element](https://github.com/bmukesh23/DSA/tree/master/0169-majority-element) |\n| [0217-contains-duplicate](https://github.com/bmukesh23/DSA/tree/master/0217-contains-duplicate) |\n| [0229-majority-element-ii](https://github.com/bmukesh23/DSA/tree/master/0229-majority-element-ii) |\n| [0242-valid-anagram](https://github.com/bmukesh23/DSA/tree/master/0242-valid-anagram) |\n| [0268-missing-number](https://github.com/bmukesh23/DSA/tree/master/0268-missing-number) |\n| [0435-non-overlapping-intervals](https://github.com/bmukesh23/DSA/tree/master/0435-non-overlapping-intervals) |\n| [0455-assign-cookies](https://github.com/bmukesh23/DSA/tree/master/0455-assign-cookies) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/bmukesh23/DSA/tree/master/1966-frequency-of-the-most-frequent-element) |\n## Binary Search\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/bmukesh23/DSA/tree/master/0004-median-of-two-sorted-arrays) |\n| [0033-search-in-rotated-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0033-search-in-rotated-sorted-array) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0035-search-insert-position](https://github.com/bmukesh23/DSA/tree/master/0035-search-insert-position) |\n| [0074-search-a-2d-matrix](https://github.com/bmukesh23/DSA/tree/master/0074-search-a-2d-matrix) |\n| [0081-search-in-rotated-sorted-array-ii](https://github.com/bmukesh23/DSA/tree/master/0081-search-in-rotated-sorted-array-ii) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0162-find-peak-element](https://github.com/bmukesh23/DSA/tree/master/0162-find-peak-element) |\n| [0240-search-a-2d-matrix-ii](https://github.com/bmukesh23/DSA/tree/master/0240-search-a-2d-matrix-ii) |\n| [0268-missing-number](https://github.com/bmukesh23/DSA/tree/master/0268-missing-number) |\n| [0287-find-the-duplicate-number](https://github.com/bmukesh23/DSA/tree/master/0287-find-the-duplicate-number) |\n| [0493-reverse-pairs](https://github.com/bmukesh23/DSA/tree/master/0493-reverse-pairs) |\n| [0540-single-element-in-a-sorted-array](https://github.com/bmukesh23/DSA/tree/master/0540-single-element-in-a-sorted-array) |\n| [0792-binary-search](https://github.com/bmukesh23/DSA/tree/master/0792-binary-search) |\n| [1046-max-consecutive-ones-iii](https://github.com/bmukesh23/DSA/tree/master/1046-max-consecutive-ones-iii) |\n| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/bmukesh23/DSA/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |\n| [1646-kth-missing-positive-number](https://github.com/bmukesh23/DSA/tree/master/1646-kth-missing-positive-number) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/bmukesh23/DSA/tree/master/1966-frequency-of-the-most-frequent-element) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0078-subsets](https://github.com/bmukesh23/DSA/tree/master/0078-subsets) |\n| [0090-subsets-ii](https://github.com/bmukesh23/DSA/tree/master/0090-subsets-ii) |\n| [0136-single-number](https://github.com/bmukesh23/DSA/tree/master/0136-single-number) |\n| [0268-missing-number](https://github.com/bmukesh23/DSA/tree/master/0268-missing-number) |\n| [0287-find-the-duplicate-number](https://github.com/bmukesh23/DSA/tree/master/0287-find-the-duplicate-number) |\n## Greedy\n|  |\n| ------- |\n| [0045-jump-game-ii](https://github.com/bmukesh23/DSA/tree/master/0045-jump-game-ii) |\n| [0055-jump-game](https://github.com/bmukesh23/DSA/tree/master/0055-jump-game) |\n| [0402-remove-k-digits](https://github.com/bmukesh23/DSA/tree/master/0402-remove-k-digits) |\n| [0435-non-overlapping-intervals](https://github.com/bmukesh23/DSA/tree/master/0435-non-overlapping-intervals) |\n| [0455-assign-cookies](https://github.com/bmukesh23/DSA/tree/master/0455-assign-cookies) |\n| [0678-valid-parenthesis-string](https://github.com/bmukesh23/DSA/tree/master/0678-valid-parenthesis-string) |\n| [0890-lemonade-change](https://github.com/bmukesh23/DSA/tree/master/0890-lemonade-change) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/bmukesh23/DSA/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/bmukesh23/DSA/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [2032-largest-odd-number-in-string](https://github.com/bmukesh23/DSA/tree/master/2032-largest-odd-number-in-string) |\n## Sliding Window\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/bmukesh23/DSA/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0424-longest-repeating-character-replacement](https://github.com/bmukesh23/DSA/tree/master/0424-longest-repeating-character-replacement) |\n| [0966-binary-subarrays-with-sum](https://github.com/bmukesh23/DSA/tree/master/0966-binary-subarrays-with-sum) |\n| [1046-max-consecutive-ones-iii](https://github.com/bmukesh23/DSA/tree/master/1046-max-consecutive-ones-iii) |\n| [1370-count-number-of-nice-subarrays](https://github.com/bmukesh23/DSA/tree/master/1370-count-number-of-nice-subarrays) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/bmukesh23/DSA/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/bmukesh23/DSA/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n| [1755-defuse-the-bomb](https://github.com/bmukesh23/DSA/tree/master/1755-defuse-the-bomb) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/bmukesh23/DSA/tree/master/1966-frequency-of-the-most-frequent-element) |\n## Prefix Sum\n|  |\n| ------- |\n| [0966-binary-subarrays-with-sum](https://github.com/bmukesh23/DSA/tree/master/0966-binary-subarrays-with-sum) |\n| [1046-max-consecutive-ones-iii](https://github.com/bmukesh23/DSA/tree/master/1046-max-consecutive-ones-iii) |\n| [1370-count-number-of-nice-subarrays](https://github.com/bmukesh23/DSA/tree/master/1370-count-number-of-nice-subarrays) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/bmukesh23/DSA/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/bmukesh23/DSA/tree/master/1966-frequency-of-the-most-frequent-element) |\n## Database\n|  |\n| ------- |\n| [0176-second-highest-salary](https://github.com/bmukesh23/DSA/tree/master/0176-second-highest-salary) |\n| [0180-consecutive-numbers](https://github.com/bmukesh23/DSA/tree/master/0180-consecutive-numbers) |\n| [0196-delete-duplicate-emails](https://github.com/bmukesh23/DSA/tree/master/0196-delete-duplicate-emails) |\n| [0197-rising-temperature](https://github.com/bmukesh23/DSA/tree/master/0197-rising-temperature) |\n| [0570-managers-with-at-least-5-direct-reports](https://github.com/bmukesh23/DSA/tree/master/0570-managers-with-at-least-5-direct-reports) |\n| [0577-employee-bonus](https://github.com/bmukesh23/DSA/tree/master/0577-employee-bonus) |\n| [0584-find-customer-referee](https://github.com/bmukesh23/DSA/tree/master/0584-find-customer-referee) |\n| [0585-investments-in-2016](https://github.com/bmukesh23/DSA/tree/master/0585-investments-in-2016) |\n| [0595-big-countries](https://github.com/bmukesh23/DSA/tree/master/0595-big-countries) |\n| [0596-classes-more-than-5-students](https://github.com/bmukesh23/DSA/tree/master/0596-classes-more-than-5-students) |\n| [0602-friend-requests-ii-who-has-the-most-friends](https://github.com/bmukesh23/DSA/tree/master/0602-friend-requests-ii-who-has-the-most-friends) |\n| [0610-triangle-judgement](https://github.com/bmukesh23/DSA/tree/master/0610-triangle-judgement) |\n| [0619-biggest-single-number](https://github.com/bmukesh23/DSA/tree/master/0619-biggest-single-number) |\n| [0620-not-boring-movies](https://github.com/bmukesh23/DSA/tree/master/0620-not-boring-movies) |\n| [0626-exchange-seats](https://github.com/bmukesh23/DSA/tree/master/0626-exchange-seats) |\n| [1070-product-sales-analysis-iii](https://github.com/bmukesh23/DSA/tree/master/1070-product-sales-analysis-iii) |\n| [1135-customers-who-bought-all-products](https://github.com/bmukesh23/DSA/tree/master/1135-customers-who-bought-all-products) |\n| [1153-product-sales-analysis-i](https://github.com/bmukesh23/DSA/tree/master/1153-product-sales-analysis-i) |\n| [1155-product-sales-analysis-iii](https://github.com/bmukesh23/DSA/tree/master/1155-product-sales-analysis-iii) |\n| [1161-project-employees-i](https://github.com/bmukesh23/DSA/tree/master/1161-project-employees-i) |\n| [1182-game-play-analysis-iv](https://github.com/bmukesh23/DSA/tree/master/1182-game-play-analysis-iv) |\n| [1245-user-activity-for-the-past-30-days-i](https://github.com/bmukesh23/DSA/tree/master/1245-user-activity-for-the-past-30-days-i) |\n| [1258-article-views-i](https://github.com/bmukesh23/DSA/tree/master/1258-article-views-i) |\n| [1278-product-price-at-a-given-date](https://github.com/bmukesh23/DSA/tree/master/1278-product-price-at-a-given-date) |\n| [1292-immediate-food-delivery-ii](https://github.com/bmukesh23/DSA/tree/master/1292-immediate-food-delivery-ii) |\n| [1317-monthly-transactions-i](https://github.com/bmukesh23/DSA/tree/master/1317-monthly-transactions-i) |\n| [1327-last-person-to-fit-in-the-bus](https://github.com/bmukesh23/DSA/tree/master/1327-last-person-to-fit-in-the-bus) |\n| [1338-queries-quality-and-percentage](https://github.com/bmukesh23/DSA/tree/master/1338-queries-quality-and-percentage) |\n| [1390-average-selling-price](https://github.com/bmukesh23/DSA/tree/master/1390-average-selling-price) |\n| [1415-students-and-examinations](https://github.com/bmukesh23/DSA/tree/master/1415-students-and-examinations) |\n| [1452-restaurant-growth](https://github.com/bmukesh23/DSA/tree/master/1452-restaurant-growth) |\n| [1462-list-the-products-ordered-in-a-period](https://github.com/bmukesh23/DSA/tree/master/1462-list-the-products-ordered-in-a-period) |\n| [1480-movie-rating](https://github.com/bmukesh23/DSA/tree/master/1480-movie-rating) |\n| [1509-replace-employee-id-with-the-unique-identifier](https://github.com/bmukesh23/DSA/tree/master/1509-replace-employee-id-with-the-unique-identifier) |\n| [1625-group-sold-products-by-the-date](https://github.com/bmukesh23/DSA/tree/master/1625-group-sold-products-by-the-date) |\n| [1664-find-users-with-valid-e-mails](https://github.com/bmukesh23/DSA/tree/master/1664-find-users-with-valid-e-mails) |\n| [1670-patients-with-a-condition](https://github.com/bmukesh23/DSA/tree/master/1670-patients-with-a-condition) |\n| [1724-customer-who-visited-but-did-not-make-any-transactions](https://github.com/bmukesh23/DSA/tree/master/1724-customer-who-visited-but-did-not-make-any-transactions) |\n| [1773-percentage-of-users-attended-a-contest](https://github.com/bmukesh23/DSA/tree/master/1773-percentage-of-users-attended-a-contest) |\n| [1801-average-time-of-process-per-machine](https://github.com/bmukesh23/DSA/tree/master/1801-average-time-of-process-per-machine) |\n| [1811-fix-names-in-a-table](https://github.com/bmukesh23/DSA/tree/master/1811-fix-names-in-a-table) |\n| [1827-invalid-tweets](https://github.com/bmukesh23/DSA/tree/master/1827-invalid-tweets) |\n| [1877-find-followers-count](https://github.com/bmukesh23/DSA/tree/master/1877-find-followers-count) |\n| [1882-the-number-of-employees-which-report-to-each-employee](https://github.com/bmukesh23/DSA/tree/master/1882-the-number-of-employees-which-report-to-each-employee) |\n| [1908-recyclable-and-low-fat-products](https://github.com/bmukesh23/DSA/tree/master/1908-recyclable-and-low-fat-products) |\n| [1942-primary-department-for-each-employee](https://github.com/bmukesh23/DSA/tree/master/1942-primary-department-for-each-employee) |\n| [2057-count-salary-categories](https://github.com/bmukesh23/DSA/tree/master/2057-count-salary-categories) |\n| [2087-confirmation-rate](https://github.com/bmukesh23/DSA/tree/master/2087-confirmation-rate) |\n| [2127-employees-whose-manager-left-the-company](https://github.com/bmukesh23/DSA/tree/master/2127-employees-whose-manager-left-the-company) |\n| [2495-number-of-unique-subjects-taught-by-each-teacher](https://github.com/bmukesh23/DSA/tree/master/2495-number-of-unique-subjects-taught-by-each-teacher) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/bmukesh23/DSA/tree/master/0004-median-of-two-sorted-arrays) |\n| [0053-maximum-subarray](https://github.com/bmukesh23/DSA/tree/master/0053-maximum-subarray) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0148-sort-list](https://github.com/bmukesh23/DSA/tree/master/0148-sort-list) |\n| [0169-majority-element](https://github.com/bmukesh23/DSA/tree/master/0169-majority-element) |\n| [0240-search-a-2d-matrix-ii](https://github.com/bmukesh23/DSA/tree/master/0240-search-a-2d-matrix-ii) |\n| [0493-reverse-pairs](https://github.com/bmukesh23/DSA/tree/master/0493-reverse-pairs) |\n## Counting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/bmukesh23/DSA/tree/master/0169-majority-element) |\n| [0229-majority-element-ii](https://github.com/bmukesh23/DSA/tree/master/0229-majority-element-ii) |\n| [1364-tuple-with-same-product](https://github.com/bmukesh23/DSA/tree/master/1364-tuple-with-same-product) |\n| [1890-sum-of-beauty-of-all-substrings](https://github.com/bmukesh23/DSA/tree/master/1890-sum-of-beauty-of-all-substrings) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/bmukesh23/DSA/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n## Simulation\n|  |\n| ------- |\n| [0735-asteroid-collision](https://github.com/bmukesh23/DSA/tree/master/0735-asteroid-collision) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/bmukesh23/DSA/tree/master/2271-rearrange-array-elements-by-sign) |\n| [2324-find-triangular-sum-of-an-array](https://github.com/bmukesh23/DSA/tree/master/2324-find-triangular-sum-of-an-array) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/bmukesh23/DSA/tree/master/0128-longest-consecutive-sequence) |\n## Matrix\n|  |\n| ------- |\n| [0048-rotate-image](https://github.com/bmukesh23/DSA/tree/master/0048-rotate-image) |\n| [0073-set-matrix-zeroes](https://github.com/bmukesh23/DSA/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/bmukesh23/DSA/tree/master/0074-search-a-2d-matrix) |\n| [0079-word-search](https://github.com/bmukesh23/DSA/tree/master/0079-word-search) |\n| [0240-search-a-2d-matrix-ii](https://github.com/bmukesh23/DSA/tree/master/0240-search-a-2d-matrix-ii) |\n## Combinatorics\n|  |\n| ------- |\n| [2324-find-triangular-sum-of-an-array](https://github.com/bmukesh23/DSA/tree/master/2324-find-triangular-sum-of-an-array) |\n## Binary Indexed Tree\n|  |\n| ------- |\n| [0493-reverse-pairs](https://github.com/bmukesh23/DSA/tree/master/0493-reverse-pairs) |\n## Segment Tree\n|  |\n| ------- |\n| [0493-reverse-pairs](https://github.com/bmukesh23/DSA/tree/master/0493-reverse-pairs) |\n## Merge Sort\n|  |\n| ------- |\n| [0148-sort-list](https://github.com/bmukesh23/DSA/tree/master/0148-sort-list) |\n| [0493-reverse-pairs](https://github.com/bmukesh23/DSA/tree/master/0493-reverse-pairs) |\n## Ordered Set\n|  |\n| ------- |\n| [0493-reverse-pairs](https://github.com/bmukesh23/DSA/tree/master/0493-reverse-pairs) |\n## String Matching\n|  |\n| ------- |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/bmukesh23/DSA/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0686-repeated-string-match](https://github.com/bmukesh23/DSA/tree/master/0686-repeated-string-match) |\n| [0812-rotate-string](https://github.com/bmukesh23/DSA/tree/master/0812-rotate-string) |\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/bmukesh23/DSA/tree/master/0002-add-two-numbers) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/bmukesh23/DSA/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0021-merge-two-sorted-lists](https://github.com/bmukesh23/DSA/tree/master/0021-merge-two-sorted-lists) |\n| [0025-reverse-nodes-in-k-group](https://github.com/bmukesh23/DSA/tree/master/0025-reverse-nodes-in-k-group) |\n| [0061-rotate-list](https://github.com/bmukesh23/DSA/tree/master/0061-rotate-list) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/bmukesh23/DSA/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0138-copy-list-with-random-pointer](https://github.com/bmukesh23/DSA/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/bmukesh23/DSA/tree/master/0141-linked-list-cycle) |\n| [0146-lru-cache](https://github.com/bmukesh23/DSA/tree/master/0146-lru-cache) |\n| [0148-sort-list](https://github.com/bmukesh23/DSA/tree/master/0148-sort-list) |\n| [0160-intersection-of-two-linked-lists](https://github.com/bmukesh23/DSA/tree/master/0160-intersection-of-two-linked-lists) |\n| [0206-reverse-linked-list](https://github.com/bmukesh23/DSA/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/bmukesh23/DSA/tree/master/0234-palindrome-linked-list) |\n| [0237-delete-node-in-a-linked-list](https://github.com/bmukesh23/DSA/tree/master/0237-delete-node-in-a-linked-list) |\n| [0328-odd-even-linked-list](https://github.com/bmukesh23/DSA/tree/master/0328-odd-even-linked-list) |\n| [0460-lfu-cache](https://github.com/bmukesh23/DSA/tree/master/0460-lfu-cache) |\n| [0908-middle-of-the-linked-list](https://github.com/bmukesh23/DSA/tree/master/0908-middle-of-the-linked-list) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/bmukesh23/DSA/tree/master/0020-valid-parentheses) |\n| [0042-trapping-rain-water](https://github.com/bmukesh23/DSA/tree/master/0042-trapping-rain-water) |\n| [0094-binary-tree-inorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/bmukesh23/DSA/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0144-binary-tree-preorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0155-min-stack](https://github.com/bmukesh23/DSA/tree/master/0155-min-stack) |\n| [0173-binary-search-tree-iterator](https://github.com/bmukesh23/DSA/tree/master/0173-binary-search-tree-iterator) |\n| [0225-implement-stack-using-queues](https://github.com/bmukesh23/DSA/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/bmukesh23/DSA/tree/master/0232-implement-queue-using-stacks) |\n| [0234-palindrome-linked-list](https://github.com/bmukesh23/DSA/tree/master/0234-palindrome-linked-list) |\n| [0402-remove-k-digits](https://github.com/bmukesh23/DSA/tree/master/0402-remove-k-digits) |\n| [0496-next-greater-element-i](https://github.com/bmukesh23/DSA/tree/master/0496-next-greater-element-i) |\n| [0503-next-greater-element-ii](https://github.com/bmukesh23/DSA/tree/master/0503-next-greater-element-ii) |\n| [0678-valid-parenthesis-string](https://github.com/bmukesh23/DSA/tree/master/0678-valid-parenthesis-string) |\n| [0735-asteroid-collision](https://github.com/bmukesh23/DSA/tree/master/0735-asteroid-collision) |\n| [0937-online-stock-span](https://github.com/bmukesh23/DSA/tree/master/0937-online-stock-span) |\n| [0943-sum-of-subarray-minimums](https://github.com/bmukesh23/DSA/tree/master/0943-sum-of-subarray-minimums) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/bmukesh23/DSA/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/bmukesh23/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [1078-remove-outermost-parentheses](https://github.com/bmukesh23/DSA/tree/master/1078-remove-outermost-parentheses) |\n| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/bmukesh23/DSA/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |\n| [2227-sum-of-subarray-ranges](https://github.com/bmukesh23/DSA/tree/master/2227-sum-of-subarray-ranges) |\n## Backtracking\n|  |\n| ------- |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/bmukesh23/DSA/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0039-combination-sum](https://github.com/bmukesh23/DSA/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/bmukesh23/DSA/tree/master/0040-combination-sum-ii) |\n| [0078-subsets](https://github.com/bmukesh23/DSA/tree/master/0078-subsets) |\n| [0079-word-search](https://github.com/bmukesh23/DSA/tree/master/0079-word-search) |\n| [0090-subsets-ii](https://github.com/bmukesh23/DSA/tree/master/0090-subsets-ii) |\n| [0131-palindrome-partitioning](https://github.com/bmukesh23/DSA/tree/master/0131-palindrome-partitioning) |\n| [0216-combination-sum-iii](https://github.com/bmukesh23/DSA/tree/master/0216-combination-sum-iii) |\n## Depth-First Search\n|  |\n| ------- |\n| [0079-word-search](https://github.com/bmukesh23/DSA/tree/master/0079-word-search) |\n| [0094-binary-tree-inorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/bmukesh23/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/bmukesh23/DSA/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/bmukesh23/DSA/tree/master/0101-symmetric-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0110-balanced-binary-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/bmukesh23/DSA/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/bmukesh23/DSA/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0144-binary-tree-preorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/bmukesh23/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/bmukesh23/DSA/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0543-diameter-of-binary-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/bmukesh23/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0662-maximum-width-of-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0662-maximum-width-of-binary-tree) |\n## Design\n|  |\n| ------- |\n| [0146-lru-cache](https://github.com/bmukesh23/DSA/tree/master/0146-lru-cache) |\n| [0155-min-stack](https://github.com/bmukesh23/DSA/tree/master/0155-min-stack) |\n| [0173-binary-search-tree-iterator](https://github.com/bmukesh23/DSA/tree/master/0173-binary-search-tree-iterator) |\n| [0225-implement-stack-using-queues](https://github.com/bmukesh23/DSA/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/bmukesh23/DSA/tree/master/0232-implement-queue-using-stacks) |\n| [0460-lfu-cache](https://github.com/bmukesh23/DSA/tree/master/0460-lfu-cache) |\n| [0937-online-stock-span](https://github.com/bmukesh23/DSA/tree/master/0937-online-stock-span) |\n## Queue\n|  |\n| ------- |\n| [0225-implement-stack-using-queues](https://github.com/bmukesh23/DSA/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/bmukesh23/DSA/tree/master/0232-implement-queue-using-stacks) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0042-trapping-rain-water](https://github.com/bmukesh23/DSA/tree/master/0042-trapping-rain-water) |\n| [0402-remove-k-digits](https://github.com/bmukesh23/DSA/tree/master/0402-remove-k-digits) |\n| [0496-next-greater-element-i](https://github.com/bmukesh23/DSA/tree/master/0496-next-greater-element-i) |\n| [0503-next-greater-element-ii](https://github.com/bmukesh23/DSA/tree/master/0503-next-greater-element-ii) |\n| [0937-online-stock-span](https://github.com/bmukesh23/DSA/tree/master/0937-online-stock-span) |\n| [0943-sum-of-subarray-minimums](https://github.com/bmukesh23/DSA/tree/master/0943-sum-of-subarray-minimums) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/bmukesh23/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [2227-sum-of-subarray-ranges](https://github.com/bmukesh23/DSA/tree/master/2227-sum-of-subarray-ranges) |\n## Doubly-Linked List\n|  |\n| ------- |\n| [0146-lru-cache](https://github.com/bmukesh23/DSA/tree/master/0146-lru-cache) |\n| [0460-lfu-cache](https://github.com/bmukesh23/DSA/tree/master/0460-lfu-cache) |\n## Data Stream\n|  |\n| ------- |\n| [0937-online-stock-span](https://github.com/bmukesh23/DSA/tree/master/0937-online-stock-span) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/bmukesh23/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/bmukesh23/DSA/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/bmukesh23/DSA/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/bmukesh23/DSA/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/bmukesh23/DSA/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0110-balanced-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0110-balanced-binary-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/bmukesh23/DSA/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/bmukesh23/DSA/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0144-binary-tree-preorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0173-binary-search-tree-iterator](https://github.com/bmukesh23/DSA/tree/master/0173-binary-search-tree-iterator) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/bmukesh23/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/bmukesh23/DSA/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0543-diameter-of-binary-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/bmukesh23/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0662-maximum-width-of-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0662-maximum-width-of-binary-tree) |\n| [0783-search-in-a-binary-search-tree](https://github.com/bmukesh23/DSA/tree/master/0783-search-in-a-binary-search-tree) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/bmukesh23/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/bmukesh23/DSA/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/bmukesh23/DSA/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/bmukesh23/DSA/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/bmukesh23/DSA/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/bmukesh23/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0662-maximum-width-of-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0662-maximum-width-of-binary-tree) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/bmukesh23/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/bmukesh23/DSA/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/bmukesh23/DSA/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/bmukesh23/DSA/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/bmukesh23/DSA/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0110-balanced-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0110-balanced-binary-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/bmukesh23/DSA/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/bmukesh23/DSA/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0144-binary-tree-preorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/bmukesh23/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0173-binary-search-tree-iterator](https://github.com/bmukesh23/DSA/tree/master/0173-binary-search-tree-iterator) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/bmukesh23/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/bmukesh23/DSA/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0543-diameter-of-binary-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/bmukesh23/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0662-maximum-width-of-binary-tree](https://github.com/bmukesh23/DSA/tree/master/0662-maximum-width-of-binary-tree) |\n| [0783-search-in-a-binary-search-tree](https://github.com/bmukesh23/DSA/tree/master/0783-search-in-a-binary-search-tree) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/bmukesh23/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0098-validate-binary-search-tree](https://github.com/bmukesh23/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0173-binary-search-tree-iterator](https://github.com/bmukesh23/DSA/tree/master/0173-binary-search-tree-iterator) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/bmukesh23/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/bmukesh23/DSA/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/bmukesh23/DSA/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0783-search-in-a-binary-search-tree](https://github.com/bmukesh23/DSA/tree/master/0783-search-in-a-binary-search-tree) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/bmukesh23/DSA/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n## Iterator\n|  |\n| ------- |\n| [0173-binary-search-tree-iterator](https://github.com/bmukesh23/DSA/tree/master/0173-binary-search-tree-iterator) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbmukesh23%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbmukesh23%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbmukesh23%2Fdsa/lists"}