https://github.com/anshu10101/leetcode
Collection of my solved LeetCode DSA questions !
https://github.com/anshu10101/leetcode
algorithms data-structures
Last synced: 7 months ago
JSON representation
Collection of my solved LeetCode DSA questions !
- Host: GitHub
- URL: https://github.com/anshu10101/leetcode
- Owner: Anshu10101
- Created: 2024-04-27T17:52:44.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2025-08-16T05:15:16.000Z (8 months ago)
- Last Synced: 2025-08-16T07:15:39.781Z (8 months ago)
- Topics: algorithms, data-structures
- Language: Java
- Homepage: https://leetcode.com/u/Anshul00ydv/
- Size: 477 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode
Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub)
# LeetCode Topics
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Anshu10101/LeetCode/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Anshu10101/LeetCode/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0021-merge-two-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0021-merge-two-sorted-lists) |
| [0023-merge-k-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0023-merge-k-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/Anshu10101/LeetCode/tree/master/0024-swap-nodes-in-pairs) |
| [0061-rotate-list](https://github.com/Anshu10101/LeetCode/tree/master/0061-rotate-list) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/Anshu10101/LeetCode/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/Anshu10101/LeetCode/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0086-partition-list](https://github.com/Anshu10101/LeetCode/tree/master/0086-partition-list) |
| [0092-reverse-linked-list-ii](https://github.com/Anshu10101/LeetCode/tree/master/0092-reverse-linked-list-ii) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0138-copy-list-with-random-pointer](https://github.com/Anshu10101/LeetCode/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/Anshu10101/LeetCode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Anshu10101/LeetCode/tree/master/0142-linked-list-cycle-ii) |
| [0148-sort-list](https://github.com/Anshu10101/LeetCode/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/Anshu10101/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |
| [0206-reverse-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0234-palindrome-linked-list) |
| [0237-delete-node-in-a-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0237-delete-node-in-a-linked-list) |
| [0328-odd-even-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0328-odd-even-linked-list) |
| [0528-swapping-nodes-in-a-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0528-swapping-nodes-in-a-linked-list) |
| [0908-middle-of-the-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0908-middle-of-the-linked-list) |
| [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) |
| [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) |
| [2573-remove-nodes-from-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/2573-remove-nodes-from-linked-list) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Anshu10101/LeetCode/tree/master/0002-add-two-numbers) |
| [0021-merge-two-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0021-merge-two-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/Anshu10101/LeetCode/tree/master/0024-swap-nodes-in-pairs) |
| [0206-reverse-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0206-reverse-linked-list) |
| [0231-power-of-two](https://github.com/Anshu10101/LeetCode/tree/master/0231-power-of-two) |
| [0234-palindrome-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0234-palindrome-linked-list) |
| [1197-parsing-a-boolean-expression](https://github.com/Anshu10101/LeetCode/tree/master/1197-parsing-a-boolean-expression) |
| [2573-remove-nodes-from-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/2573-remove-nodes-from-linked-list) |
## Two Pointers
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Anshu10101/LeetCode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/Anshu10101/LeetCode/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/Anshu10101/LeetCode/tree/master/0016-3sum-closest) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Anshu10101/LeetCode/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0031-next-permutation](https://github.com/Anshu10101/LeetCode/tree/master/0031-next-permutation) |
| [0042-trapping-rain-water](https://github.com/Anshu10101/LeetCode/tree/master/0042-trapping-rain-water) |
| [0061-rotate-list](https://github.com/Anshu10101/LeetCode/tree/master/0061-rotate-list) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/Anshu10101/LeetCode/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0086-partition-list](https://github.com/Anshu10101/LeetCode/tree/master/0086-partition-list) |
| [0088-merge-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/Anshu10101/LeetCode/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/Anshu10101/LeetCode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Anshu10101/LeetCode/tree/master/0142-linked-list-cycle-ii) |
| [0148-sort-list](https://github.com/Anshu10101/LeetCode/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/Anshu10101/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |
| [0234-palindrome-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0234-palindrome-linked-list) |
| [0283-move-zeroes](https://github.com/Anshu10101/LeetCode/tree/master/0283-move-zeroes) |
| [0528-swapping-nodes-in-a-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0528-swapping-nodes-in-a-linked-list) |
| [0696-count-binary-substrings](https://github.com/Anshu10101/LeetCode/tree/master/0696-count-binary-substrings) |
| [0811-number-of-subarrays-with-bounded-maximum](https://github.com/Anshu10101/LeetCode/tree/master/0811-number-of-subarrays-with-bounded-maximum) |
| [0908-middle-of-the-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0908-middle-of-the-linked-list) |
| [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) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/Anshu10101/LeetCode/tree/master/0001-two-sum) |
| [0049-group-anagrams](https://github.com/Anshu10101/LeetCode/tree/master/0049-group-anagrams) |
| [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) |
| [0128-longest-consecutive-sequence](https://github.com/Anshu10101/LeetCode/tree/master/0128-longest-consecutive-sequence) |
| [0138-copy-list-with-random-pointer](https://github.com/Anshu10101/LeetCode/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/Anshu10101/LeetCode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Anshu10101/LeetCode/tree/master/0142-linked-list-cycle-ii) |
| [0149-max-points-on-a-line](https://github.com/Anshu10101/LeetCode/tree/master/0149-max-points-on-a-line) |
| [0160-intersection-of-two-linked-lists](https://github.com/Anshu10101/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |
| [0242-valid-anagram](https://github.com/Anshu10101/LeetCode/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |
| [0387-first-unique-character-in-a-string](https://github.com/Anshu10101/LeetCode/tree/master/0387-first-unique-character-in-a-string) |
| [0523-continuous-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0523-continuous-subarray-sum) |
| [0525-contiguous-array](https://github.com/Anshu10101/LeetCode/tree/master/0525-contiguous-array) |
| [0554-brick-wall](https://github.com/Anshu10101/LeetCode/tree/master/0554-brick-wall) |
| [0560-subarray-sum-equals-k](https://github.com/Anshu10101/LeetCode/tree/master/0560-subarray-sum-equals-k) |
| [0782-jewels-and-stones](https://github.com/Anshu10101/LeetCode/tree/master/0782-jewels-and-stones) |
| [0905-length-of-longest-fibonacci-subsequence](https://github.com/Anshu10101/LeetCode/tree/master/0905-length-of-longest-fibonacci-subsequence) |
| [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) |
| [0966-binary-subarrays-with-sum](https://github.com/Anshu10101/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [1044-find-common-characters](https://github.com/Anshu10101/LeetCode/tree/master/1044-find-common-characters) |
| [1160-letter-tile-possibilities](https://github.com/Anshu10101/LeetCode/tree/master/1160-letter-tile-possibilities) |
| [1364-tuple-with-same-product](https://github.com/Anshu10101/LeetCode/tree/master/1364-tuple-with-same-product) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
| [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) |
| [2107-find-unique-binary-string](https://github.com/Anshu10101/LeetCode/tree/master/2107-find-unique-binary-string) |
| [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) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/Anshu10101/LeetCode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2434-design-a-number-container-system](https://github.com/Anshu10101/LeetCode/tree/master/2434-design-a-number-container-system) |
| [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) |
| [3914-check-if-any-element-has-prime-frequency](https://github.com/Anshu10101/LeetCode/tree/master/3914-check-if-any-element-has-prime-frequency) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/0020-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/Anshu10101/LeetCode/tree/master/0042-trapping-rain-water) |
| [0071-simplify-path](https://github.com/Anshu10101/LeetCode/tree/master/0071-simplify-path) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0155-min-stack](https://github.com/Anshu10101/LeetCode/tree/master/0155-min-stack) |
| [0225-implement-stack-using-queues](https://github.com/Anshu10101/LeetCode/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/Anshu10101/LeetCode/tree/master/0232-implement-queue-using-stacks) |
| [0234-palindrome-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0234-palindrome-linked-list) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Anshu10101/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1078-remove-outermost-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/1078-remove-outermost-parentheses) |
| [1197-parsing-a-boolean-expression](https://github.com/Anshu10101/LeetCode/tree/master/1197-parsing-a-boolean-expression) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/Anshu10101/LeetCode/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2456-construct-smallest-number-from-di-string](https://github.com/Anshu10101/LeetCode/tree/master/2456-construct-smallest-number-from-di-string) |
| [2573-remove-nodes-from-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/2573-remove-nodes-from-linked-list) |
| [3447-clear-digits](https://github.com/Anshu10101/LeetCode/tree/master/3447-clear-digits) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Anshu10101/LeetCode/tree/master/0002-add-two-numbers) |
| [0069-sqrtx](https://github.com/Anshu10101/LeetCode/tree/master/0069-sqrtx) |
| [0070-climbing-stairs](https://github.com/Anshu10101/LeetCode/tree/master/0070-climbing-stairs) |
| [0149-max-points-on-a-line](https://github.com/Anshu10101/LeetCode/tree/master/0149-max-points-on-a-line) |
| [0231-power-of-two](https://github.com/Anshu10101/LeetCode/tree/master/0231-power-of-two) |
| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |
| [0523-continuous-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0523-continuous-subarray-sum) |
| [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) |
| [1477-product-of-the-last-k-numbers](https://github.com/Anshu10101/LeetCode/tree/master/1477-product-of-the-last-k-numbers) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Anshu10101/LeetCode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [2802-find-the-punishment-number-of-an-integer](https://github.com/Anshu10101/LeetCode/tree/master/2802-find-the-punishment-number-of-an-integer) |
| [3704-count-partitions-with-even-sum-difference](https://github.com/Anshu10101/LeetCode/tree/master/3704-count-partitions-with-even-sum-difference) |
| [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) |
| [3914-check-if-any-element-has-prime-frequency](https://github.com/Anshu10101/LeetCode/tree/master/3914-check-if-any-element-has-prime-frequency) |
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/Anshu10101/LeetCode/tree/master/0001-two-sum) |
| [0011-container-with-most-water](https://github.com/Anshu10101/LeetCode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/Anshu10101/LeetCode/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/Anshu10101/LeetCode/tree/master/0016-3sum-closest) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0031-next-permutation](https://github.com/Anshu10101/LeetCode/tree/master/0031-next-permutation) |
| [0033-search-in-rotated-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0033-search-in-rotated-sorted-array) |
| [0042-trapping-rain-water](https://github.com/Anshu10101/LeetCode/tree/master/0042-trapping-rain-water) |
| [0049-group-anagrams](https://github.com/Anshu10101/LeetCode/tree/master/0049-group-anagrams) |
| [0051-n-queens](https://github.com/Anshu10101/LeetCode/tree/master/0051-n-queens) |
| [0088-merge-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0088-merge-sorted-array) |
| [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) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Anshu10101/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0128-longest-consecutive-sequence](https://github.com/Anshu10101/LeetCode/tree/master/0128-longest-consecutive-sequence) |
| [0149-max-points-on-a-line](https://github.com/Anshu10101/LeetCode/tree/master/0149-max-points-on-a-line) |
| [0209-minimum-size-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0209-minimum-size-subarray-sum) |
| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |
| [0283-move-zeroes](https://github.com/Anshu10101/LeetCode/tree/master/0283-move-zeroes) |
| [0303-range-sum-query-immutable](https://github.com/Anshu10101/LeetCode/tree/master/0303-range-sum-query-immutable) |
| [0322-coin-change](https://github.com/Anshu10101/LeetCode/tree/master/0322-coin-change) |
| [0494-target-sum](https://github.com/Anshu10101/LeetCode/tree/master/0494-target-sum) |
| [0518-coin-change-ii](https://github.com/Anshu10101/LeetCode/tree/master/0518-coin-change-ii) |
| [0523-continuous-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0523-continuous-subarray-sum) |
| [0525-contiguous-array](https://github.com/Anshu10101/LeetCode/tree/master/0525-contiguous-array) |
| [0554-brick-wall](https://github.com/Anshu10101/LeetCode/tree/master/0554-brick-wall) |
| [0560-subarray-sum-equals-k](https://github.com/Anshu10101/LeetCode/tree/master/0560-subarray-sum-equals-k) |
| [0811-number-of-subarrays-with-bounded-maximum](https://github.com/Anshu10101/LeetCode/tree/master/0811-number-of-subarrays-with-bounded-maximum) |
| [0905-length-of-longest-fibonacci-subsequence](https://github.com/Anshu10101/LeetCode/tree/master/0905-length-of-longest-fibonacci-subsequence) |
| [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) |
| [0966-binary-subarrays-with-sum](https://github.com/Anshu10101/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [1044-find-common-characters](https://github.com/Anshu10101/LeetCode/tree/master/1044-find-common-characters) |
| [1364-tuple-with-same-product](https://github.com/Anshu10101/LeetCode/tree/master/1364-tuple-with-same-product) |
| [1477-product-of-the-last-k-numbers](https://github.com/Anshu10101/LeetCode/tree/master/1477-product-of-the-last-k-numbers) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Anshu10101/LeetCode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/Anshu10101/LeetCode/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |
| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/Anshu10101/LeetCode/tree/master/1849-maximum-absolute-sum-of-any-subarray) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/Anshu10101/LeetCode/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [1927-maximum-ascending-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/1927-maximum-ascending-subarray-sum) |
| [2107-find-unique-binary-string](https://github.com/Anshu10101/LeetCode/tree/master/2107-find-unique-binary-string) |
| [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) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/Anshu10101/LeetCode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2564-most-profitable-path-in-a-tree](https://github.com/Anshu10101/LeetCode/tree/master/2564-most-profitable-path-in-a-tree) |
| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/Anshu10101/LeetCode/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |
| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/Anshu10101/LeetCode/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |
| [3429-special-array-i](https://github.com/Anshu10101/LeetCode/tree/master/3429-special-array-i) |
| [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) |
| [3704-count-partitions-with-even-sum-difference](https://github.com/Anshu10101/LeetCode/tree/master/3704-count-partitions-with-even-sum-difference) |
| [3914-check-if-any-element-has-prime-frequency](https://github.com/Anshu10101/LeetCode/tree/master/3914-check-if-any-element-has-prime-frequency) |
## Prefix Sum
| |
| ------- |
| [0209-minimum-size-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0209-minimum-size-subarray-sum) |
| [0303-range-sum-query-immutable](https://github.com/Anshu10101/LeetCode/tree/master/0303-range-sum-query-immutable) |
| [0523-continuous-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0523-continuous-subarray-sum) |
| [0525-contiguous-array](https://github.com/Anshu10101/LeetCode/tree/master/0525-contiguous-array) |
| [0560-subarray-sum-equals-k](https://github.com/Anshu10101/LeetCode/tree/master/0560-subarray-sum-equals-k) |
| [0966-binary-subarrays-with-sum](https://github.com/Anshu10101/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [1477-product-of-the-last-k-numbers](https://github.com/Anshu10101/LeetCode/tree/master/1477-product-of-the-last-k-numbers) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Anshu10101/LeetCode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [3704-count-partitions-with-even-sum-difference](https://github.com/Anshu10101/LeetCode/tree/master/3704-count-partitions-with-even-sum-difference) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/Anshu10101/LeetCode/tree/master/0042-trapping-rain-water) |
| [2573-remove-nodes-from-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/2573-remove-nodes-from-linked-list) |
## String
| |
| ------- |
| [0020-valid-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/0020-valid-parentheses) |
| [0049-group-anagrams](https://github.com/Anshu10101/LeetCode/tree/master/0049-group-anagrams) |
| [0071-simplify-path](https://github.com/Anshu10101/LeetCode/tree/master/0071-simplify-path) |
| [0125-valid-palindrome](https://github.com/Anshu10101/LeetCode/tree/master/0125-valid-palindrome) |
| [0131-palindrome-partitioning](https://github.com/Anshu10101/LeetCode/tree/master/0131-palindrome-partitioning) |
| [0242-valid-anagram](https://github.com/Anshu10101/LeetCode/tree/master/0242-valid-anagram) |
| [0387-first-unique-character-in-a-string](https://github.com/Anshu10101/LeetCode/tree/master/0387-first-unique-character-in-a-string) |
| [0696-count-binary-substrings](https://github.com/Anshu10101/LeetCode/tree/master/0696-count-binary-substrings) |
| [0782-jewels-and-stones](https://github.com/Anshu10101/LeetCode/tree/master/0782-jewels-and-stones) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Anshu10101/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1044-find-common-characters](https://github.com/Anshu10101/LeetCode/tree/master/1044-find-common-characters) |
| [1078-remove-outermost-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/1078-remove-outermost-parentheses) |
| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/1093-recover-a-tree-from-preorder-traversal) |
| [1160-letter-tile-possibilities](https://github.com/Anshu10101/LeetCode/tree/master/1160-letter-tile-possibilities) |
| [1170-shortest-common-supersequence](https://github.com/Anshu10101/LeetCode/tree/master/1170-shortest-common-supersequence) |
| [1197-parsing-a-boolean-expression](https://github.com/Anshu10101/LeetCode/tree/master/1197-parsing-a-boolean-expression) |
| [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) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/Anshu10101/LeetCode/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
| [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) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/Anshu10101/LeetCode/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2107-find-unique-binary-string](https://github.com/Anshu10101/LeetCode/tree/master/2107-find-unique-binary-string) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/Anshu10101/LeetCode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2456-construct-smallest-number-from-di-string](https://github.com/Anshu10101/LeetCode/tree/master/2456-construct-smallest-number-from-di-string) |
| [3447-clear-digits](https://github.com/Anshu10101/LeetCode/tree/master/3447-clear-digits) |
| [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) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/Anshu10101/LeetCode/tree/master/0155-min-stack) |
| [0225-implement-stack-using-queues](https://github.com/Anshu10101/LeetCode/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/Anshu10101/LeetCode/tree/master/0232-implement-queue-using-stacks) |
| [0303-range-sum-query-immutable](https://github.com/Anshu10101/LeetCode/tree/master/0303-range-sum-query-immutable) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
| [1477-product-of-the-last-k-numbers](https://github.com/Anshu10101/LeetCode/tree/master/1477-product-of-the-last-k-numbers) |
| [2434-design-a-number-container-system](https://github.com/Anshu10101/LeetCode/tree/master/2434-design-a-number-container-system) |
## Queue
| |
| ------- |
| [0225-implement-stack-using-queues](https://github.com/Anshu10101/LeetCode/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/Anshu10101/LeetCode/tree/master/0232-implement-queue-using-stacks) |
| [0387-first-unique-character-in-a-string](https://github.com/Anshu10101/LeetCode/tree/master/0387-first-unique-character-in-a-string) |
## Counting
| |
| ------- |
| [0387-first-unique-character-in-a-string](https://github.com/Anshu10101/LeetCode/tree/master/0387-first-unique-character-in-a-string) |
| [1160-letter-tile-possibilities](https://github.com/Anshu10101/LeetCode/tree/master/1160-letter-tile-possibilities) |
| [1364-tuple-with-same-product](https://github.com/Anshu10101/LeetCode/tree/master/1364-tuple-with-same-product) |
| [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) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/Anshu10101/LeetCode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [3914-check-if-any-element-has-prime-frequency](https://github.com/Anshu10101/LeetCode/tree/master/3914-check-if-any-element-has-prime-frequency) |
## Simulation
| |
| ------- |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/Anshu10101/LeetCode/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/Anshu10101/LeetCode/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |
| [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) |
| [3447-clear-digits](https://github.com/Anshu10101/LeetCode/tree/master/3447-clear-digits) |
| [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) |
## Heap (Priority Queue)
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0023-merge-k-sorted-lists) |
| [2434-design-a-number-container-system](https://github.com/Anshu10101/LeetCode/tree/master/2434-design-a-number-container-system) |
| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/Anshu10101/LeetCode/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |
## Ordered Set
| |
| ------- |
| [2434-design-a-number-container-system](https://github.com/Anshu10101/LeetCode/tree/master/2434-design-a-number-container-system) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/Anshu10101/LeetCode/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/Anshu10101/LeetCode/tree/master/0016-3sum-closest) |
| [0049-group-anagrams](https://github.com/Anshu10101/LeetCode/tree/master/0049-group-anagrams) |
| [0088-merge-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0088-merge-sorted-array) |
| [0148-sort-list](https://github.com/Anshu10101/LeetCode/tree/master/0148-sort-list) |
| [0242-valid-anagram](https://github.com/Anshu10101/LeetCode/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |
## Data Stream
| |
| ------- |
| [1477-product-of-the-last-k-numbers](https://github.com/Anshu10101/LeetCode/tree/master/1477-product-of-the-last-k-numbers) |
## Backtracking
| |
| ------- |
| [0051-n-queens](https://github.com/Anshu10101/LeetCode/tree/master/0051-n-queens) |
| [0131-palindrome-partitioning](https://github.com/Anshu10101/LeetCode/tree/master/0131-palindrome-partitioning) |
| [0494-target-sum](https://github.com/Anshu10101/LeetCode/tree/master/0494-target-sum) |
| [1160-letter-tile-possibilities](https://github.com/Anshu10101/LeetCode/tree/master/1160-letter-tile-possibilities) |
| [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) |
| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/Anshu10101/LeetCode/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |
| [2107-find-unique-binary-string](https://github.com/Anshu10101/LeetCode/tree/master/2107-find-unique-binary-string) |
| [2456-construct-smallest-number-from-di-string](https://github.com/Anshu10101/LeetCode/tree/master/2456-construct-smallest-number-from-di-string) |
| [2802-find-the-punishment-number-of-an-integer](https://github.com/Anshu10101/LeetCode/tree/master/2802-find-the-punishment-number-of-an-integer) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Anshu10101/LeetCode/tree/master/0011-container-with-most-water) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Anshu10101/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/Anshu10101/LeetCode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2456-construct-smallest-number-from-di-string](https://github.com/Anshu10101/LeetCode/tree/master/2456-construct-smallest-number-from-di-string) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/Anshu10101/LeetCode/tree/master/0128-longest-consecutive-sequence) |
## Tree
| |
| ------- |
| [0101-symmetric-tree](https://github.com/Anshu10101/LeetCode/tree/master/0101-symmetric-tree) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [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) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Anshu10101/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [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) |
| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/1093-recover-a-tree-from-preorder-traversal) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
| [2564-most-profitable-path-in-a-tree](https://github.com/Anshu10101/LeetCode/tree/master/2564-most-profitable-path-in-a-tree) |
## Depth-First Search
| |
| ------- |
| [0101-symmetric-tree](https://github.com/Anshu10101/LeetCode/tree/master/0101-symmetric-tree) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/1093-recover-a-tree-from-preorder-traversal) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
| [2564-most-profitable-path-in-a-tree](https://github.com/Anshu10101/LeetCode/tree/master/2564-most-profitable-path-in-a-tree) |
## Breadth-First Search
| |
| ------- |
| [0101-symmetric-tree](https://github.com/Anshu10101/LeetCode/tree/master/0101-symmetric-tree) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0322-coin-change](https://github.com/Anshu10101/LeetCode/tree/master/0322-coin-change) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
| [2564-most-profitable-path-in-a-tree](https://github.com/Anshu10101/LeetCode/tree/master/2564-most-profitable-path-in-a-tree) |
## Binary Tree
| |
| ------- |
| [0101-symmetric-tree](https://github.com/Anshu10101/LeetCode/tree/master/0101-symmetric-tree) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/Anshu10101/LeetCode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [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) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Anshu10101/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/Anshu10101/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [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) |
| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Anshu10101/LeetCode/tree/master/1093-recover-a-tree-from-preorder-traversal) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Anshu10101/LeetCode/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
## Divide and Conquer
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0023-merge-k-sorted-lists) |
| [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) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Anshu10101/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0148-sort-list](https://github.com/Anshu10101/LeetCode/tree/master/0148-sort-list) |
| [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) |
## Combinatorics
| |
| ------- |
| [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) |
## Number Theory
| |
| ------- |
| [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) |
| [3914-check-if-any-element-has-prime-frequency](https://github.com/Anshu10101/LeetCode/tree/master/3914-check-if-any-element-has-prime-frequency) |
## Graph
| |
| ------- |
| [2564-most-profitable-path-in-a-tree](https://github.com/Anshu10101/LeetCode/tree/master/2564-most-profitable-path-in-a-tree) |
## Dynamic Programming
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/Anshu10101/LeetCode/tree/master/0042-trapping-rain-water) |
| [0070-climbing-stairs](https://github.com/Anshu10101/LeetCode/tree/master/0070-climbing-stairs) |
| [0131-palindrome-partitioning](https://github.com/Anshu10101/LeetCode/tree/master/0131-palindrome-partitioning) |
| [0322-coin-change](https://github.com/Anshu10101/LeetCode/tree/master/0322-coin-change) |
| [0494-target-sum](https://github.com/Anshu10101/LeetCode/tree/master/0494-target-sum) |
| [0518-coin-change-ii](https://github.com/Anshu10101/LeetCode/tree/master/0518-coin-change-ii) |
| [0905-length-of-longest-fibonacci-subsequence](https://github.com/Anshu10101/LeetCode/tree/master/0905-length-of-longest-fibonacci-subsequence) |
| [1170-shortest-common-supersequence](https://github.com/Anshu10101/LeetCode/tree/master/1170-shortest-common-supersequence) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Anshu10101/LeetCode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/Anshu10101/LeetCode/tree/master/1849-maximum-absolute-sum-of-any-subarray) |
## Binary Search
| |
| ------- |
| [0033-search-in-rotated-sorted-array](https://github.com/Anshu10101/LeetCode/tree/master/0033-search-in-rotated-sorted-array) |
| [0069-sqrtx](https://github.com/Anshu10101/LeetCode/tree/master/0069-sqrtx) |
| [0209-minimum-size-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0209-minimum-size-subarray-sum) |
| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |
| [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) |
## Sliding Window
| |
| ------- |
| [0209-minimum-size-subarray-sum](https://github.com/Anshu10101/LeetCode/tree/master/0209-minimum-size-subarray-sum) |
| [0966-binary-subarrays-with-sum](https://github.com/Anshu10101/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [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) |
## Bit Manipulation
| |
| ------- |
| [0231-power-of-two](https://github.com/Anshu10101/LeetCode/tree/master/0231-power-of-two) |
| [0268-missing-number](https://github.com/Anshu10101/LeetCode/tree/master/0268-missing-number) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/Anshu10101/LeetCode/tree/master/0070-climbing-stairs) |
## Binary Search Tree
| |
| ------- |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Anshu10101/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
## Geometry
| |
| ------- |
| [0149-max-points-on-a-line](https://github.com/Anshu10101/LeetCode/tree/master/0149-max-points-on-a-line) |
## Merge Sort
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/Anshu10101/LeetCode/tree/master/0023-merge-k-sorted-lists) |
| [0148-sort-list](https://github.com/Anshu10101/LeetCode/tree/master/0148-sort-list) |