{"id":50957891,"url":"https://github.com/angelagarwal2/leetcode_solutions","last_synced_at":"2026-06-18T09:32:57.373Z","repository":{"id":299614146,"uuid":"1003601769","full_name":"angelagarwal2/leetcode_solutions","owner":"angelagarwal2","description":"C++ Solutions of LeetCode Problems ","archived":false,"fork":false,"pushed_at":"2026-05-05T20:01:58.000Z","size":706,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2026-05-05T20:14:17.514Z","etag":null,"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"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/angelagarwal28/","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/angelagarwal2.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-06-17T11:48:25.000Z","updated_at":"2026-05-05T20:02:01.000Z","dependencies_parsed_at":"2025-07-17T21:42:50.904Z","dependency_job_id":"481556b3-6532-45e2-987e-0c31107f11bf","html_url":"https://github.com/angelagarwal2/leetcode_solutions","commit_stats":null,"previous_names":["angelagarwal2/leetcode_solutions"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/angelagarwal2/leetcode_solutions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/angelagarwal2%2Fleetcode_solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/angelagarwal2%2Fleetcode_solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/angelagarwal2%2Fleetcode_solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/angelagarwal2%2Fleetcode_solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/angelagarwal2","download_url":"https://codeload.github.com/angelagarwal2/leetcode_solutions/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/angelagarwal2%2Fleetcode_solutions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34485163,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-18T02:00:06.871Z","response_time":128,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["arrays","binary-search-tree","binary-tree","cpp","greedy-algorithms","leetcode","leetcode-cpp","leetcode-solutions","linked-list-in-cpp","queue","recursion","stack","tree","two-pointers"],"created_at":"2026-06-18T09:32:56.449Z","updated_at":"2026-06-18T09:32:57.355Z","avatar_url":"https://github.com/angelagarwal2.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0001-two-sum) |\n| [0004-median-of-two-sorted-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0004-median-of-two-sorted-arrays) |\n| [0015-3sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0018-4sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0027-remove-element) |\n| [0031-next-permutation](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0031-next-permutation) |\n| [0033-search-in-rotated-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0033-search-in-rotated-sorted-array) |\n| [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) |\n| [0035-search-insert-position](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0035-search-insert-position) |\n| [0039-combination-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0040-combination-sum-ii) |\n| [0041-first-missing-positive](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0041-first-missing-positive) |\n| [0042-trapping-rain-water](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0042-trapping-rain-water) |\n| [0045-jump-game-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0045-jump-game-ii) |\n| [0048-rotate-image](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0048-rotate-image) |\n| [0051-n-queens](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0051-n-queens) |\n| [0053-maximum-subarray](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0053-maximum-subarray) |\n| [0054-spiral-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0054-spiral-matrix) |\n| [0055-jump-game](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0055-jump-game) |\n| [0056-merge-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0056-merge-intervals) |\n| [0057-insert-interval](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0057-insert-interval) |\n| [0063-unique-paths-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0063-unique-paths-ii) |\n| [0064-minimum-path-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0064-minimum-path-sum) |\n| [0066-plus-one](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0066-plus-one) |\n| [0073-set-matrix-zeroes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0074-search-a-2d-matrix) |\n| [0075-sort-colors](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0075-sort-colors) |\n| [0078-subsets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0078-subsets) |\n| [0079-word-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0079-word-search) |\n| [0081-search-in-rotated-sorted-array-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0081-search-in-rotated-sorted-array-ii) |\n| [0084-largest-rectangle-in-histogram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0084-largest-rectangle-in-histogram) |\n| [0085-maximal-rectangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0085-maximal-rectangle) |\n| [0088-merge-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0088-merge-sorted-array) |\n| [0090-subsets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0090-subsets-ii) |\n| [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) |\n| [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) |\n| [0118-pascals-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0118-pascals-triangle) |\n| [0119-pascals-triangle-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0119-pascals-triangle-ii) |\n| [0120-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0120-triangle) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0128-longest-consecutive-sequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0128-longest-consecutive-sequence) |\n| [0135-candy](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0135-candy) |\n| [0136-single-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0136-single-number) |\n| [0137-single-number-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0137-single-number-ii) |\n| [0152-maximum-product-subarray](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0152-maximum-product-subarray) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0162-find-peak-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0162-find-peak-element) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0169-majority-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0169-majority-element) |\n| [0189-rotate-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0189-rotate-array) |\n| [0198-house-robber](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0198-house-robber) |\n| [0200-number-of-islands](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0200-number-of-islands) |\n| [0204-count-primes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0204-count-primes) |\n| [0213-house-robber-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0213-house-robber-ii) |\n| [0215-kth-largest-element-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0216-combination-sum-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0216-combination-sum-iii) |\n| [0217-contains-duplicate](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0217-contains-duplicate) |\n| [0219-contains-duplicate-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0219-contains-duplicate-ii) |\n| [0229-majority-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0229-majority-element-ii) |\n| [0238-product-of-array-except-self](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0238-product-of-array-except-self) |\n| [0240-search-a-2d-matrix-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0240-search-a-2d-matrix-ii) |\n| [0260-single-number-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0260-single-number-iii) |\n| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |\n| [0283-move-zeroes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0283-move-zeroes) |\n| [0287-find-the-duplicate-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0287-find-the-duplicate-number) |\n| [0324-wiggle-sort-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0324-wiggle-sort-ii) |\n| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |\n| [0349-intersection-of-two-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0349-intersection-of-two-arrays) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0410-split-array-largest-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0410-split-array-largest-sum) |\n| [0414-third-maximum-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0414-third-maximum-number) |\n| [0416-partition-equal-subset-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0416-partition-equal-subset-sum) |\n| [0435-non-overlapping-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0435-non-overlapping-intervals) |\n| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0448-find-all-numbers-disappeared-in-an-array) |\n| [0455-assign-cookies](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0455-assign-cookies) |\n| [0472-concatenated-words](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0472-concatenated-words) |\n| [0485-max-consecutive-ones](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0485-max-consecutive-ones) |\n| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |\n| [0496-next-greater-element-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0496-next-greater-element-i) |\n| [0503-next-greater-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0503-next-greater-element-ii) |\n| [0540-single-element-in-a-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0540-single-element-in-a-sorted-array) |\n| [0560-subarray-sum-equals-k](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0560-subarray-sum-equals-k) |\n| [0594-longest-harmonious-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0594-longest-harmonious-subsequence) |\n| [0628-maximum-product-of-three-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0628-maximum-product-of-three-numbers) |\n| [0645-set-mismatch](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0645-set-mismatch) |\n| [0733-flood-fill](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0733-flood-fill) |\n| [0735-asteroid-collision](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0735-asteroid-collision) |\n| [0739-daily-temperatures](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0739-daily-temperatures) |\n| [0745-find-smallest-letter-greater-than-target](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0745-find-smallest-letter-greater-than-target) |\n| [0748-largest-number-at-least-twice-of-others](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0748-largest-number-at-least-twice-of-others) |\n| [0792-binary-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0792-binary-search) |\n| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |\n| [0890-lemonade-change](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0890-lemonade-change) |\n| [0907-koko-eating-bananas](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0907-koko-eating-bananas) |\n| [0940-fruit-into-baskets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0940-fruit-into-baskets) |\n| [0943-sum-of-subarray-minimums](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0943-sum-of-subarray-minimums) |\n| [0944-delete-columns-to-make-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0944-delete-columns-to-make-sorted) |\n| [0966-binary-subarrays-with-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0966-binary-subarrays-with-sum) |\n| [0973-k-closest-points-to-origin](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0973-k-closest-points-to-origin) |\n| [0981-delete-columns-to-make-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0981-delete-columns-to-make-sorted) |\n| [1018-largest-perimeter-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1018-largest-perimeter-triangle) |\n| [1034-subarrays-with-k-different-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1034-subarrays-with-k-different-integers) |\n| [1036-rotting-oranges](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1036-rotting-oranges) |\n| [1046-max-consecutive-ones-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1046-max-consecutive-ones-iii) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [1056-capacity-to-ship-packages-within-d-days](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1056-capacity-to-ship-packages-within-d-days) |\n| [1306-minimum-absolute-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1306-minimum-absolute-difference) |\n| [1310-watering-plants](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1310-watering-plants) |\n| [1370-count-number-of-nice-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1370-count-number-of-nice-subarrays) |\n| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |\n| [1421-find-numbers-with-even-number-of-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1421-find-numbers-with-even-number-of-digits) |\n| [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) |\n| [1463-cherry-pickup-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1463-cherry-pickup-ii) |\n| [1510-find-lucky-integer-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1510-find-lucky-integer-in-an-array) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n| [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) |\n| [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) |\n| [1612-avoid-flood-in-the-city](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1612-avoid-flood-in-the-city) |\n| [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) |\n| [1646-kth-missing-positive-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1646-kth-missing-positive-number) |\n| [1675-magnetic-force-between-two-balls](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1675-magnetic-force-between-two-balls) |\n| [1781-check-if-two-string-arrays-are-equivalent](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1781-check-if-two-string-arrays-are-equivalent) |\n| [1848-sum-of-unique-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1848-sum-of-unique-elements) |\n| [1878-check-if-array-is-sorted-and-rotated](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1878-check-if-array-is-sorted-and-rotated) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [1995-finding-pairs-with-a-certain-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1995-finding-pairs-with-a-certain-sum) |\n| [2047-find-a-peak-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2047-find-a-peak-element-ii) |\n| [2227-sum-of-subarray-ranges](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2227-sum-of-subarray-ranges) |\n| [2248-minimum-cost-of-buying-candies-with-discount](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2248-minimum-cost-of-buying-candies-with-discount) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2271-rearrange-array-elements-by-sign) |\n| [2316-count-hills-and-valleys-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2316-count-hills-and-valleys-in-an-array) |\n| [2432-number-of-zero-filled-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2432-number-of-zero-filled-subarrays) |\n| [2498-frog-jump-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2498-frog-jump-ii) |\n| [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) |\n| [2737-row-with-maximum-ones](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2737-row-with-maximum-ones) |\n| [3227-find-missing-and-repeated-values](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3227-find-missing-and-repeated-values) |\n| [3321-type-of-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3321-type-of-triangle) |\n| [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) |\n| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |\n| [3790-fruits-into-baskets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3790-fruits-into-baskets-ii) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0001-two-sum) |\n| [0003-longest-substring-without-repeating-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0012-integer-to-roman](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0013-roman-to-integer) |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0041-first-missing-positive](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0041-first-missing-positive) |\n| [0073-set-matrix-zeroes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0073-set-matrix-zeroes) |\n| [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) |\n| [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) |\n| [0128-longest-consecutive-sequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0128-longest-consecutive-sequence) |\n| [0138-copy-list-with-random-pointer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0142-linked-list-cycle-ii) |\n| [0160-intersection-of-two-linked-lists](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0160-intersection-of-two-linked-lists) |\n| [0169-majority-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0169-majority-element) |\n| [0202-happy-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0202-happy-number) |\n| [0205-isomorphic-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0205-isomorphic-strings) |\n| [0217-contains-duplicate](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0217-contains-duplicate) |\n| [0219-contains-duplicate-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0219-contains-duplicate-ii) |\n| [0229-majority-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0229-majority-element-ii) |\n| [0242-valid-anagram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0242-valid-anagram) |\n| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |\n| [0290-word-pattern](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0290-word-pattern) |\n| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |\n| [0349-intersection-of-two-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0349-intersection-of-two-arrays) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0383-ransom-note](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0383-ransom-note) |\n| [0387-first-unique-character-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0387-first-unique-character-in-a-string) |\n| [0389-find-the-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0389-find-the-difference) |\n| [0409-longest-palindrome](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0409-longest-palindrome) |\n| [0424-longest-repeating-character-replacement](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0424-longest-repeating-character-replacement) |\n| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0448-find-all-numbers-disappeared-in-an-array) |\n| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |\n| [0496-next-greater-element-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0496-next-greater-element-i) |\n| [0560-subarray-sum-equals-k](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0560-subarray-sum-equals-k) |\n| [0594-longest-harmonious-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0594-longest-harmonious-subsequence) |\n| [0645-set-mismatch](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0645-set-mismatch) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |\n| [0889-buddy-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0889-buddy-strings) |\n| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0893-all-nodes-distance-k-in-binary-tree) |\n| [0940-fruit-into-baskets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0940-fruit-into-baskets) |\n| [0966-binary-subarrays-with-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0966-binary-subarrays-with-sum) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1034-subarrays-with-k-different-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1034-subarrays-with-k-different-integers) |\n| [1370-count-number-of-nice-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1370-count-number-of-nice-subarrays) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n| [1510-find-lucky-integer-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1510-find-lucky-integer-in-an-array) |\n| [1612-avoid-flood-in-the-city](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1612-avoid-flood-in-the-city) |\n| [1777-determine-if-two-strings-are-close](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1777-determine-if-two-strings-are-close) |\n| [1848-sum-of-unique-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1848-sum-of-unique-elements) |\n| [1890-sum-of-beauty-of-all-substrings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |\n| [1960-check-if-the-sentence-is-pangram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1960-check-if-the-sentence-is-pangram) |\n| [1995-finding-pairs-with-a-certain-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1995-finding-pairs-with-a-certain-sum) |\n| [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) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |\n| [3227-find-missing-and-repeated-values](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3227-find-missing-and-repeated-values) |\n| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |\n| [3872-find-most-frequent-vowel-and-consonant](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3872-find-most-frequent-vowel-and-consonant) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0002-add-two-numbers) |\n| [0007-reverse-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0007-reverse-integer) |\n| [0009-palindrome-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0009-palindrome-number) |\n| [0012-integer-to-roman](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0013-roman-to-integer) |\n| [0029-divide-two-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0029-divide-two-integers) |\n| [0048-rotate-image](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0048-rotate-image) |\n| [0050-powx-n](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0050-powx-n) |\n| [0060-permutation-sequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0060-permutation-sequence) |\n| [0062-unique-paths](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0062-unique-paths) |\n| [0066-plus-one](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0066-plus-one) |\n| [0069-sqrtx](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0069-sqrtx) |\n| [0070-climbing-stairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0070-climbing-stairs) |\n| [0189-rotate-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0189-rotate-array) |\n| [0202-happy-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0202-happy-number) |\n| [0204-count-primes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0204-count-primes) |\n| [0231-power-of-two](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0231-power-of-two) |\n| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |\n| [0326-power-of-three](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0326-power-of-three) |\n| [0342-power-of-four](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0342-power-of-four) |\n| [0628-maximum-product-of-three-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0628-maximum-product-of-three-numbers) |\n| [0935-orderly-queue](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0935-orderly-queue) |\n| [0973-k-closest-points-to-origin](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0973-k-closest-points-to-origin) |\n| [1013-fibonacci-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1013-fibonacci-number) |\n| [1018-largest-perimeter-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1018-largest-perimeter-triangle) |\n| [1146-greatest-common-divisor-of-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1146-greatest-common-divisor-of-strings) |\n| [1370-count-number-of-nice-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1370-count-number-of-nice-subarrays) |\n| [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) |\n| [1421-find-numbers-with-even-number-of-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1421-find-numbers-with-even-number-of-digits) |\n| [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) |\n| [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) |\n| [1448-maximum-69-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1448-maximum-69-number) |\n| [1610-xor-operation-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1610-xor-operation-in-an-array) |\n| [1885-count-number-of-homogenous-substrings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1885-count-number-of-homogenous-substrings) |\n| [2032-largest-odd-number-in-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2032-largest-odd-number-in-string) |\n| [2050-count-good-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2050-count-good-numbers) |\n| [2432-number-of-zero-filled-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2432-number-of-zero-filled-subarrays) |\n| [2630-alternating-digit-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2630-alternating-digit-sum) |\n| [3172-divisible-and-non-divisible-sums-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3172-divisible-and-non-divisible-sums-difference) |\n| [3227-find-missing-and-repeated-values](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3227-find-missing-and-repeated-values) |\n| [3321-type-of-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3321-type-of-triangle) |\n| [3783-mirror-distance-of-an-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3783-mirror-distance-of-an-integer) |\n| [3830-find-closest-person](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3830-find-closest-person) |\n## Two Pointers\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0005-longest-palindromic-substring) |\n| [0015-3sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0018-4sum) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0027-remove-element) |\n| [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) |\n| [0031-next-permutation](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0031-next-permutation) |\n| [0042-trapping-rain-water](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0042-trapping-rain-water) |\n| [0061-rotate-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0061-rotate-list) |\n| [0075-sort-colors](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0075-sort-colors) |\n| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0082-remove-duplicates-from-sorted-list-ii) |\n| [0086-partition-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0086-partition-list) |\n| [0088-merge-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0088-merge-sorted-array) |\n| [0125-valid-palindrome](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0125-valid-palindrome) |\n| [0141-linked-list-cycle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0142-linked-list-cycle-ii) |\n| [0148-sort-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0148-sort-list) |\n| [0151-reverse-words-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0151-reverse-words-in-a-string) |\n| [0160-intersection-of-two-linked-lists](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0160-intersection-of-two-linked-lists) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0189-rotate-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0189-rotate-array) |\n| [0202-happy-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0202-happy-number) |\n| [0234-palindrome-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0234-palindrome-linked-list) |\n| [0283-move-zeroes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0283-move-zeroes) |\n| [0287-find-the-duplicate-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0287-find-the-duplicate-number) |\n| [0349-intersection-of-two-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0349-intersection-of-two-arrays) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0392-is-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0392-is-subsequence) |\n| [0443-string-compression](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0443-string-compression) |\n| [0455-assign-cookies](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0455-assign-cookies) |\n| [0557-reverse-words-in-a-string-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0557-reverse-words-in-a-string-iii) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0874-backspace-string-compare](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0874-backspace-string-compare) |\n| [0908-middle-of-the-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0908-middle-of-the-linked-list) |\n| [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) |\n| [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) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2271-rearrange-array-elements-by-sign) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0018-4sum) |\n| [0056-merge-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0056-merge-intervals) |\n| [0075-sort-colors](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0088-merge-sorted-array) |\n| [0148-sort-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0148-sort-list) |\n| [0169-majority-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0169-majority-element) |\n| [0215-kth-largest-element-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0217-contains-duplicate](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0217-contains-duplicate) |\n| [0229-majority-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0229-majority-element-ii) |\n| [0242-valid-anagram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0242-valid-anagram) |\n| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |\n| [0324-wiggle-sort-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0324-wiggle-sort-ii) |\n| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |\n| [0349-intersection-of-two-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0349-intersection-of-two-arrays) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0389-find-the-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0389-find-the-difference) |\n| [0414-third-maximum-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0414-third-maximum-number) |\n| [0435-non-overlapping-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0435-non-overlapping-intervals) |\n| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |\n| [0455-assign-cookies](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0455-assign-cookies) |\n| [0594-longest-harmonious-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0594-longest-harmonious-subsequence) |\n| [0628-maximum-product-of-three-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0628-maximum-product-of-three-numbers) |\n| [0645-set-mismatch](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0645-set-mismatch) |\n| [0748-largest-number-at-least-twice-of-others](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0748-largest-number-at-least-twice-of-others) |\n| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |\n| [0935-orderly-queue](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0935-orderly-queue) |\n| [0973-k-closest-points-to-origin](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0973-k-closest-points-to-origin) |\n| [1018-largest-perimeter-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1018-largest-perimeter-triangle) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1306-minimum-absolute-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1306-minimum-absolute-difference) |\n| [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) |\n| [1675-magnetic-force-between-two-balls](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1675-magnetic-force-between-two-balls) |\n| [1777-determine-if-two-strings-are-close](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1777-determine-if-two-strings-are-close) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [2248-minimum-cost-of-buying-candies-with-discount](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2248-minimum-cost-of-buying-candies-with-discount) |\n| [2887-sort-vowels-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2887-sort-vowels-in-a-string) |\n| [3321-type-of-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3321-type-of-triangle) |\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0002-add-two-numbers) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0021-merge-two-sorted-lists](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0021-merge-two-sorted-lists) |\n| [0024-swap-nodes-in-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0024-swap-nodes-in-pairs) |\n| [0025-reverse-nodes-in-k-group](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0025-reverse-nodes-in-k-group) |\n| [0061-rotate-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0061-rotate-list) |\n| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0082-remove-duplicates-from-sorted-list-ii) |\n| [0083-remove-duplicates-from-sorted-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0083-remove-duplicates-from-sorted-list) |\n| [0086-partition-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0086-partition-list) |\n| [0138-copy-list-with-random-pointer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0142-linked-list-cycle-ii) |\n| [0148-sort-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0148-sort-list) |\n| [0160-intersection-of-two-linked-lists](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0160-intersection-of-two-linked-lists) |\n| [0203-remove-linked-list-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0203-remove-linked-list-elements) |\n| [0206-reverse-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0234-palindrome-linked-list) |\n| [0237-delete-node-in-a-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0237-delete-node-in-a-linked-list) |\n| [0328-odd-even-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0328-odd-even-linked-list) |\n| [0908-middle-of-the-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0908-middle-of-the-linked-list) |\n| [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) |\n| [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) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0005-longest-palindromic-substring](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0005-longest-palindromic-substring) |\n| [0008-string-to-integer-atoi](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0008-string-to-integer-atoi) |\n| [0012-integer-to-roman](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0013-roman-to-integer) |\n| [0014-longest-common-prefix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0014-longest-common-prefix) |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0020-valid-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0020-valid-parentheses) |\n| [0022-generate-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0022-generate-parentheses) |\n| [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) |\n| [0038-count-and-say](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0038-count-and-say) |\n| [0058-length-of-last-word](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0058-length-of-last-word) |\n| [0079-word-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0079-word-search) |\n| [0093-restore-ip-addresses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0093-restore-ip-addresses) |\n| [0125-valid-palindrome](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0125-valid-palindrome) |\n| [0131-palindrome-partitioning](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0131-palindrome-partitioning) |\n| [0151-reverse-words-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0151-reverse-words-in-a-string) |\n| [0205-isomorphic-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0205-isomorphic-strings) |\n| [0242-valid-anagram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0242-valid-anagram) |\n| [0290-word-pattern](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0290-word-pattern) |\n| [0316-remove-duplicate-letters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0316-remove-duplicate-letters) |\n| [0383-ransom-note](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0383-ransom-note) |\n| [0387-first-unique-character-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0387-first-unique-character-in-a-string) |\n| [0389-find-the-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0389-find-the-difference) |\n| [0392-is-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0392-is-subsequence) |\n| [0402-remove-k-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0402-remove-k-digits) |\n| [0409-longest-palindrome](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0409-longest-palindrome) |\n| [0424-longest-repeating-character-replacement](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0424-longest-repeating-character-replacement) |\n| [0443-string-compression](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0443-string-compression) |\n| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |\n| [0459-repeated-substring-pattern](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0459-repeated-substring-pattern) |\n| [0472-concatenated-words](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0472-concatenated-words) |\n| [0520-detect-capital](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0520-detect-capital) |\n| [0557-reverse-words-in-a-string-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0557-reverse-words-in-a-string-iii) |\n| [0678-valid-parenthesis-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0678-valid-parenthesis-string) |\n| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |\n| [0812-rotate-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0812-rotate-string) |\n| [0874-backspace-string-compare](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0874-backspace-string-compare) |\n| [0889-buddy-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0889-buddy-strings) |\n| [0916-decoded-string-at-index](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0916-decoded-string-at-index) |\n| [0935-orderly-queue](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0935-orderly-queue) |\n| [0944-delete-columns-to-make-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0944-delete-columns-to-make-sorted) |\n| [0981-delete-columns-to-make-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0981-delete-columns-to-make-sorted) |\n| [1078-remove-outermost-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1078-remove-outermost-parentheses) |\n| [1146-greatest-common-divisor-of-strings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1146-greatest-common-divisor-of-strings) |\n| [1159-smallest-subsequence-of-distinct-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1159-smallest-subsequence-of-distinct-characters) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n| [1666-make-the-string-great](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1666-make-the-string-great) |\n| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |\n| [1777-determine-if-two-strings-are-close](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1777-determine-if-two-strings-are-close) |\n| [1781-check-if-two-string-arrays-are-equivalent](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1781-check-if-two-string-arrays-are-equivalent) |\n| [1823-determine-if-string-halves-are-alike](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1823-determine-if-string-halves-are-alike) |\n| [1885-count-number-of-homogenous-substrings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1885-count-number-of-homogenous-substrings) |\n| [1890-sum-of-beauty-of-all-substrings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |\n| [1960-check-if-the-sentence-is-pangram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1960-check-if-the-sentence-is-pangram) |\n| [2032-largest-odd-number-in-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2032-largest-odd-number-in-string) |\n| [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) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |\n| [2346-largest-3-same-digit-number-in-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2346-largest-3-same-digit-number-in-string) |\n| [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) |\n| [2887-sort-vowels-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2887-sort-vowels-in-a-string) |\n| [3396-valid-word](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3396-valid-word) |\n| [3447-clear-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3447-clear-digits) |\n| [3617-find-the-original-typed-string-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3617-find-the-original-typed-string-i) |\n| [3872-find-most-frequent-vowel-and-consonant](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3872-find-most-frequent-vowel-and-consonant) |\n| [3931-process-string-with-special-operations-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3931-process-string-with-special-operations-i) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0020-valid-parentheses) |\n| [0042-trapping-rain-water](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0042-trapping-rain-water) |\n| [0084-largest-rectangle-in-histogram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0084-largest-rectangle-in-histogram) |\n| [0085-maximal-rectangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0085-maximal-rectangle) |\n| [0094-binary-tree-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0144-binary-tree-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0145-binary-tree-postorder-traversal) |\n| [0155-min-stack](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0155-min-stack) |\n| [0225-implement-stack-using-queues](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0232-implement-queue-using-stacks) |\n| [0234-palindrome-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0234-palindrome-linked-list) |\n| [0316-remove-duplicate-letters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0316-remove-duplicate-letters) |\n| [0402-remove-k-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0402-remove-k-digits) |\n| [0496-next-greater-element-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0496-next-greater-element-i) |\n| [0503-next-greater-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0503-next-greater-element-ii) |\n| [0678-valid-parenthesis-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0678-valid-parenthesis-string) |\n| [0735-asteroid-collision](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0735-asteroid-collision) |\n| [0739-daily-temperatures](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0739-daily-temperatures) |\n| [0874-backspace-string-compare](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0874-backspace-string-compare) |\n| [0916-decoded-string-at-index](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0916-decoded-string-at-index) |\n| [0943-sum-of-subarray-minimums](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0943-sum-of-subarray-minimums) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [1078-remove-outermost-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1078-remove-outermost-parentheses) |\n| [1159-smallest-subsequence-of-distinct-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1159-smallest-subsequence-of-distinct-characters) |\n| [1666-make-the-string-great](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1666-make-the-string-great) |\n| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |\n| [2227-sum-of-subarray-ranges](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2227-sum-of-subarray-ranges) |\n| [3447-clear-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3447-clear-digits) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0002-add-two-numbers) |\n| [0021-merge-two-sorted-lists](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0021-merge-two-sorted-lists) |\n| [0024-swap-nodes-in-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0024-swap-nodes-in-pairs) |\n| [0025-reverse-nodes-in-k-group](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0025-reverse-nodes-in-k-group) |\n| [0050-powx-n](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0050-powx-n) |\n| [0060-permutation-sequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0060-permutation-sequence) |\n| [0203-remove-linked-list-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0203-remove-linked-list-elements) |\n| [0206-reverse-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0206-reverse-linked-list) |\n| [0231-power-of-two](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0231-power-of-two) |\n| [0234-palindrome-linked-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0234-palindrome-linked-list) |\n| [0326-power-of-three](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0326-power-of-three) |\n| [0342-power-of-four](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0342-power-of-four) |\n| [1013-fibonacci-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1013-fibonacci-number) |\n| [2050-count-good-numbers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2050-count-good-numbers) |\n## Binary Search\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0004-median-of-two-sorted-arrays) |\n| [0033-search-in-rotated-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0033-search-in-rotated-sorted-array) |\n| [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) |\n| [0035-search-insert-position](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0035-search-insert-position) |\n| [0069-sqrtx](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0069-sqrtx) |\n| [0074-search-a-2d-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0074-search-a-2d-matrix) |\n| [0081-search-in-rotated-sorted-array-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0081-search-in-rotated-sorted-array-ii) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0162-find-peak-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0162-find-peak-element) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0222-count-complete-tree-nodes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0222-count-complete-tree-nodes) |\n| [0240-search-a-2d-matrix-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0240-search-a-2d-matrix-ii) |\n| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |\n| [0287-find-the-duplicate-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0287-find-the-duplicate-number) |\n| [0349-intersection-of-two-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0349-intersection-of-two-arrays) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0410-split-array-largest-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0410-split-array-largest-sum) |\n| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |\n| [0540-single-element-in-a-sorted-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0540-single-element-in-a-sorted-array) |\n| [0745-find-smallest-letter-greater-than-target](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0745-find-smallest-letter-greater-than-target) |\n| [0792-binary-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0792-binary-search) |\n| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |\n| [0907-koko-eating-bananas](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0907-koko-eating-bananas) |\n| [1046-max-consecutive-ones-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1046-max-consecutive-ones-iii) |\n| [1056-capacity-to-ship-packages-within-d-days](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1056-capacity-to-ship-packages-within-d-days) |\n| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |\n| [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) |\n| [1612-avoid-flood-in-the-city](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1612-avoid-flood-in-the-city) |\n| [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) |\n| [1646-kth-missing-positive-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1646-kth-missing-positive-number) |\n| [1675-magnetic-force-between-two-balls](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1675-magnetic-force-between-two-balls) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [2047-find-a-peak-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2047-find-a-peak-element-ii) |\n| [2498-frog-jump-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2498-frog-jump-ii) |\n| [3790-fruits-into-baskets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3790-fruits-into-baskets-ii) |\n## Matrix\n|  |\n| ------- |\n| [0048-rotate-image](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0048-rotate-image) |\n| [0054-spiral-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0054-spiral-matrix) |\n| [0063-unique-paths-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0063-unique-paths-ii) |\n| [0064-minimum-path-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0064-minimum-path-sum) |\n| [0073-set-matrix-zeroes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0074-search-a-2d-matrix) |\n| [0079-word-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0079-word-search) |\n| [0085-maximal-rectangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0085-maximal-rectangle) |\n| [0200-number-of-islands](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0200-number-of-islands) |\n| [0240-search-a-2d-matrix-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0240-search-a-2d-matrix-ii) |\n| [0733-flood-fill](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0733-flood-fill) |\n| [1036-rotting-oranges](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1036-rotting-oranges) |\n| [1463-cherry-pickup-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1463-cherry-pickup-ii) |\n| [2047-find-a-peak-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2047-find-a-peak-element-ii) |\n| [2737-row-with-maximum-ones](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2737-row-with-maximum-ones) |\n| [3227-find-missing-and-repeated-values](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3227-find-missing-and-repeated-values) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0004-median-of-two-sorted-arrays) |\n| [0053-maximum-subarray](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0053-maximum-subarray) |\n| [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) |\n| [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) |\n| [0148-sort-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0148-sort-list) |\n| [0169-majority-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0169-majority-element) |\n| [0191-number-of-1-bits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0191-number-of-1-bits) |\n| [0215-kth-largest-element-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0240-search-a-2d-matrix-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0240-search-a-2d-matrix-ii) |\n| [0324-wiggle-sort-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0324-wiggle-sort-ii) |\n| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |\n| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |\n| [0973-k-closest-points-to-origin](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0973-k-closest-points-to-origin) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0005-longest-palindromic-substring) |\n| [0022-generate-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0022-generate-parentheses) |\n| [0042-trapping-rain-water](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0042-trapping-rain-water) |\n| [0045-jump-game-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0045-jump-game-ii) |\n| [0053-maximum-subarray](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0053-maximum-subarray) |\n| [0055-jump-game](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0055-jump-game) |\n| [0062-unique-paths](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0062-unique-paths) |\n| [0063-unique-paths-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0063-unique-paths-ii) |\n| [0064-minimum-path-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0064-minimum-path-sum) |\n| [0070-climbing-stairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0070-climbing-stairs) |\n| [0085-maximal-rectangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0085-maximal-rectangle) |\n| [0118-pascals-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0118-pascals-triangle) |\n| [0119-pascals-triangle-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0119-pascals-triangle-ii) |\n| [0120-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0120-triangle) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0131-palindrome-partitioning](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0131-palindrome-partitioning) |\n| [0152-maximum-product-subarray](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0152-maximum-product-subarray) |\n| [0198-house-robber](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0198-house-robber) |\n| [0213-house-robber-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0213-house-robber-ii) |\n| [0392-is-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0392-is-subsequence) |\n| [0410-split-array-largest-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0410-split-array-largest-sum) |\n| [0416-partition-equal-subset-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0416-partition-equal-subset-sum) |\n| [0435-non-overlapping-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0435-non-overlapping-intervals) |\n| [0472-concatenated-words](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0472-concatenated-words) |\n| [0678-valid-parenthesis-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0678-valid-parenthesis-string) |\n| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |\n| [0943-sum-of-subarray-minimums](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0943-sum-of-subarray-minimums) |\n| [1013-fibonacci-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1013-fibonacci-number) |\n| [1463-cherry-pickup-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1463-cherry-pickup-ii) |\n| [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) |\n| [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) |\n## Simulation\n|  |\n| ------- |\n| [0054-spiral-matrix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0054-spiral-matrix) |\n| [0735-asteroid-collision](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0735-asteroid-collision) |\n| [0874-backspace-string-compare](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0874-backspace-string-compare) |\n| [1310-watering-plants](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1310-watering-plants) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2271-rearrange-array-elements-by-sign) |\n| [3447-clear-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3447-clear-digits) |\n| [3790-fruits-into-baskets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3790-fruits-into-baskets-ii) |\n| [3931-process-string-with-special-operations-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3931-process-string-with-special-operations-i) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0128-longest-consecutive-sequence) |\n| [0200-number-of-islands](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0200-number-of-islands) |\n| [0547-number-of-provinces](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0547-number-of-provinces) |\n| [0785-is-graph-bipartite](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0785-is-graph-bipartite) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0029-divide-two-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0029-divide-two-integers) |\n| [0078-subsets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0078-subsets) |\n| [0090-subsets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0090-subsets-ii) |\n| [0136-single-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0136-single-number) |\n| [0137-single-number-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0137-single-number-ii) |\n| [0191-number-of-1-bits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0191-number-of-1-bits) |\n| [0222-count-complete-tree-nodes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0222-count-complete-tree-nodes) |\n| [0231-power-of-two](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0231-power-of-two) |\n| [0260-single-number-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0260-single-number-iii) |\n| [0268-missing-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0268-missing-number) |\n| [0287-find-the-duplicate-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0287-find-the-duplicate-number) |\n| [0342-power-of-four](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0342-power-of-four) |\n| [0389-find-the-difference](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0389-find-the-difference) |\n| [0645-set-mismatch](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0645-set-mismatch) |\n| [1610-xor-operation-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1610-xor-operation-in-an-array) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |\n| [2323-minimum-bit-flips-to-convert-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2323-minimum-bit-flips-to-convert-number) |\n## Counting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0169-majority-element) |\n| [0229-majority-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0229-majority-element-ii) |\n| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |\n| [0383-ransom-note](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0383-ransom-note) |\n| [0387-first-unique-character-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0387-first-unique-character-in-a-string) |\n| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |\n| [0594-longest-harmonious-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0594-longest-harmonious-subsequence) |\n| [1034-subarrays-with-k-different-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1034-subarrays-with-k-different-integers) |\n| [1510-find-lucky-integer-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1510-find-lucky-integer-in-an-array) |\n| [1777-determine-if-two-strings-are-close](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1777-determine-if-two-strings-are-close) |\n| [1823-determine-if-string-halves-are-alike](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1823-determine-if-string-halves-are-alike) |\n| [1848-sum-of-unique-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1848-sum-of-unique-elements) |\n| [1890-sum-of-beauty-of-all-substrings](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |\n| [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) |\n| [3872-find-most-frequent-vowel-and-consonant](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3872-find-most-frequent-vowel-and-consonant) |\n## Design\n|  |\n| ------- |\n| [0155-min-stack](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0155-min-stack) |\n| [0225-implement-stack-using-queues](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0232-implement-queue-using-stacks) |\n| [1995-finding-pairs-with-a-certain-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1995-finding-pairs-with-a-certain-sum) |\n## Queue\n|  |\n| ------- |\n| [0225-implement-stack-using-queues](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0232-implement-queue-using-stacks) |\n| [0387-first-unique-character-in-a-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0387-first-unique-character-in-a-string) |\n## Greedy\n|  |\n| ------- |\n| [0045-jump-game-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0045-jump-game-ii) |\n| [0055-jump-game](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0055-jump-game) |\n| [0135-candy](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0135-candy) |\n| [0316-remove-duplicate-letters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0316-remove-duplicate-letters) |\n| [0324-wiggle-sort-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0324-wiggle-sort-ii) |\n| [0402-remove-k-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0402-remove-k-digits) |\n| [0409-longest-palindrome](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0409-longest-palindrome) |\n| [0410-split-array-largest-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0410-split-array-largest-sum) |\n| [0435-non-overlapping-intervals](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0435-non-overlapping-intervals) |\n| [0455-assign-cookies](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0455-assign-cookies) |\n| [0678-valid-parenthesis-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0678-valid-parenthesis-string) |\n| [0890-lemonade-change](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0890-lemonade-change) |\n| [1018-largest-perimeter-triangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1018-largest-perimeter-triangle) |\n| [1159-smallest-subsequence-of-distinct-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1159-smallest-subsequence-of-distinct-characters) |\n| [1448-maximum-69-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1448-maximum-69-number) |\n| [1612-avoid-flood-in-the-city](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1612-avoid-flood-in-the-city) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [2032-largest-odd-number-in-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2032-largest-odd-number-in-string) |\n| [2248-minimum-cost-of-buying-candies-with-discount](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2248-minimum-cost-of-buying-candies-with-discount) |\n| [2498-frog-jump-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2498-frog-jump-ii) |\n| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0070-climbing-stairs) |\n| [1013-fibonacci-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1013-fibonacci-number) |\n## Prefix Sum\n|  |\n| ------- |\n| [0238-product-of-array-except-self](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0238-product-of-array-except-self) |\n| [0410-split-array-largest-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0410-split-array-largest-sum) |\n| [0560-subarray-sum-equals-k](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0560-subarray-sum-equals-k) |\n| [0966-binary-subarrays-with-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0966-binary-subarrays-with-sum) |\n| [1046-max-consecutive-ones-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1046-max-consecutive-ones-iii) |\n| [1370-count-number-of-nice-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1370-count-number-of-nice-subarrays) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |\n## Sliding Window\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0219-contains-duplicate-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0219-contains-duplicate-ii) |\n| [0424-longest-repeating-character-replacement](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0424-longest-repeating-character-replacement) |\n| [0594-longest-harmonious-subsequence](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0594-longest-harmonious-subsequence) |\n| [0940-fruit-into-baskets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0940-fruit-into-baskets) |\n| [0966-binary-subarrays-with-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0966-binary-subarrays-with-sum) |\n| [1034-subarrays-with-k-different-integers](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1034-subarrays-with-k-different-integers) |\n| [1046-max-consecutive-ones-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1046-max-consecutive-ones-iii) |\n| [1370-count-number-of-nice-subarrays](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1370-count-number-of-nice-subarrays) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n| [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) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n## Binary Indexed Tree\n|  |\n| ------- |\n| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |\n## Segment Tree\n|  |\n| ------- |\n| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |\n| [3790-fruits-into-baskets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3790-fruits-into-baskets-ii) |\n## Merge Sort\n|  |\n| ------- |\n| [0148-sort-list](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0148-sort-list) |\n| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |\n## Ordered Set\n|  |\n| ------- |\n| [0493-reverse-pairs](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0493-reverse-pairs) |\n| [3790-fruits-into-baskets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/3790-fruits-into-baskets-ii) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0014-longest-common-prefix) |\n| [0472-concatenated-words](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0472-concatenated-words) |\n| [0808-number-of-matching-subsequences](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0808-number-of-matching-subsequences) |\n## String Matching\n|  |\n| ------- |\n| [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) |\n| [0459-repeated-substring-pattern](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0459-repeated-substring-pattern) |\n| [0812-rotate-string](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0812-rotate-string) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0215-kth-largest-element-in-an-array](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |\n| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |\n| [0973-k-closest-points-to-origin](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0973-k-closest-points-to-origin) |\n| [1612-avoid-flood-in-the-city](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1612-avoid-flood-in-the-city) |\n## Bucket Sort\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0347-top-k-frequent-elements) |\n| [0451-sort-characters-by-frequency](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0451-sort-characters-by-frequency) |\n## Backtracking\n|  |\n| ------- |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0022-generate-parentheses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0022-generate-parentheses) |\n| [0039-combination-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0040-combination-sum-ii) |\n| [0051-n-queens](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0051-n-queens) |\n| [0078-subsets](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0078-subsets) |\n| [0079-word-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0079-word-search) |\n| [0090-subsets-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0090-subsets-ii) |\n| [0093-restore-ip-addresses](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0093-restore-ip-addresses) |\n| [0131-palindrome-partitioning](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0131-palindrome-partitioning) |\n| [0216-combination-sum-iii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0216-combination-sum-iii) |\n## Depth-First Search\n|  |\n| ------- |\n| [0079-word-search](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0079-word-search) |\n| [0094-binary-tree-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0101-symmetric-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0110-balanced-binary-tree) |\n| [0112-path-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0112-path-sum) |\n| [0144-binary-tree-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0199-binary-tree-right-side-view) |\n| [0200-number-of-islands](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0200-number-of-islands) |\n| [0207-course-schedule](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0207-course-schedule) |\n| [0210-course-schedule-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0210-course-schedule-ii) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [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) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0472-concatenated-words](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0472-concatenated-words) |\n| [0543-diameter-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0543-diameter-of-binary-tree) |\n| [0547-number-of-provinces](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0547-number-of-provinces) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0662-maximum-width-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0662-maximum-width-of-binary-tree) |\n| [0733-flood-fill](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0733-flood-fill) |\n| [0785-is-graph-bipartite](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0785-is-graph-bipartite) |\n| [0802-find-eventual-safe-states](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0802-find-eventual-safe-states) |\n| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0893-all-nodes-distance-k-in-binary-tree) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0042-trapping-rain-water](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0042-trapping-rain-water) |\n| [0084-largest-rectangle-in-histogram](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0084-largest-rectangle-in-histogram) |\n| [0085-maximal-rectangle](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0085-maximal-rectangle) |\n| [0316-remove-duplicate-letters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0316-remove-duplicate-letters) |\n| [0402-remove-k-digits](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0402-remove-k-digits) |\n| [0496-next-greater-element-i](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0496-next-greater-element-i) |\n| [0503-next-greater-element-ii](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0503-next-greater-element-ii) |\n| [0739-daily-temperatures](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0739-daily-temperatures) |\n| [0943-sum-of-subarray-minimums](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0943-sum-of-subarray-minimums) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [1159-smallest-subsequence-of-distinct-characters](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1159-smallest-subsequence-of-distinct-characters) |\n| [2227-sum-of-subarray-ranges](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2227-sum-of-subarray-ranges) |\n## Enumeration\n|  |\n| ------- |\n| [0204-count-primes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0204-count-primes) |\n## Number Theory\n|  |\n| ------- |\n| [0204-count-primes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0204-count-primes) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0104-maximum-depth-of-binary-tree) |\n| [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) |\n| [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) |\n| [0110-balanced-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0110-balanced-binary-tree) |\n| [0112-path-sum](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0112-path-sum) |\n| [0144-binary-tree-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0199-binary-tree-right-side-view) |\n| [0222-count-complete-tree-nodes](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0222-count-complete-tree-nodes) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [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) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0450-delete-node-in-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0450-delete-node-in-a-bst) |\n| [0543-diameter-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0543-diameter-of-binary-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0662-maximum-width-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0662-maximum-width-of-binary-tree) |\n| [0783-search-in-a-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0783-search-in-a-binary-search-tree) |\n| [0784-insert-into-a-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0784-insert-into-a-binary-search-tree) |\n| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0893-all-nodes-distance-k-in-binary-tree) |\n| [0998-check-completeness-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0998-check-completeness-of-a-binary-tree) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |\n| [2384-root-equals-sum-of-children](https://github.com/angelagarwal2/leetcode_solutions/tree/master/2384-root-equals-sum-of-children) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/angelagarwal2/leetcode_solutions/tree/master/0104-maximum-depth-of-binary-tree) |\n| [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)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fangelagarwal2%2Fleetcode_solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fangelagarwal2%2Fleetcode_solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fangelagarwal2%2Fleetcode_solutions/lists"}