{"id":24775172,"url":"https://github.com/anshu10101/leetcode","last_synced_at":"2025-08-25T23:03:11.902Z","repository":{"id":273334356,"uuid":"792842954","full_name":"Anshu10101/LeetCode","owner":"Anshu10101","description":"Collection of my solved LeetCode DSA questions ! ","archived":false,"fork":false,"pushed_at":"2025-08-16T05:15:16.000Z","size":488,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-16T07:15:39.781Z","etag":null,"topics":["algorithms","data-structures"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/Anshul00ydv/","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/Anshu10101.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":"2024-04-27T17:52:44.000Z","updated_at":"2025-08-16T05:15:19.000Z","dependencies_parsed_at":"2025-02-27T11:33:46.942Z","dependency_job_id":"a63c0f13-db27-4bbd-a9ae-4761fefb470a","html_url":"https://github.com/Anshu10101/LeetCode","commit_stats":null,"previous_names":["anshu10101/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Anshu10101/LeetCode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anshu10101%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anshu10101%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anshu10101%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anshu10101%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Anshu10101","download_url":"https://codeload.github.com/Anshu10101/LeetCode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anshu10101%2FLeetCode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272144649,"owners_count":24881141,"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","status":"online","status_checked_at":"2025-08-25T02:00:12.092Z","response_time":1107,"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":["algorithms","data-structures"],"created_at":"2025-01-29T06:38:56.599Z","updated_at":"2025-08-25T23:03:11.892Z","avatar_url":"https://github.com/Anshu10101.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode\nCollection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub)\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Anshu10101/LeetCode/tree/master/0002-add-two-numbers) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/Anshu10101/LeetCode/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0021-merge-two-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0021-merge-two-sorted-lists) |\n| [0023-merge-k-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0023-merge-k-sorted-lists) |\n| [0024-swap-nodes-in-pairs](https://github.com/Anshu10101/LeetCode/tree/master/0024-swap-nodes-in-pairs) |\n| [0061-rotate-list](https://github.com/Anshu10101/LeetCode/tree/master/0061-rotate-list) |\n| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/Anshu10101/LeetCode/tree/master/0082-remove-duplicates-from-sorted-list-ii) |\n| [0083-remove-duplicates-from-sorted-list](https://github.com/Anshu10101/LeetCode/tree/master/0083-remove-duplicates-from-sorted-list) |\n| [0086-partition-list](https://github.com/Anshu10101/LeetCode/tree/master/0086-partition-list) |\n| [0092-reverse-linked-list-ii](https://github.com/Anshu10101/LeetCode/tree/master/0092-reverse-linked-list-ii) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0138-copy-list-with-random-pointer](https://github.com/Anshu10101/LeetCode/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/Anshu10101/LeetCode/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/Anshu10101/LeetCode/tree/master/0142-linked-list-cycle-ii) |\n| [0148-sort-list](https://github.com/Anshu10101/LeetCode/tree/master/0148-sort-list) |\n| [0160-intersection-of-two-linked-lists](https://github.com/Anshu10101/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |\n| [0206-reverse-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0234-palindrome-linked-list) |\n| [0237-delete-node-in-a-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0237-delete-node-in-a-linked-list) |\n| [0328-odd-even-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0328-odd-even-linked-list) |\n| [0528-swapping-nodes-in-a-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0528-swapping-nodes-in-a-linked-list) |\n| [0908-middle-of-the-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0908-middle-of-the-linked-list) |\n| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/Anshu10101/LeetCode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n| [2573-remove-nodes-from-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/2573-remove-nodes-from-linked-list) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Anshu10101/LeetCode/tree/master/0002-add-two-numbers) |\n| [0021-merge-two-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0021-merge-two-sorted-lists) |\n| [0024-swap-nodes-in-pairs](https://github.com/Anshu10101/LeetCode/tree/master/0024-swap-nodes-in-pairs) |\n| [0206-reverse-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0206-reverse-linked-list) |\n| [0231-power-of-two](https://github.com/Anshu10101/LeetCode/tree/master/0231-power-of-two) |\n| [0234-palindrome-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0234-palindrome-linked-list) |\n| [1197-parsing-a-boolean-expression](https://github.com/Anshu10101/LeetCode/tree/master/1197-parsing-a-boolean-expression) |\n| [2573-remove-nodes-from-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/2573-remove-nodes-from-linked-list) |\n## Two Pointers\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/Anshu10101/LeetCode/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/Anshu10101/LeetCode/tree/master/0015-3sum) |\n| [0016-3sum-closest](https://github.com/Anshu10101/LeetCode/tree/master/0016-3sum-closest) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/Anshu10101/LeetCode/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0031-next-permutation](https://github.com/Anshu10101/LeetCode/tree/master/0031-next-permutation) |\n| [0042-trapping-rain-water](https://github.com/Anshu10101/LeetCode/tree/master/0042-trapping-rain-water) |\n| [0061-rotate-list](https://github.com/Anshu10101/LeetCode/tree/master/0061-rotate-list) |\n| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/Anshu10101/LeetCode/tree/master/0082-remove-duplicates-from-sorted-list-ii) |\n| [0086-partition-list](https://github.com/Anshu10101/LeetCode/tree/master/0086-partition-list) |\n| [0088-merge-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0088-merge-sorted-array) |\n| [0125-valid-palindrome](https://github.com/Anshu10101/LeetCode/tree/master/0125-valid-palindrome) |\n| [0141-linked-list-cycle](https://github.com/Anshu10101/LeetCode/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/Anshu10101/LeetCode/tree/master/0142-linked-list-cycle-ii) |\n| [0148-sort-list](https://github.com/Anshu10101/LeetCode/tree/master/0148-sort-list) |\n| [0160-intersection-of-two-linked-lists](https://github.com/Anshu10101/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |\n| [0234-palindrome-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0234-palindrome-linked-list) |\n| [0283-move-zeroes](https://github.com/Anshu10101/LeetCode/tree/master/0283-move-zeroes) |\n| [0528-swapping-nodes-in-a-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0528-swapping-nodes-in-a-linked-list) |\n| [0696-count-binary-substrings](https://github.com/Anshu10101/LeetCode/tree/master/0696-count-binary-substrings) |\n| [0811-number-of-subarrays-with-bounded-maximum](https://github.com/Anshu10101/LeetCode/tree/master/0811-number-of-subarrays-with-bounded-maximum) |\n| [0908-middle-of-the-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0908-middle-of-the-linked-list) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/Anshu10101/LeetCode/tree/master/0001-two-sum) |\n| [0049-group-anagrams](https://github.com/Anshu10101/LeetCode/tree/master/0049-group-anagrams) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0128-longest-consecutive-sequence](https://github.com/Anshu10101/LeetCode/tree/master/0128-longest-consecutive-sequence) |\n| [0138-copy-list-with-random-pointer](https://github.com/Anshu10101/LeetCode/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/Anshu10101/LeetCode/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/Anshu10101/LeetCode/tree/master/0142-linked-list-cycle-ii) |\n| [0149-max-points-on-a-line](https://github.com/Anshu10101/LeetCode/tree/master/0149-max-points-on-a-line) |\n| [0160-intersection-of-two-linked-lists](https://github.com/Anshu10101/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |\n| [0242-valid-anagram](https://github.com/Anshu10101/LeetCode/tree/master/0242-valid-anagram) |\n| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |\n| [0387-first-unique-character-in-a-string](https://github.com/Anshu10101/LeetCode/tree/master/0387-first-unique-character-in-a-string) |\n| [0523-continuous-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0523-continuous-subarray-sum) |\n| [0525-contiguous-array](https://github.com/Anshu10101/LeetCode/tree/master/0525-contiguous-array) |\n| [0554-brick-wall](https://github.com/Anshu10101/LeetCode/tree/master/0554-brick-wall) |\n| [0560-subarray-sum-equals-k](https://github.com/Anshu10101/LeetCode/tree/master/0560-subarray-sum-equals-k) |\n| [0782-jewels-and-stones](https://github.com/Anshu10101/LeetCode/tree/master/0782-jewels-and-stones) |\n| [0905-length-of-longest-fibonacci-subsequence](https://github.com/Anshu10101/LeetCode/tree/master/0905-length-of-longest-fibonacci-subsequence) |\n| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |\n| [0966-binary-subarrays-with-sum](https://github.com/Anshu10101/LeetCode/tree/master/0966-binary-subarrays-with-sum) |\n| [1044-find-common-characters](https://github.com/Anshu10101/LeetCode/tree/master/1044-find-common-characters) |\n| [1160-letter-tile-possibilities](https://github.com/Anshu10101/LeetCode/tree/master/1160-letter-tile-possibilities) |\n| [1364-tuple-with-same-product](https://github.com/Anshu10101/LeetCode/tree/master/1364-tuple-with-same-product) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Anshu10101/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2107-find-unique-binary-string](https://github.com/Anshu10101/LeetCode/tree/master/2107-find-unique-binary-string) |\n| [2119-minimum-number-of-operations-to-make-array-continuous](https://github.com/Anshu10101/LeetCode/tree/master/2119-minimum-number-of-operations-to-make-array-continuous) |\n| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/Anshu10101/LeetCode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |\n| [2434-design-a-number-container-system](https://github.com/Anshu10101/LeetCode/tree/master/2434-design-a-number-container-system) |\n| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/Anshu10101/LeetCode/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |\n| [3914-check-if-any-element-has-prime-frequency](https://github.com/Anshu10101/LeetCode/tree/master/3914-check-if-any-element-has-prime-frequency) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/0020-valid-parentheses) |\n| [0042-trapping-rain-water](https://github.com/Anshu10101/LeetCode/tree/master/0042-trapping-rain-water) |\n| [0071-simplify-path](https://github.com/Anshu10101/LeetCode/tree/master/0071-simplify-path) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0155-min-stack](https://github.com/Anshu10101/LeetCode/tree/master/0155-min-stack) |\n| [0225-implement-stack-using-queues](https://github.com/Anshu10101/LeetCode/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/Anshu10101/LeetCode/tree/master/0232-implement-queue-using-stacks) |\n| [0234-palindrome-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0234-palindrome-linked-list) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Anshu10101/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1078-remove-outermost-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/1078-remove-outermost-parentheses) |\n| [1197-parsing-a-boolean-expression](https://github.com/Anshu10101/LeetCode/tree/master/1197-parsing-a-boolean-expression) |\n| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |\n| [2021-remove-all-occurrences-of-a-substring](https://github.com/Anshu10101/LeetCode/tree/master/2021-remove-all-occurrences-of-a-substring) |\n| [2456-construct-smallest-number-from-di-string](https://github.com/Anshu10101/LeetCode/tree/master/2456-construct-smallest-number-from-di-string) |\n| [2573-remove-nodes-from-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/2573-remove-nodes-from-linked-list) |\n| [3447-clear-digits](https://github.com/Anshu10101/LeetCode/tree/master/3447-clear-digits) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Anshu10101/LeetCode/tree/master/0002-add-two-numbers) |\n| [0069-sqrtx](https://github.com/Anshu10101/LeetCode/tree/master/0069-sqrtx) |\n| [0070-climbing-stairs](https://github.com/Anshu10101/LeetCode/tree/master/0070-climbing-stairs) |\n| [0149-max-points-on-a-line](https://github.com/Anshu10101/LeetCode/tree/master/0149-max-points-on-a-line) |\n| [0231-power-of-two](https://github.com/Anshu10101/LeetCode/tree/master/0231-power-of-two) |\n| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |\n| [0523-continuous-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0523-continuous-subarray-sum) |\n| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/Anshu10101/LeetCode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |\n| [1477-product-of-the-last-k-numbers](https://github.com/Anshu10101/LeetCode/tree/master/1477-product-of-the-last-k-numbers) |\n| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Anshu10101/LeetCode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |\n| [2802-find-the-punishment-number-of-an-integer](https://github.com/Anshu10101/LeetCode/tree/master/2802-find-the-punishment-number-of-an-integer) |\n| [3704-count-partitions-with-even-sum-difference](https://github.com/Anshu10101/LeetCode/tree/master/3704-count-partitions-with-even-sum-difference) |\n| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/Anshu10101/LeetCode/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |\n| [3914-check-if-any-element-has-prime-frequency](https://github.com/Anshu10101/LeetCode/tree/master/3914-check-if-any-element-has-prime-frequency) |\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/Anshu10101/LeetCode/tree/master/0001-two-sum) |\n| [0011-container-with-most-water](https://github.com/Anshu10101/LeetCode/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/Anshu10101/LeetCode/tree/master/0015-3sum) |\n| [0016-3sum-closest](https://github.com/Anshu10101/LeetCode/tree/master/0016-3sum-closest) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0031-next-permutation](https://github.com/Anshu10101/LeetCode/tree/master/0031-next-permutation) |\n| [0033-search-in-rotated-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0033-search-in-rotated-sorted-array) |\n| [0042-trapping-rain-water](https://github.com/Anshu10101/LeetCode/tree/master/0042-trapping-rain-water) |\n| [0049-group-anagrams](https://github.com/Anshu10101/LeetCode/tree/master/0049-group-anagrams) |\n| [0051-n-queens](https://github.com/Anshu10101/LeetCode/tree/master/0051-n-queens) |\n| [0088-merge-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0088-merge-sorted-array) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Anshu10101/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0128-longest-consecutive-sequence](https://github.com/Anshu10101/LeetCode/tree/master/0128-longest-consecutive-sequence) |\n| [0149-max-points-on-a-line](https://github.com/Anshu10101/LeetCode/tree/master/0149-max-points-on-a-line) |\n| [0209-minimum-size-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0209-minimum-size-subarray-sum) |\n| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |\n| [0283-move-zeroes](https://github.com/Anshu10101/LeetCode/tree/master/0283-move-zeroes) |\n| [0303-range-sum-query-immutable](https://github.com/Anshu10101/LeetCode/tree/master/0303-range-sum-query-immutable) |\n| [0322-coin-change](https://github.com/Anshu10101/LeetCode/tree/master/0322-coin-change) |\n| [0494-target-sum](https://github.com/Anshu10101/LeetCode/tree/master/0494-target-sum) |\n| [0518-coin-change-ii](https://github.com/Anshu10101/LeetCode/tree/master/0518-coin-change-ii) |\n| [0523-continuous-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0523-continuous-subarray-sum) |\n| [0525-contiguous-array](https://github.com/Anshu10101/LeetCode/tree/master/0525-contiguous-array) |\n| [0554-brick-wall](https://github.com/Anshu10101/LeetCode/tree/master/0554-brick-wall) |\n| [0560-subarray-sum-equals-k](https://github.com/Anshu10101/LeetCode/tree/master/0560-subarray-sum-equals-k) |\n| [0811-number-of-subarrays-with-bounded-maximum](https://github.com/Anshu10101/LeetCode/tree/master/0811-number-of-subarrays-with-bounded-maximum) |\n| [0905-length-of-longest-fibonacci-subsequence](https://github.com/Anshu10101/LeetCode/tree/master/0905-length-of-longest-fibonacci-subsequence) |\n| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |\n| [0966-binary-subarrays-with-sum](https://github.com/Anshu10101/LeetCode/tree/master/0966-binary-subarrays-with-sum) |\n| [1044-find-common-characters](https://github.com/Anshu10101/LeetCode/tree/master/1044-find-common-characters) |\n| [1364-tuple-with-same-product](https://github.com/Anshu10101/LeetCode/tree/master/1364-tuple-with-same-product) |\n| [1477-product-of-the-last-k-numbers](https://github.com/Anshu10101/LeetCode/tree/master/1477-product-of-the-last-k-numbers) |\n| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Anshu10101/LeetCode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |\n| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/Anshu10101/LeetCode/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |\n| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/Anshu10101/LeetCode/tree/master/1849-maximum-absolute-sum-of-any-subarray) |\n| [1878-check-if-array-is-sorted-and-rotated](https://github.com/Anshu10101/LeetCode/tree/master/1878-check-if-array-is-sorted-and-rotated) |\n| [1927-maximum-ascending-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/1927-maximum-ascending-subarray-sum) |\n| [2107-find-unique-binary-string](https://github.com/Anshu10101/LeetCode/tree/master/2107-find-unique-binary-string) |\n| [2119-minimum-number-of-operations-to-make-array-continuous](https://github.com/Anshu10101/LeetCode/tree/master/2119-minimum-number-of-operations-to-make-array-continuous) |\n| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/Anshu10101/LeetCode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |\n| [2564-most-profitable-path-in-a-tree](https://github.com/Anshu10101/LeetCode/tree/master/2564-most-profitable-path-in-a-tree) |\n| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/Anshu10101/LeetCode/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |\n| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/Anshu10101/LeetCode/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |\n| [3429-special-array-i](https://github.com/Anshu10101/LeetCode/tree/master/3429-special-array-i) |\n| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/Anshu10101/LeetCode/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |\n| [3704-count-partitions-with-even-sum-difference](https://github.com/Anshu10101/LeetCode/tree/master/3704-count-partitions-with-even-sum-difference) |\n| [3914-check-if-any-element-has-prime-frequency](https://github.com/Anshu10101/LeetCode/tree/master/3914-check-if-any-element-has-prime-frequency) |\n## Prefix Sum\n|  |\n| ------- |\n| [0209-minimum-size-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0209-minimum-size-subarray-sum) |\n| [0303-range-sum-query-immutable](https://github.com/Anshu10101/LeetCode/tree/master/0303-range-sum-query-immutable) |\n| [0523-continuous-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0523-continuous-subarray-sum) |\n| [0525-contiguous-array](https://github.com/Anshu10101/LeetCode/tree/master/0525-contiguous-array) |\n| [0560-subarray-sum-equals-k](https://github.com/Anshu10101/LeetCode/tree/master/0560-subarray-sum-equals-k) |\n| [0966-binary-subarrays-with-sum](https://github.com/Anshu10101/LeetCode/tree/master/0966-binary-subarrays-with-sum) |\n| [1477-product-of-the-last-k-numbers](https://github.com/Anshu10101/LeetCode/tree/master/1477-product-of-the-last-k-numbers) |\n| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Anshu10101/LeetCode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |\n| [3704-count-partitions-with-even-sum-difference](https://github.com/Anshu10101/LeetCode/tree/master/3704-count-partitions-with-even-sum-difference) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0042-trapping-rain-water](https://github.com/Anshu10101/LeetCode/tree/master/0042-trapping-rain-water) |\n| [2573-remove-nodes-from-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/2573-remove-nodes-from-linked-list) |\n## String\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/0020-valid-parentheses) |\n| [0049-group-anagrams](https://github.com/Anshu10101/LeetCode/tree/master/0049-group-anagrams) |\n| [0071-simplify-path](https://github.com/Anshu10101/LeetCode/tree/master/0071-simplify-path) |\n| [0125-valid-palindrome](https://github.com/Anshu10101/LeetCode/tree/master/0125-valid-palindrome) |\n| [0131-palindrome-partitioning](https://github.com/Anshu10101/LeetCode/tree/master/0131-palindrome-partitioning) |\n| [0242-valid-anagram](https://github.com/Anshu10101/LeetCode/tree/master/0242-valid-anagram) |\n| [0387-first-unique-character-in-a-string](https://github.com/Anshu10101/LeetCode/tree/master/0387-first-unique-character-in-a-string) |\n| [0696-count-binary-substrings](https://github.com/Anshu10101/LeetCode/tree/master/0696-count-binary-substrings) |\n| [0782-jewels-and-stones](https://github.com/Anshu10101/LeetCode/tree/master/0782-jewels-and-stones) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Anshu10101/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1044-find-common-characters](https://github.com/Anshu10101/LeetCode/tree/master/1044-find-common-characters) |\n| [1078-remove-outermost-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/1078-remove-outermost-parentheses) |\n| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/1093-recover-a-tree-from-preorder-traversal) |\n| [1160-letter-tile-possibilities](https://github.com/Anshu10101/LeetCode/tree/master/1160-letter-tile-possibilities) |\n| [1170-shortest-common-supersequence](https://github.com/Anshu10101/LeetCode/tree/master/1170-shortest-common-supersequence) |\n| [1197-parsing-a-boolean-expression](https://github.com/Anshu10101/LeetCode/tree/master/1197-parsing-a-boolean-expression) |\n| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/Anshu10101/LeetCode/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |\n| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Anshu10101/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2021-remove-all-occurrences-of-a-substring](https://github.com/Anshu10101/LeetCode/tree/master/2021-remove-all-occurrences-of-a-substring) |\n| [2107-find-unique-binary-string](https://github.com/Anshu10101/LeetCode/tree/master/2107-find-unique-binary-string) |\n| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/Anshu10101/LeetCode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |\n| [2456-construct-smallest-number-from-di-string](https://github.com/Anshu10101/LeetCode/tree/master/2456-construct-smallest-number-from-di-string) |\n| [3447-clear-digits](https://github.com/Anshu10101/LeetCode/tree/master/3447-clear-digits) |\n| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/Anshu10101/LeetCode/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |\n## Design\n|  |\n| ------- |\n| [0155-min-stack](https://github.com/Anshu10101/LeetCode/tree/master/0155-min-stack) |\n| [0225-implement-stack-using-queues](https://github.com/Anshu10101/LeetCode/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/Anshu10101/LeetCode/tree/master/0232-implement-queue-using-stacks) |\n| [0303-range-sum-query-immutable](https://github.com/Anshu10101/LeetCode/tree/master/0303-range-sum-query-immutable) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n| [1477-product-of-the-last-k-numbers](https://github.com/Anshu10101/LeetCode/tree/master/1477-product-of-the-last-k-numbers) |\n| [2434-design-a-number-container-system](https://github.com/Anshu10101/LeetCode/tree/master/2434-design-a-number-container-system) |\n## Queue\n|  |\n| ------- |\n| [0225-implement-stack-using-queues](https://github.com/Anshu10101/LeetCode/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/Anshu10101/LeetCode/tree/master/0232-implement-queue-using-stacks) |\n| [0387-first-unique-character-in-a-string](https://github.com/Anshu10101/LeetCode/tree/master/0387-first-unique-character-in-a-string) |\n## Counting\n|  |\n| ------- |\n| [0387-first-unique-character-in-a-string](https://github.com/Anshu10101/LeetCode/tree/master/0387-first-unique-character-in-a-string) |\n| [1160-letter-tile-possibilities](https://github.com/Anshu10101/LeetCode/tree/master/1160-letter-tile-possibilities) |\n| [1364-tuple-with-same-product](https://github.com/Anshu10101/LeetCode/tree/master/1364-tuple-with-same-product) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Anshu10101/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/Anshu10101/LeetCode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |\n| [3914-check-if-any-element-has-prime-frequency](https://github.com/Anshu10101/LeetCode/tree/master/3914-check-if-any-element-has-prime-frequency) |\n## Simulation\n|  |\n| ------- |\n| [2021-remove-all-occurrences-of-a-substring](https://github.com/Anshu10101/LeetCode/tree/master/2021-remove-all-occurrences-of-a-substring) |\n| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/Anshu10101/LeetCode/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |\n| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/Anshu10101/LeetCode/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |\n| [3447-clear-digits](https://github.com/Anshu10101/LeetCode/tree/master/3447-clear-digits) |\n| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/Anshu10101/LeetCode/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0023-merge-k-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0023-merge-k-sorted-lists) |\n| [2434-design-a-number-container-system](https://github.com/Anshu10101/LeetCode/tree/master/2434-design-a-number-container-system) |\n| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/Anshu10101/LeetCode/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |\n## Ordered Set\n|  |\n| ------- |\n| [2434-design-a-number-container-system](https://github.com/Anshu10101/LeetCode/tree/master/2434-design-a-number-container-system) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/Anshu10101/LeetCode/tree/master/0015-3sum) |\n| [0016-3sum-closest](https://github.com/Anshu10101/LeetCode/tree/master/0016-3sum-closest) |\n| [0049-group-anagrams](https://github.com/Anshu10101/LeetCode/tree/master/0049-group-anagrams) |\n| [0088-merge-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0088-merge-sorted-array) |\n| [0148-sort-list](https://github.com/Anshu10101/LeetCode/tree/master/0148-sort-list) |\n| [0242-valid-anagram](https://github.com/Anshu10101/LeetCode/tree/master/0242-valid-anagram) |\n| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |\n## Data Stream\n|  |\n| ------- |\n| [1477-product-of-the-last-k-numbers](https://github.com/Anshu10101/LeetCode/tree/master/1477-product-of-the-last-k-numbers) |\n## Backtracking\n|  |\n| ------- |\n| [0051-n-queens](https://github.com/Anshu10101/LeetCode/tree/master/0051-n-queens) |\n| [0131-palindrome-partitioning](https://github.com/Anshu10101/LeetCode/tree/master/0131-palindrome-partitioning) |\n| [0494-target-sum](https://github.com/Anshu10101/LeetCode/tree/master/0494-target-sum) |\n| [1160-letter-tile-possibilities](https://github.com/Anshu10101/LeetCode/tree/master/1160-letter-tile-possibilities) |\n| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/Anshu10101/LeetCode/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |\n| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/Anshu10101/LeetCode/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |\n| [2107-find-unique-binary-string](https://github.com/Anshu10101/LeetCode/tree/master/2107-find-unique-binary-string) |\n| [2456-construct-smallest-number-from-di-string](https://github.com/Anshu10101/LeetCode/tree/master/2456-construct-smallest-number-from-di-string) |\n| [2802-find-the-punishment-number-of-an-integer](https://github.com/Anshu10101/LeetCode/tree/master/2802-find-the-punishment-number-of-an-integer) |\n## Greedy\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/Anshu10101/LeetCode/tree/master/0011-container-with-most-water) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Anshu10101/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/Anshu10101/LeetCode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |\n| [2456-construct-smallest-number-from-di-string](https://github.com/Anshu10101/LeetCode/tree/master/2456-construct-smallest-number-from-di-string) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/Anshu10101/LeetCode/tree/master/0128-longest-consecutive-sequence) |\n## Tree\n|  |\n| ------- |\n| [0101-symmetric-tree](https://github.com/Anshu10101/LeetCode/tree/master/0101-symmetric-tree) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Anshu10101/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |\n| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/1093-recover-a-tree-from-preorder-traversal) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n| [2564-most-profitable-path-in-a-tree](https://github.com/Anshu10101/LeetCode/tree/master/2564-most-profitable-path-in-a-tree) |\n## Depth-First Search\n|  |\n| ------- |\n| [0101-symmetric-tree](https://github.com/Anshu10101/LeetCode/tree/master/0101-symmetric-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/1093-recover-a-tree-from-preorder-traversal) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n| [2564-most-profitable-path-in-a-tree](https://github.com/Anshu10101/LeetCode/tree/master/2564-most-profitable-path-in-a-tree) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0101-symmetric-tree](https://github.com/Anshu10101/LeetCode/tree/master/0101-symmetric-tree) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0322-coin-change](https://github.com/Anshu10101/LeetCode/tree/master/0322-coin-change) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n| [2564-most-profitable-path-in-a-tree](https://github.com/Anshu10101/LeetCode/tree/master/2564-most-profitable-path-in-a-tree) |\n## Binary Tree\n|  |\n| ------- |\n| [0101-symmetric-tree](https://github.com/Anshu10101/LeetCode/tree/master/0101-symmetric-tree) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Anshu10101/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |\n| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/1093-recover-a-tree-from-preorder-traversal) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0023-merge-k-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0023-merge-k-sorted-lists) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Anshu10101/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0148-sort-list](https://github.com/Anshu10101/LeetCode/tree/master/0148-sort-list) |\n| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |\n## Combinatorics\n|  |\n| ------- |\n| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/Anshu10101/LeetCode/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |\n## Number Theory\n|  |\n| ------- |\n| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/Anshu10101/LeetCode/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |\n| [3914-check-if-any-element-has-prime-frequency](https://github.com/Anshu10101/LeetCode/tree/master/3914-check-if-any-element-has-prime-frequency) |\n## Graph\n|  |\n| ------- |\n| [2564-most-profitable-path-in-a-tree](https://github.com/Anshu10101/LeetCode/tree/master/2564-most-profitable-path-in-a-tree) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0042-trapping-rain-water](https://github.com/Anshu10101/LeetCode/tree/master/0042-trapping-rain-water) |\n| [0070-climbing-stairs](https://github.com/Anshu10101/LeetCode/tree/master/0070-climbing-stairs) |\n| [0131-palindrome-partitioning](https://github.com/Anshu10101/LeetCode/tree/master/0131-palindrome-partitioning) |\n| [0322-coin-change](https://github.com/Anshu10101/LeetCode/tree/master/0322-coin-change) |\n| [0494-target-sum](https://github.com/Anshu10101/LeetCode/tree/master/0494-target-sum) |\n| [0518-coin-change-ii](https://github.com/Anshu10101/LeetCode/tree/master/0518-coin-change-ii) |\n| [0905-length-of-longest-fibonacci-subsequence](https://github.com/Anshu10101/LeetCode/tree/master/0905-length-of-longest-fibonacci-subsequence) |\n| [1170-shortest-common-supersequence](https://github.com/Anshu10101/LeetCode/tree/master/1170-shortest-common-supersequence) |\n| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Anshu10101/LeetCode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |\n| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/Anshu10101/LeetCode/tree/master/1849-maximum-absolute-sum-of-any-subarray) |\n## Binary Search\n|  |\n| ------- |\n| [0033-search-in-rotated-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0033-search-in-rotated-sorted-array) |\n| [0069-sqrtx](https://github.com/Anshu10101/LeetCode/tree/master/0069-sqrtx) |\n| [0209-minimum-size-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0209-minimum-size-subarray-sum) |\n| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |\n| [2119-minimum-number-of-operations-to-make-array-continuous](https://github.com/Anshu10101/LeetCode/tree/master/2119-minimum-number-of-operations-to-make-array-continuous) |\n## Sliding Window\n|  |\n| ------- |\n| [0209-minimum-size-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0209-minimum-size-subarray-sum) |\n| [0966-binary-subarrays-with-sum](https://github.com/Anshu10101/LeetCode/tree/master/0966-binary-subarrays-with-sum) |\n| [2119-minimum-number-of-operations-to-make-array-continuous](https://github.com/Anshu10101/LeetCode/tree/master/2119-minimum-number-of-operations-to-make-array-continuous) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0231-power-of-two](https://github.com/Anshu10101/LeetCode/tree/master/0231-power-of-two) |\n| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/Anshu10101/LeetCode/tree/master/0070-climbing-stairs) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Anshu10101/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n## Geometry\n|  |\n| ------- |\n| [0149-max-points-on-a-line](https://github.com/Anshu10101/LeetCode/tree/master/0149-max-points-on-a-line) |\n## Merge Sort\n|  |\n| ------- |\n| [0023-merge-k-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0023-merge-k-sorted-lists) |\n| [0148-sort-list](https://github.com/Anshu10101/LeetCode/tree/master/0148-sort-list) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanshu10101%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanshu10101%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanshu10101%2Fleetcode/lists"}