https://github.com/angelagarwal2/leetcode_solutions
C++ Solutions of LeetCode Problems
https://github.com/angelagarwal2/leetcode_solutions
arrays binary-search-tree binary-tree cpp greedy-algorithms leetcode leetcode-cpp leetcode-solutions linked-list-in-cpp queue recursion stack tree two-pointers
Last synced: 3 days ago
JSON representation
C++ Solutions of LeetCode Problems
- Host: GitHub
- URL: https://github.com/angelagarwal2/leetcode_solutions
- Owner: angelagarwal2
- Created: 2025-06-17T11:48:25.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2026-05-05T20:01:58.000Z (about 2 months ago)
- Last Synced: 2026-05-05T20:14:17.514Z (about 2 months ago)
- Topics: arrays, binary-search-tree, binary-tree, cpp, greedy-algorithms, leetcode, leetcode-cpp, leetcode-solutions, linked-list-in-cpp, queue, recursion, stack, tree, two-pointers
- Language: C++
- Homepage: https://leetcode.com/u/angelagarwal28/
- Size: 689 KB
- Stars: 1
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Topics
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0004-median-of-two-sorted-arrays) |
| [0015-3sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0015-3sum) |
| [0018-4sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0018-4sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0027-remove-element) |
| [0031-next-permutation](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0031-next-permutation) |
| [0033-search-in-rotated-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0035-search-insert-position) |
| [0039-combination-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0040-combination-sum-ii) |
| [0041-first-missing-positive](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0041-first-missing-positive) |
| [0042-trapping-rain-water](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0045-jump-game-ii) |
| [0048-rotate-image](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0048-rotate-image) |
| [0051-n-queens](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0051-n-queens) |
| [0053-maximum-subarray](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0053-maximum-subarray) |
| [0054-spiral-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0054-spiral-matrix) |
| [0055-jump-game](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0055-jump-game) |
| [0056-merge-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0056-merge-intervals) |
| [0057-insert-interval](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0057-insert-interval) |
| [0063-unique-paths-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0064-minimum-path-sum) |
| [0066-plus-one](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0066-plus-one) |
| [0073-set-matrix-zeroes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0074-search-a-2d-matrix) |
| [0075-sort-colors](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0075-sort-colors) |
| [0078-subsets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0078-subsets) |
| [0079-word-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0079-word-search) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0084-largest-rectangle-in-histogram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0085-maximal-rectangle) |
| [0088-merge-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0088-merge-sorted-array) |
| [0090-subsets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0090-subsets-ii) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0118-pascals-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0118-pascals-triangle) |
| [0119-pascals-triangle-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0119-pascals-triangle-ii) |
| [0120-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0120-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0128-longest-consecutive-sequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0128-longest-consecutive-sequence) |
| [0135-candy](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0135-candy) |
| [0136-single-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0136-single-number) |
| [0137-single-number-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0137-single-number-ii) |
| [0152-maximum-product-subarray](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0152-maximum-product-subarray) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0169-majority-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0169-majority-element) |
| [0189-rotate-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0189-rotate-array) |
| [0198-house-robber](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0198-house-robber) |
| [0200-number-of-islands](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0200-number-of-islands) |
| [0204-count-primes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0204-count-primes) |
| [0213-house-robber-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0213-house-robber-ii) |
| [0215-kth-largest-element-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0216-combination-sum-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0216-combination-sum-iii) |
| [0217-contains-duplicate](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0217-contains-duplicate) |
| [0219-contains-duplicate-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0219-contains-duplicate-ii) |
| [0229-majority-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0229-majority-element-ii) |
| [0238-product-of-array-except-self](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0238-product-of-array-except-self) |
| [0240-search-a-2d-matrix-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0240-search-a-2d-matrix-ii) |
| [0260-single-number-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0260-single-number-iii) |
| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |
| [0283-move-zeroes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0287-find-the-duplicate-number) |
| [0324-wiggle-sort-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0324-wiggle-sort-ii) |
| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |
| [0349-intersection-of-two-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0350-intersection-of-two-arrays-ii) |
| [0410-split-array-largest-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0410-split-array-largest-sum) |
| [0414-third-maximum-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0414-third-maximum-number) |
| [0416-partition-equal-subset-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0416-partition-equal-subset-sum) |
| [0435-non-overlapping-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0435-non-overlapping-intervals) |
| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0448-find-all-numbers-disappeared-in-an-array) |
| [0455-assign-cookies](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0455-assign-cookies) |
| [0472-concatenated-words](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0472-concatenated-words) |
| [0485-max-consecutive-ones](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0485-max-consecutive-ones) |
| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |
| [0496-next-greater-element-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0503-next-greater-element-ii) |
| [0540-single-element-in-a-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0540-single-element-in-a-sorted-array) |
| [0560-subarray-sum-equals-k](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0560-subarray-sum-equals-k) |
| [0594-longest-harmonious-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0594-longest-harmonious-subsequence) |
| [0628-maximum-product-of-three-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0628-maximum-product-of-three-numbers) |
| [0645-set-mismatch](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0645-set-mismatch) |
| [0733-flood-fill](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0733-flood-fill) |
| [0735-asteroid-collision](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0735-asteroid-collision) |
| [0739-daily-temperatures](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0739-daily-temperatures) |
| [0745-find-smallest-letter-greater-than-target](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0745-find-smallest-letter-greater-than-target) |
| [0748-largest-number-at-least-twice-of-others](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0748-largest-number-at-least-twice-of-others) |
| [0792-binary-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0792-binary-search) |
| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |
| [0890-lemonade-change](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0890-lemonade-change) |
| [0907-koko-eating-bananas](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0907-koko-eating-bananas) |
| [0940-fruit-into-baskets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0940-fruit-into-baskets) |
| [0943-sum-of-subarray-minimums](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0943-sum-of-subarray-minimums) |
| [0944-delete-columns-to-make-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0944-delete-columns-to-make-sorted) |
| [0966-binary-subarrays-with-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0966-binary-subarrays-with-sum) |
| [0973-k-closest-points-to-origin](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0973-k-closest-points-to-origin) |
| [0981-delete-columns-to-make-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0981-delete-columns-to-make-sorted) |
| [1018-largest-perimeter-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1018-largest-perimeter-triangle) |
| [1034-subarrays-with-k-different-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1034-subarrays-with-k-different-integers) |
| [1036-rotting-oranges](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1036-rotting-oranges) |
| [1046-max-consecutive-ones-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1046-max-consecutive-ones-iii) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1056-capacity-to-ship-packages-within-d-days](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1056-capacity-to-ship-packages-within-d-days) |
| [1306-minimum-absolute-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1306-minimum-absolute-difference) |
| [1310-watering-plants](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1310-watering-plants) |
| [1370-count-number-of-nice-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1370-count-number-of-nice-subarrays) |
| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |
| [1421-find-numbers-with-even-number-of-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1421-find-numbers-with-even-number-of-digits) |
| [1426-find-n-unique-integers-sum-up-to-zero](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1426-find-n-unique-integers-sum-up-to-zero) |
| [1463-cherry-pickup-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1463-cherry-pickup-ii) |
| [1510-find-lucky-integer-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1510-find-lucky-integer-in-an-array) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1605-minimum-number-of-days-to-make-m-bouquets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1605-minimum-number-of-days-to-make-m-bouquets) |
| [1612-avoid-flood-in-the-city](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1612-avoid-flood-in-the-city) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [1646-kth-missing-positive-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1646-kth-missing-positive-number) |
| [1675-magnetic-force-between-two-balls](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1675-magnetic-force-between-two-balls) |
| [1781-check-if-two-string-arrays-are-equivalent](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1781-check-if-two-string-arrays-are-equivalent) |
| [1848-sum-of-unique-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1848-sum-of-unique-elements) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |
| [1995-finding-pairs-with-a-certain-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1995-finding-pairs-with-a-certain-sum) |
| [2047-find-a-peak-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2047-find-a-peak-element-ii) |
| [2227-sum-of-subarray-ranges](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2227-sum-of-subarray-ranges) |
| [2248-minimum-cost-of-buying-candies-with-discount](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2248-minimum-cost-of-buying-candies-with-discount) |
| [2271-rearrange-array-elements-by-sign](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2271-rearrange-array-elements-by-sign) |
| [2316-count-hills-and-valleys-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2316-count-hills-and-valleys-in-an-array) |
| [2432-number-of-zero-filled-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2432-number-of-zero-filled-subarrays) |
| [2498-frog-jump-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2498-frog-jump-ii) |
| [2515-shortest-distance-to-target-string-in-a-circular-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2515-shortest-distance-to-target-string-in-a-circular-array) |
| [2737-row-with-maximum-ones](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2737-row-with-maximum-ones) |
| [3227-find-missing-and-repeated-values](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3227-find-missing-and-repeated-values) |
| [3321-type-of-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3321-type-of-triangle) |
| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |
| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |
| [3790-fruits-into-baskets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3790-fruits-into-baskets-ii) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0003-longest-substring-without-repeating-characters) |
| [0012-integer-to-roman](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0013-roman-to-integer) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0041-first-missing-positive](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0041-first-missing-positive) |
| [0073-set-matrix-zeroes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0073-set-matrix-zeroes) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0128-longest-consecutive-sequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0128-longest-consecutive-sequence) |
| [0138-copy-list-with-random-pointer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0142-linked-list-cycle-ii) |
| [0160-intersection-of-two-linked-lists](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0160-intersection-of-two-linked-lists) |
| [0169-majority-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0169-majority-element) |
| [0202-happy-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0202-happy-number) |
| [0205-isomorphic-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0205-isomorphic-strings) |
| [0217-contains-duplicate](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0217-contains-duplicate) |
| [0219-contains-duplicate-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0219-contains-duplicate-ii) |
| [0229-majority-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |
| [0290-word-pattern](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0290-word-pattern) |
| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |
| [0349-intersection-of-two-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0350-intersection-of-two-arrays-ii) |
| [0383-ransom-note](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0387-first-unique-character-in-a-string) |
| [0389-find-the-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0389-find-the-difference) |
| [0409-longest-palindrome](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0409-longest-palindrome) |
| [0424-longest-repeating-character-replacement](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0424-longest-repeating-character-replacement) |
| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0448-find-all-numbers-disappeared-in-an-array) |
| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |
| [0496-next-greater-element-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0496-next-greater-element-i) |
| [0560-subarray-sum-equals-k](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0560-subarray-sum-equals-k) |
| [0594-longest-harmonious-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0594-longest-harmonious-subsequence) |
| [0645-set-mismatch](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0645-set-mismatch) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |
| [0889-buddy-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0889-buddy-strings) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [0940-fruit-into-baskets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0940-fruit-into-baskets) |
| [0966-binary-subarrays-with-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0966-binary-subarrays-with-sum) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1034-subarrays-with-k-different-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1034-subarrays-with-k-different-integers) |
| [1370-count-number-of-nice-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1370-count-number-of-nice-subarrays) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1510-find-lucky-integer-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1510-find-lucky-integer-in-an-array) |
| [1612-avoid-flood-in-the-city](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1612-avoid-flood-in-the-city) |
| [1777-determine-if-two-strings-are-close](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1777-determine-if-two-strings-are-close) |
| [1848-sum-of-unique-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1848-sum-of-unique-elements) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [1960-check-if-the-sentence-is-pangram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1960-check-if-the-sentence-is-pangram) |
| [1995-finding-pairs-with-a-certain-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1995-finding-pairs-with-a-certain-sum) |
| [2053-check-if-all-characters-have-equal-number-of-occurrences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2053-check-if-all-characters-have-equal-number-of-occurrences) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [3227-find-missing-and-repeated-values](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3227-find-missing-and-repeated-values) |
| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |
| [3872-find-most-frequent-vowel-and-consonant](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3872-find-most-frequent-vowel-and-consonant) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0002-add-two-numbers) |
| [0007-reverse-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0007-reverse-integer) |
| [0009-palindrome-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0009-palindrome-number) |
| [0012-integer-to-roman](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0013-roman-to-integer) |
| [0029-divide-two-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0029-divide-two-integers) |
| [0048-rotate-image](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0048-rotate-image) |
| [0050-powx-n](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0050-powx-n) |
| [0060-permutation-sequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0060-permutation-sequence) |
| [0062-unique-paths](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0062-unique-paths) |
| [0066-plus-one](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0066-plus-one) |
| [0069-sqrtx](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0069-sqrtx) |
| [0070-climbing-stairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0070-climbing-stairs) |
| [0189-rotate-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0202-happy-number) |
| [0204-count-primes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0204-count-primes) |
| [0231-power-of-two](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0231-power-of-two) |
| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |
| [0326-power-of-three](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0326-power-of-three) |
| [0342-power-of-four](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0342-power-of-four) |
| [0628-maximum-product-of-three-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0628-maximum-product-of-three-numbers) |
| [0935-orderly-queue](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0935-orderly-queue) |
| [0973-k-closest-points-to-origin](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0973-k-closest-points-to-origin) |
| [1013-fibonacci-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1013-fibonacci-number) |
| [1018-largest-perimeter-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1018-largest-perimeter-triangle) |
| [1146-greatest-common-divisor-of-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1146-greatest-common-divisor-of-strings) |
| [1370-count-number-of-nice-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1370-count-number-of-nice-subarrays) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
| [1421-find-numbers-with-even-number-of-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1421-find-numbers-with-even-number-of-digits) |
| [1426-find-n-unique-integers-sum-up-to-zero](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1426-find-n-unique-integers-sum-up-to-zero) |
| [1440-convert-integer-to-the-sum-of-two-no-zero-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1440-convert-integer-to-the-sum-of-two-no-zero-integers) |
| [1448-maximum-69-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1448-maximum-69-number) |
| [1610-xor-operation-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1610-xor-operation-in-an-array) |
| [1885-count-number-of-homogenous-substrings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1885-count-number-of-homogenous-substrings) |
| [2032-largest-odd-number-in-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2032-largest-odd-number-in-string) |
| [2050-count-good-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2050-count-good-numbers) |
| [2432-number-of-zero-filled-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2432-number-of-zero-filled-subarrays) |
| [2630-alternating-digit-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2630-alternating-digit-sum) |
| [3172-divisible-and-non-divisible-sums-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3172-divisible-and-non-divisible-sums-difference) |
| [3227-find-missing-and-repeated-values](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3227-find-missing-and-repeated-values) |
| [3321-type-of-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3321-type-of-triangle) |
| [3783-mirror-distance-of-an-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3783-mirror-distance-of-an-integer) |
| [3830-find-closest-person](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3830-find-closest-person) |
## Two Pointers
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0005-longest-palindromic-substring) |
| [0015-3sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0015-3sum) |
| [0018-4sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0018-4sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0031-next-permutation](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0031-next-permutation) |
| [0042-trapping-rain-water](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0042-trapping-rain-water) |
| [0061-rotate-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0061-rotate-list) |
| [0075-sort-colors](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0075-sort-colors) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0086-partition-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0086-partition-list) |
| [0088-merge-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0142-linked-list-cycle-ii) |
| [0148-sort-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0148-sort-list) |
| [0151-reverse-words-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0151-reverse-words-in-a-string) |
| [0160-intersection-of-two-linked-lists](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0160-intersection-of-two-linked-lists) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0202-happy-number) |
| [0234-palindrome-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0234-palindrome-linked-list) |
| [0283-move-zeroes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0287-find-the-duplicate-number) |
| [0349-intersection-of-two-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0350-intersection-of-two-arrays-ii) |
| [0392-is-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0392-is-subsequence) |
| [0443-string-compression](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0443-string-compression) |
| [0455-assign-cookies](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0455-assign-cookies) |
| [0557-reverse-words-in-a-string-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0557-reverse-words-in-a-string-iii) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0874-backspace-string-compare](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0874-backspace-string-compare) |
| [0908-middle-of-the-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0908-middle-of-the-linked-list) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
| [2271-rearrange-array-elements-by-sign](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2271-rearrange-array-elements-by-sign) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0015-3sum) |
| [0018-4sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0018-4sum) |
| [0056-merge-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0056-merge-intervals) |
| [0075-sort-colors](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0088-merge-sorted-array) |
| [0148-sort-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0148-sort-list) |
| [0169-majority-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0169-majority-element) |
| [0215-kth-largest-element-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0217-contains-duplicate](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |
| [0324-wiggle-sort-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0324-wiggle-sort-ii) |
| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |
| [0349-intersection-of-two-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0350-intersection-of-two-arrays-ii) |
| [0389-find-the-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0389-find-the-difference) |
| [0414-third-maximum-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0414-third-maximum-number) |
| [0435-non-overlapping-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0435-non-overlapping-intervals) |
| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |
| [0455-assign-cookies](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0455-assign-cookies) |
| [0594-longest-harmonious-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0594-longest-harmonious-subsequence) |
| [0628-maximum-product-of-three-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0628-maximum-product-of-three-numbers) |
| [0645-set-mismatch](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0645-set-mismatch) |
| [0748-largest-number-at-least-twice-of-others](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0748-largest-number-at-least-twice-of-others) |
| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |
| [0935-orderly-queue](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0935-orderly-queue) |
| [0973-k-closest-points-to-origin](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0973-k-closest-points-to-origin) |
| [1018-largest-perimeter-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1018-largest-perimeter-triangle) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1306-minimum-absolute-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1306-minimum-absolute-difference) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [1675-magnetic-force-between-two-balls](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1675-magnetic-force-between-two-balls) |
| [1777-determine-if-two-strings-are-close](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1777-determine-if-two-strings-are-close) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2248-minimum-cost-of-buying-candies-with-discount](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2248-minimum-cost-of-buying-candies-with-discount) |
| [2887-sort-vowels-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2887-sort-vowels-in-a-string) |
| [3321-type-of-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3321-type-of-triangle) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0021-merge-two-sorted-lists](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0021-merge-two-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0024-swap-nodes-in-pairs) |
| [0025-reverse-nodes-in-k-group](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0025-reverse-nodes-in-k-group) |
| [0061-rotate-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0061-rotate-list) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0086-partition-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0086-partition-list) |
| [0138-copy-list-with-random-pointer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0142-linked-list-cycle-ii) |
| [0148-sort-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0160-intersection-of-two-linked-lists) |
| [0203-remove-linked-list-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0203-remove-linked-list-elements) |
| [0206-reverse-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0234-palindrome-linked-list) |
| [0237-delete-node-in-a-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0237-delete-node-in-a-linked-list) |
| [0328-odd-even-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0328-odd-even-linked-list) |
| [0908-middle-of-the-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0908-middle-of-the-linked-list) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0003-longest-substring-without-repeating-characters) |
| [0005-longest-palindromic-substring](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0005-longest-palindromic-substring) |
| [0008-string-to-integer-atoi](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0008-string-to-integer-atoi) |
| [0012-integer-to-roman](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0013-roman-to-integer) |
| [0014-longest-common-prefix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0014-longest-common-prefix) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0020-valid-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0020-valid-parentheses) |
| [0022-generate-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0022-generate-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0038-count-and-say](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0038-count-and-say) |
| [0058-length-of-last-word](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0058-length-of-last-word) |
| [0079-word-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0079-word-search) |
| [0093-restore-ip-addresses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0093-restore-ip-addresses) |
| [0125-valid-palindrome](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0125-valid-palindrome) |
| [0131-palindrome-partitioning](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0131-palindrome-partitioning) |
| [0151-reverse-words-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0151-reverse-words-in-a-string) |
| [0205-isomorphic-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0205-isomorphic-strings) |
| [0242-valid-anagram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0242-valid-anagram) |
| [0290-word-pattern](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0290-word-pattern) |
| [0316-remove-duplicate-letters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0316-remove-duplicate-letters) |
| [0383-ransom-note](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0387-first-unique-character-in-a-string) |
| [0389-find-the-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0389-find-the-difference) |
| [0392-is-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0392-is-subsequence) |
| [0402-remove-k-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0402-remove-k-digits) |
| [0409-longest-palindrome](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0409-longest-palindrome) |
| [0424-longest-repeating-character-replacement](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0424-longest-repeating-character-replacement) |
| [0443-string-compression](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0443-string-compression) |
| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |
| [0459-repeated-substring-pattern](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0459-repeated-substring-pattern) |
| [0472-concatenated-words](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0472-concatenated-words) |
| [0520-detect-capital](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0520-detect-capital) |
| [0557-reverse-words-in-a-string-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0557-reverse-words-in-a-string-iii) |
| [0678-valid-parenthesis-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0678-valid-parenthesis-string) |
| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |
| [0812-rotate-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0812-rotate-string) |
| [0874-backspace-string-compare](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0874-backspace-string-compare) |
| [0889-buddy-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0889-buddy-strings) |
| [0916-decoded-string-at-index](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0916-decoded-string-at-index) |
| [0935-orderly-queue](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0935-orderly-queue) |
| [0944-delete-columns-to-make-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0944-delete-columns-to-make-sorted) |
| [0981-delete-columns-to-make-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0981-delete-columns-to-make-sorted) |
| [1078-remove-outermost-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1078-remove-outermost-parentheses) |
| [1146-greatest-common-divisor-of-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1146-greatest-common-divisor-of-strings) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1159-smallest-subsequence-of-distinct-characters) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1666-make-the-string-great](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1666-make-the-string-great) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
| [1777-determine-if-two-strings-are-close](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1777-determine-if-two-strings-are-close) |
| [1781-check-if-two-string-arrays-are-equivalent](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1781-check-if-two-string-arrays-are-equivalent) |
| [1823-determine-if-string-halves-are-alike](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1823-determine-if-string-halves-are-alike) |
| [1885-count-number-of-homogenous-substrings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1885-count-number-of-homogenous-substrings) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [1960-check-if-the-sentence-is-pangram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1960-check-if-the-sentence-is-pangram) |
| [2032-largest-odd-number-in-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2032-largest-odd-number-in-string) |
| [2053-check-if-all-characters-have-equal-number-of-occurrences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2053-check-if-all-characters-have-equal-number-of-occurrences) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2346-largest-3-same-digit-number-in-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2346-largest-3-same-digit-number-in-string) |
| [2515-shortest-distance-to-target-string-in-a-circular-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2515-shortest-distance-to-target-string-in-a-circular-array) |
| [2887-sort-vowels-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2887-sort-vowels-in-a-string) |
| [3396-valid-word](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3396-valid-word) |
| [3447-clear-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3447-clear-digits) |
| [3617-find-the-original-typed-string-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3617-find-the-original-typed-string-i) |
| [3872-find-most-frequent-vowel-and-consonant](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3872-find-most-frequent-vowel-and-consonant) |
| [3931-process-string-with-special-operations-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3931-process-string-with-special-operations-i) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0020-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0042-trapping-rain-water) |
| [0084-largest-rectangle-in-histogram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0085-maximal-rectangle) |
| [0094-binary-tree-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0144-binary-tree-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [0155-min-stack](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0155-min-stack) |
| [0225-implement-stack-using-queues](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0232-implement-queue-using-stacks) |
| [0234-palindrome-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0234-palindrome-linked-list) |
| [0316-remove-duplicate-letters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0316-remove-duplicate-letters) |
| [0402-remove-k-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0402-remove-k-digits) |
| [0496-next-greater-element-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0503-next-greater-element-ii) |
| [0678-valid-parenthesis-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0678-valid-parenthesis-string) |
| [0735-asteroid-collision](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0735-asteroid-collision) |
| [0739-daily-temperatures](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0739-daily-temperatures) |
| [0874-backspace-string-compare](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0874-backspace-string-compare) |
| [0916-decoded-string-at-index](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0916-decoded-string-at-index) |
| [0943-sum-of-subarray-minimums](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0943-sum-of-subarray-minimums) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1078-remove-outermost-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1078-remove-outermost-parentheses) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1159-smallest-subsequence-of-distinct-characters) |
| [1666-make-the-string-great](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1666-make-the-string-great) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
| [2227-sum-of-subarray-ranges](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2227-sum-of-subarray-ranges) |
| [3447-clear-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3447-clear-digits) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0002-add-two-numbers) |
| [0021-merge-two-sorted-lists](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0021-merge-two-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0024-swap-nodes-in-pairs) |
| [0025-reverse-nodes-in-k-group](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0025-reverse-nodes-in-k-group) |
| [0050-powx-n](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0050-powx-n) |
| [0060-permutation-sequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0060-permutation-sequence) |
| [0203-remove-linked-list-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0203-remove-linked-list-elements) |
| [0206-reverse-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0206-reverse-linked-list) |
| [0231-power-of-two](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0231-power-of-two) |
| [0234-palindrome-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0234-palindrome-linked-list) |
| [0326-power-of-three](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0326-power-of-three) |
| [0342-power-of-four](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0342-power-of-four) |
| [1013-fibonacci-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1013-fibonacci-number) |
| [2050-count-good-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2050-count-good-numbers) |
## Binary Search
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0004-median-of-two-sorted-arrays) |
| [0033-search-in-rotated-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0035-search-insert-position) |
| [0069-sqrtx](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0069-sqrtx) |
| [0074-search-a-2d-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0074-search-a-2d-matrix) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0222-count-complete-tree-nodes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0222-count-complete-tree-nodes) |
| [0240-search-a-2d-matrix-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0240-search-a-2d-matrix-ii) |
| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |
| [0287-find-the-duplicate-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0287-find-the-duplicate-number) |
| [0349-intersection-of-two-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0350-intersection-of-two-arrays-ii) |
| [0410-split-array-largest-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0410-split-array-largest-sum) |
| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |
| [0540-single-element-in-a-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0540-single-element-in-a-sorted-array) |
| [0745-find-smallest-letter-greater-than-target](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0745-find-smallest-letter-greater-than-target) |
| [0792-binary-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0792-binary-search) |
| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |
| [0907-koko-eating-bananas](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0907-koko-eating-bananas) |
| [1046-max-consecutive-ones-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1046-max-consecutive-ones-iii) |
| [1056-capacity-to-ship-packages-within-d-days](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1056-capacity-to-ship-packages-within-d-days) |
| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |
| [1605-minimum-number-of-days-to-make-m-bouquets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1605-minimum-number-of-days-to-make-m-bouquets) |
| [1612-avoid-flood-in-the-city](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1612-avoid-flood-in-the-city) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [1646-kth-missing-positive-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1646-kth-missing-positive-number) |
| [1675-magnetic-force-between-two-balls](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1675-magnetic-force-between-two-balls) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2047-find-a-peak-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2047-find-a-peak-element-ii) |
| [2498-frog-jump-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2498-frog-jump-ii) |
| [3790-fruits-into-baskets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3790-fruits-into-baskets-ii) |
## Matrix
| |
| ------- |
| [0048-rotate-image](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0054-spiral-matrix) |
| [0063-unique-paths-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0064-minimum-path-sum) |
| [0073-set-matrix-zeroes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0074-search-a-2d-matrix) |
| [0079-word-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0079-word-search) |
| [0085-maximal-rectangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0085-maximal-rectangle) |
| [0200-number-of-islands](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0200-number-of-islands) |
| [0240-search-a-2d-matrix-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0240-search-a-2d-matrix-ii) |
| [0733-flood-fill](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0733-flood-fill) |
| [1036-rotting-oranges](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1036-rotting-oranges) |
| [1463-cherry-pickup-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1463-cherry-pickup-ii) |
| [2047-find-a-peak-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2047-find-a-peak-element-ii) |
| [2737-row-with-maximum-ones](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2737-row-with-maximum-ones) |
| [3227-find-missing-and-repeated-values](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3227-find-missing-and-repeated-values) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0004-median-of-two-sorted-arrays) |
| [0053-maximum-subarray](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0053-maximum-subarray) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0148-sort-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0148-sort-list) |
| [0169-majority-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0169-majority-element) |
| [0191-number-of-1-bits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0191-number-of-1-bits) |
| [0215-kth-largest-element-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0240-search-a-2d-matrix-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0240-search-a-2d-matrix-ii) |
| [0324-wiggle-sort-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0324-wiggle-sort-ii) |
| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |
| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |
| [0973-k-closest-points-to-origin](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0973-k-closest-points-to-origin) |
## Dynamic Programming
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0005-longest-palindromic-substring) |
| [0022-generate-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0022-generate-parentheses) |
| [0042-trapping-rain-water](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0045-jump-game-ii) |
| [0053-maximum-subarray](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0053-maximum-subarray) |
| [0055-jump-game](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0055-jump-game) |
| [0062-unique-paths](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0062-unique-paths) |
| [0063-unique-paths-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0064-minimum-path-sum) |
| [0070-climbing-stairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0070-climbing-stairs) |
| [0085-maximal-rectangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0085-maximal-rectangle) |
| [0118-pascals-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0118-pascals-triangle) |
| [0119-pascals-triangle-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0119-pascals-triangle-ii) |
| [0120-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0120-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0131-palindrome-partitioning](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0131-palindrome-partitioning) |
| [0152-maximum-product-subarray](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0152-maximum-product-subarray) |
| [0198-house-robber](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0198-house-robber) |
| [0213-house-robber-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0213-house-robber-ii) |
| [0392-is-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0392-is-subsequence) |
| [0410-split-array-largest-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0410-split-array-largest-sum) |
| [0416-partition-equal-subset-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0416-partition-equal-subset-sum) |
| [0435-non-overlapping-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0435-non-overlapping-intervals) |
| [0472-concatenated-words](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0472-concatenated-words) |
| [0678-valid-parenthesis-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0678-valid-parenthesis-string) |
| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |
| [0943-sum-of-subarray-minimums](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0943-sum-of-subarray-minimums) |
| [1013-fibonacci-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1013-fibonacci-number) |
| [1463-cherry-pickup-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1463-cherry-pickup-ii) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |
## Simulation
| |
| ------- |
| [0054-spiral-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0054-spiral-matrix) |
| [0735-asteroid-collision](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0735-asteroid-collision) |
| [0874-backspace-string-compare](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0874-backspace-string-compare) |
| [1310-watering-plants](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1310-watering-plants) |
| [2271-rearrange-array-elements-by-sign](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2271-rearrange-array-elements-by-sign) |
| [3447-clear-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3447-clear-digits) |
| [3790-fruits-into-baskets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3790-fruits-into-baskets-ii) |
| [3931-process-string-with-special-operations-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3931-process-string-with-special-operations-i) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0128-longest-consecutive-sequence) |
| [0200-number-of-islands](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0200-number-of-islands) |
| [0547-number-of-provinces](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0547-number-of-provinces) |
| [0785-is-graph-bipartite](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0785-is-graph-bipartite) |
## Bit Manipulation
| |
| ------- |
| [0029-divide-two-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0029-divide-two-integers) |
| [0078-subsets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0078-subsets) |
| [0090-subsets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0090-subsets-ii) |
| [0136-single-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0136-single-number) |
| [0137-single-number-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0137-single-number-ii) |
| [0191-number-of-1-bits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0191-number-of-1-bits) |
| [0222-count-complete-tree-nodes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0222-count-complete-tree-nodes) |
| [0231-power-of-two](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0231-power-of-two) |
| [0260-single-number-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0260-single-number-iii) |
| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |
| [0287-find-the-duplicate-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0287-find-the-duplicate-number) |
| [0342-power-of-four](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0342-power-of-four) |
| [0389-find-the-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0389-find-the-difference) |
| [0645-set-mismatch](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0645-set-mismatch) |
| [1610-xor-operation-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1610-xor-operation-in-an-array) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2323-minimum-bit-flips-to-convert-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2323-minimum-bit-flips-to-convert-number) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0169-majority-element) |
| [0229-majority-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0229-majority-element-ii) |
| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |
| [0383-ransom-note](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0387-first-unique-character-in-a-string) |
| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |
| [0594-longest-harmonious-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0594-longest-harmonious-subsequence) |
| [1034-subarrays-with-k-different-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1034-subarrays-with-k-different-integers) |
| [1510-find-lucky-integer-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1510-find-lucky-integer-in-an-array) |
| [1777-determine-if-two-strings-are-close](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1777-determine-if-two-strings-are-close) |
| [1823-determine-if-string-halves-are-alike](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1823-determine-if-string-halves-are-alike) |
| [1848-sum-of-unique-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1848-sum-of-unique-elements) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [2053-check-if-all-characters-have-equal-number-of-occurrences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2053-check-if-all-characters-have-equal-number-of-occurrences) |
| [3872-find-most-frequent-vowel-and-consonant](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3872-find-most-frequent-vowel-and-consonant) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0155-min-stack) |
| [0225-implement-stack-using-queues](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0232-implement-queue-using-stacks) |
| [1995-finding-pairs-with-a-certain-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1995-finding-pairs-with-a-certain-sum) |
## Queue
| |
| ------- |
| [0225-implement-stack-using-queues](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0232-implement-queue-using-stacks) |
| [0387-first-unique-character-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0387-first-unique-character-in-a-string) |
## Greedy
| |
| ------- |
| [0045-jump-game-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0055-jump-game) |
| [0135-candy](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0135-candy) |
| [0316-remove-duplicate-letters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0316-remove-duplicate-letters) |
| [0324-wiggle-sort-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0324-wiggle-sort-ii) |
| [0402-remove-k-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0402-remove-k-digits) |
| [0409-longest-palindrome](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0409-longest-palindrome) |
| [0410-split-array-largest-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0410-split-array-largest-sum) |
| [0435-non-overlapping-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0435-non-overlapping-intervals) |
| [0455-assign-cookies](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0455-assign-cookies) |
| [0678-valid-parenthesis-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0678-valid-parenthesis-string) |
| [0890-lemonade-change](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0890-lemonade-change) |
| [1018-largest-perimeter-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1018-largest-perimeter-triangle) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1159-smallest-subsequence-of-distinct-characters) |
| [1448-maximum-69-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1448-maximum-69-number) |
| [1612-avoid-flood-in-the-city](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1612-avoid-flood-in-the-city) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2032-largest-odd-number-in-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2032-largest-odd-number-in-string) |
| [2248-minimum-cost-of-buying-candies-with-discount](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2248-minimum-cost-of-buying-candies-with-discount) |
| [2498-frog-jump-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2498-frog-jump-ii) |
| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0070-climbing-stairs) |
| [1013-fibonacci-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1013-fibonacci-number) |
## Prefix Sum
| |
| ------- |
| [0238-product-of-array-except-self](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0238-product-of-array-except-self) |
| [0410-split-array-largest-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0410-split-array-largest-sum) |
| [0560-subarray-sum-equals-k](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0560-subarray-sum-equals-k) |
| [0966-binary-subarrays-with-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0966-binary-subarrays-with-sum) |
| [1046-max-consecutive-ones-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1046-max-consecutive-ones-iii) |
| [1370-count-number-of-nice-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1370-count-number-of-nice-subarrays) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0003-longest-substring-without-repeating-characters) |
| [0219-contains-duplicate-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0219-contains-duplicate-ii) |
| [0424-longest-repeating-character-replacement](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0424-longest-repeating-character-replacement) |
| [0594-longest-harmonious-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0594-longest-harmonious-subsequence) |
| [0940-fruit-into-baskets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0940-fruit-into-baskets) |
| [0966-binary-subarrays-with-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0966-binary-subarrays-with-sum) |
| [1034-subarrays-with-k-different-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1034-subarrays-with-k-different-integers) |
| [1046-max-consecutive-ones-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1046-max-consecutive-ones-iii) |
| [1370-count-number-of-nice-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1370-count-number-of-nice-subarrays) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |
## Binary Indexed Tree
| |
| ------- |
| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |
## Segment Tree
| |
| ------- |
| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |
| [3790-fruits-into-baskets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3790-fruits-into-baskets-ii) |
## Merge Sort
| |
| ------- |
| [0148-sort-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0148-sort-list) |
| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |
## Ordered Set
| |
| ------- |
| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |
| [3790-fruits-into-baskets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3790-fruits-into-baskets-ii) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0014-longest-common-prefix) |
| [0472-concatenated-words](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0472-concatenated-words) |
| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0459-repeated-substring-pattern](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0459-repeated-substring-pattern) |
| [0812-rotate-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0812-rotate-string) |
## Heap (Priority Queue)
| |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |
| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |
| [0973-k-closest-points-to-origin](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0973-k-closest-points-to-origin) |
| [1612-avoid-flood-in-the-city](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1612-avoid-flood-in-the-city) |
## Bucket Sort
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |
| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |
## Backtracking
| |
| ------- |
| [0017-letter-combinations-of-a-phone-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0022-generate-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0022-generate-parentheses) |
| [0039-combination-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0040-combination-sum-ii) |
| [0051-n-queens](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0051-n-queens) |
| [0078-subsets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0078-subsets) |
| [0079-word-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0079-word-search) |
| [0090-subsets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0090-subsets-ii) |
| [0093-restore-ip-addresses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0093-restore-ip-addresses) |
| [0131-palindrome-partitioning](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0131-palindrome-partitioning) |
| [0216-combination-sum-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0216-combination-sum-iii) |
## Depth-First Search
| |
| ------- |
| [0079-word-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0079-word-search) |
| [0094-binary-tree-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0098-validate-binary-search-tree) |
| [0100-same-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0110-balanced-binary-tree) |
| [0112-path-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0112-path-sum) |
| [0144-binary-tree-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [0199-binary-tree-right-side-view](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0199-binary-tree-right-side-view) |
| [0200-number-of-islands](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0200-number-of-islands) |
| [0207-course-schedule](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0210-course-schedule-ii) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0472-concatenated-words](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0472-concatenated-words) |
| [0543-diameter-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0543-diameter-of-binary-tree) |
| [0547-number-of-provinces](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0547-number-of-provinces) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0662-maximum-width-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0662-maximum-width-of-binary-tree) |
| [0733-flood-fill](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0733-flood-fill) |
| [0785-is-graph-bipartite](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0785-is-graph-bipartite) |
| [0802-find-eventual-safe-states](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0802-find-eventual-safe-states) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0042-trapping-rain-water) |
| [0084-largest-rectangle-in-histogram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0085-maximal-rectangle) |
| [0316-remove-duplicate-letters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0316-remove-duplicate-letters) |
| [0402-remove-k-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0402-remove-k-digits) |
| [0496-next-greater-element-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0503-next-greater-element-ii) |
| [0739-daily-temperatures](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0739-daily-temperatures) |
| [0943-sum-of-subarray-minimums](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0943-sum-of-subarray-minimums) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1159-smallest-subsequence-of-distinct-characters) |
| [2227-sum-of-subarray-ranges](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2227-sum-of-subarray-ranges) |
## Enumeration
| |
| ------- |
| [0204-count-primes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0204-count-primes) |
## Number Theory
| |
| ------- |
| [0204-count-primes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0204-count-primes) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0098-validate-binary-search-tree) |
| [0100-same-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0110-balanced-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0110-balanced-binary-tree) |
| [0112-path-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0112-path-sum) |
| [0144-binary-tree-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [0199-binary-tree-right-side-view](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0199-binary-tree-right-side-view) |
| [0222-count-complete-tree-nodes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0222-count-complete-tree-nodes) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0450-delete-node-in-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0450-delete-node-in-a-bst) |
| [0543-diameter-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0543-diameter-of-binary-tree) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0662-maximum-width-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0662-maximum-width-of-binary-tree) |
| [0783-search-in-a-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0784-insert-into-a-binary-search-tree) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [0998-check-completeness-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0998-check-completeness-of-a-binary-tree) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [2384-root-equals-sum-of-children](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2384-root-equals-sum-of-children) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0098-validate-binary-search-tree) |
| [0100-same-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal)