{"id":20302348,"url":"https://github.com/eesunmoon/leetcode","last_synced_at":"2026-06-11T14:31:23.795Z","repository":{"id":258148674,"uuid":"872174183","full_name":"EesunMoon/leetcode","owner":"EesunMoon","description":"DSA \u0026 Problem-solving","archived":false,"fork":false,"pushed_at":"2025-10-31T05:31:19.000Z","size":1647,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-31T06:24:50.157Z","etag":null,"topics":["algorithms","data-structures","problem-solving","python"],"latest_commit_sha":null,"homepage":"","language":"Python","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/EesunMoon.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2024-10-14T00:47:39.000Z","updated_at":"2025-10-31T05:31:23.000Z","dependencies_parsed_at":"2024-10-25T02:23:35.421Z","dependency_job_id":"5e65913f-436c-4da8-b551-146af42a74d4","html_url":"https://github.com/EesunMoon/leetcode","commit_stats":null,"previous_names":["eesunmoon/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/EesunMoon/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EesunMoon%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EesunMoon%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EesunMoon%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EesunMoon%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/EesunMoon","download_url":"https://codeload.github.com/EesunMoon/leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EesunMoon%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34204177,"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-11T02:00:06.485Z","response_time":57,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","data-structures","problem-solving","python"],"created_at":"2024-11-14T16:30:50.191Z","updated_at":"2026-06-11T14:31:23.787Z","avatar_url":"https://github.com/EesunMoon.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/EesunMoon/leetcode/tree/master/0001-two-sum) |\n| [0004-median-of-two-sorted-arrays](https://github.com/EesunMoon/leetcode/tree/master/0004-median-of-two-sorted-arrays) |\n| [0011-container-with-most-water](https://github.com/EesunMoon/leetcode/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/EesunMoon/leetcode/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/EesunMoon/leetcode/tree/master/0018-4sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/EesunMoon/leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/EesunMoon/leetcode/tree/master/0027-remove-element) |\n| [0033-search-in-rotated-sorted-array](https://github.com/EesunMoon/leetcode/tree/master/0033-search-in-rotated-sorted-array) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/EesunMoon/leetcode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0036-valid-sudoku](https://github.com/EesunMoon/leetcode/tree/master/0036-valid-sudoku) |\n| [0039-combination-sum](https://github.com/EesunMoon/leetcode/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/EesunMoon/leetcode/tree/master/0040-combination-sum-ii) |\n| [0042-trapping-rain-water](https://github.com/EesunMoon/leetcode/tree/master/0042-trapping-rain-water) |\n| [0045-jump-game-ii](https://github.com/EesunMoon/leetcode/tree/master/0045-jump-game-ii) |\n| [0046-permutations](https://github.com/EesunMoon/leetcode/tree/master/0046-permutations) |\n| [0048-rotate-image](https://github.com/EesunMoon/leetcode/tree/master/0048-rotate-image) |\n| [0049-group-anagrams](https://github.com/EesunMoon/leetcode/tree/master/0049-group-anagrams) |\n| [0051-n-queens](https://github.com/EesunMoon/leetcode/tree/master/0051-n-queens) |\n| [0053-maximum-subarray](https://github.com/EesunMoon/leetcode/tree/master/0053-maximum-subarray) |\n| [0054-spiral-matrix](https://github.com/EesunMoon/leetcode/tree/master/0054-spiral-matrix) |\n| [0055-jump-game](https://github.com/EesunMoon/leetcode/tree/master/0055-jump-game) |\n| [0056-merge-intervals](https://github.com/EesunMoon/leetcode/tree/master/0056-merge-intervals) |\n| [0057-insert-interval](https://github.com/EesunMoon/leetcode/tree/master/0057-insert-interval) |\n| [0064-minimum-path-sum](https://github.com/EesunMoon/leetcode/tree/master/0064-minimum-path-sum) |\n| [0066-plus-one](https://github.com/EesunMoon/leetcode/tree/master/0066-plus-one) |\n| [0073-set-matrix-zeroes](https://github.com/EesunMoon/leetcode/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/EesunMoon/leetcode/tree/master/0074-search-a-2d-matrix) |\n| [0075-sort-colors](https://github.com/EesunMoon/leetcode/tree/master/0075-sort-colors) |\n| [0078-subsets](https://github.com/EesunMoon/leetcode/tree/master/0078-subsets) |\n| [0079-word-search](https://github.com/EesunMoon/leetcode/tree/master/0079-word-search) |\n| [0084-largest-rectangle-in-histogram](https://github.com/EesunMoon/leetcode/tree/master/0084-largest-rectangle-in-histogram) |\n| [0088-merge-sorted-array](https://github.com/EesunMoon/leetcode/tree/master/0088-merge-sorted-array) |\n| [0090-subsets-ii](https://github.com/EesunMoon/leetcode/tree/master/0090-subsets-ii) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/EesunMoon/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0118-pascals-triangle](https://github.com/EesunMoon/leetcode/tree/master/0118-pascals-triangle) |\n| [0119-pascals-triangle-ii](https://github.com/EesunMoon/leetcode/tree/master/0119-pascals-triangle-ii) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/EesunMoon/leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/EesunMoon/leetcode/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |\n| [0128-longest-consecutive-sequence](https://github.com/EesunMoon/leetcode/tree/master/0128-longest-consecutive-sequence) |\n| [0130-surrounded-regions](https://github.com/EesunMoon/leetcode/tree/master/0130-surrounded-regions) |\n| [0134-gas-station](https://github.com/EesunMoon/leetcode/tree/master/0134-gas-station) |\n| [0136-single-number](https://github.com/EesunMoon/leetcode/tree/master/0136-single-number) |\n| [0139-word-break](https://github.com/EesunMoon/leetcode/tree/master/0139-word-break) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/EesunMoon/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0152-maximum-product-subarray](https://github.com/EesunMoon/leetcode/tree/master/0152-maximum-product-subarray) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/EesunMoon/leetcode/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0158-read-n-characters-given-read4-ii-call-multiple-times](https://github.com/EesunMoon/leetcode/tree/master/0158-read-n-characters-given-read4-ii-call-multiple-times) |\n| [0162-find-peak-element](https://github.com/EesunMoon/leetcode/tree/master/0162-find-peak-element) |\n| [0164-maximum-gap](https://github.com/EesunMoon/leetcode/tree/master/0164-maximum-gap) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/EesunMoon/leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0169-majority-element](https://github.com/EesunMoon/leetcode/tree/master/0169-majority-element) |\n| [0189-rotate-array](https://github.com/EesunMoon/leetcode/tree/master/0189-rotate-array) |\n| [0198-house-robber](https://github.com/EesunMoon/leetcode/tree/master/0198-house-robber) |\n| [0200-number-of-islands](https://github.com/EesunMoon/leetcode/tree/master/0200-number-of-islands) |\n| [0209-minimum-size-subarray-sum](https://github.com/EesunMoon/leetcode/tree/master/0209-minimum-size-subarray-sum) |\n| [0212-word-search-ii](https://github.com/EesunMoon/leetcode/tree/master/0212-word-search-ii) |\n| [0213-house-robber-ii](https://github.com/EesunMoon/leetcode/tree/master/0213-house-robber-ii) |\n| [0215-kth-largest-element-in-an-array](https://github.com/EesunMoon/leetcode/tree/master/0215-kth-largest-element-in-an-array) |\n| [0217-contains-duplicate](https://github.com/EesunMoon/leetcode/tree/master/0217-contains-duplicate) |\n| [0220-contains-duplicate-iii](https://github.com/EesunMoon/leetcode/tree/master/0220-contains-duplicate-iii) |\n| [0238-product-of-array-except-self](https://github.com/EesunMoon/leetcode/tree/master/0238-product-of-array-except-self) |\n| [0239-sliding-window-maximum](https://github.com/EesunMoon/leetcode/tree/master/0239-sliding-window-maximum) |\n| [0240-search-a-2d-matrix-ii](https://github.com/EesunMoon/leetcode/tree/master/0240-search-a-2d-matrix-ii) |\n| [0252-meeting-rooms](https://github.com/EesunMoon/leetcode/tree/master/0252-meeting-rooms) |\n| [0253-meeting-rooms-ii](https://github.com/EesunMoon/leetcode/tree/master/0253-meeting-rooms-ii) |\n| [0268-missing-number](https://github.com/EesunMoon/leetcode/tree/master/0268-missing-number) |\n| [0269-alien-dictionary](https://github.com/EesunMoon/leetcode/tree/master/0269-alien-dictionary) |\n| [0271-encode-and-decode-strings](https://github.com/EesunMoon/leetcode/tree/master/0271-encode-and-decode-strings) |\n| [0283-move-zeroes](https://github.com/EesunMoon/leetcode/tree/master/0283-move-zeroes) |\n| [0284-peeking-iterator](https://github.com/EesunMoon/leetcode/tree/master/0284-peeking-iterator) |\n| [0286-walls-and-gates](https://github.com/EesunMoon/leetcode/tree/master/0286-walls-and-gates) |\n| [0287-find-the-duplicate-number](https://github.com/EesunMoon/leetcode/tree/master/0287-find-the-duplicate-number) |\n| [0300-longest-increasing-subsequence](https://github.com/EesunMoon/leetcode/tree/master/0300-longest-increasing-subsequence) |\n| [0309-best-time-to-buy-and-sell-stock-with-cooldown](https://github.com/EesunMoon/leetcode/tree/master/0309-best-time-to-buy-and-sell-stock-with-cooldown) |\n| [0312-burst-balloons](https://github.com/EesunMoon/leetcode/tree/master/0312-burst-balloons) |\n| [0322-coin-change](https://github.com/EesunMoon/leetcode/tree/master/0322-coin-change) |\n| [0329-longest-increasing-path-in-a-matrix](https://github.com/EesunMoon/leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |\n| [0346-moving-average-from-data-stream](https://github.com/EesunMoon/leetcode/tree/master/0346-moving-average-from-data-stream) |\n| [0347-top-k-frequent-elements](https://github.com/EesunMoon/leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0349-intersection-of-two-arrays](https://github.com/EesunMoon/leetcode/tree/master/0349-intersection-of-two-arrays) |\n| [0362-design-hit-counter](https://github.com/EesunMoon/leetcode/tree/master/0362-design-hit-counter) |\n| [0373-find-k-pairs-with-smallest-sums](https://github.com/EesunMoon/leetcode/tree/master/0373-find-k-pairs-with-smallest-sums) |\n| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/EesunMoon/leetcode/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |\n| [0380-insert-delete-getrandom-o1](https://github.com/EesunMoon/leetcode/tree/master/0380-insert-delete-getrandom-o1) |\n| [0416-partition-equal-subset-sum](https://github.com/EesunMoon/leetcode/tree/master/0416-partition-equal-subset-sum) |\n| [0417-pacific-atlantic-water-flow](https://github.com/EesunMoon/leetcode/tree/master/0417-pacific-atlantic-water-flow) |\n| [0435-non-overlapping-intervals](https://github.com/EesunMoon/leetcode/tree/master/0435-non-overlapping-intervals) |\n| [0491-non-decreasing-subsequences](https://github.com/EesunMoon/leetcode/tree/master/0491-non-decreasing-subsequences) |\n| [0494-target-sum](https://github.com/EesunMoon/leetcode/tree/master/0494-target-sum) |\n| [0496-next-greater-element-i](https://github.com/EesunMoon/leetcode/tree/master/0496-next-greater-element-i) |\n| [0498-diagonal-traverse](https://github.com/EesunMoon/leetcode/tree/master/0498-diagonal-traverse) |\n| [0518-coin-change-ii](https://github.com/EesunMoon/leetcode/tree/master/0518-coin-change-ii) |\n| [0525-contiguous-array](https://github.com/EesunMoon/leetcode/tree/master/0525-contiguous-array) |\n| [0542-01-matrix](https://github.com/EesunMoon/leetcode/tree/master/0542-01-matrix) |\n| [0560-subarray-sum-equals-k](https://github.com/EesunMoon/leetcode/tree/master/0560-subarray-sum-equals-k) |\n| [0621-task-scheduler](https://github.com/EesunMoon/leetcode/tree/master/0621-task-scheduler) |\n| [0624-maximum-distance-in-arrays](https://github.com/EesunMoon/leetcode/tree/master/0624-maximum-distance-in-arrays) |\n| [0628-maximum-product-of-three-numbers](https://github.com/EesunMoon/leetcode/tree/master/0628-maximum-product-of-three-numbers) |\n| [0673-number-of-longest-increasing-subsequence](https://github.com/EesunMoon/leetcode/tree/master/0673-number-of-longest-increasing-subsequence) |\n| [0695-max-area-of-island](https://github.com/EesunMoon/leetcode/tree/master/0695-max-area-of-island) |\n| [0713-subarray-product-less-than-k](https://github.com/EesunMoon/leetcode/tree/master/0713-subarray-product-less-than-k) |\n| [0721-accounts-merge](https://github.com/EesunMoon/leetcode/tree/master/0721-accounts-merge) |\n| [0735-asteroid-collision](https://github.com/EesunMoon/leetcode/tree/master/0735-asteroid-collision) |\n| [0739-daily-temperatures](https://github.com/EesunMoon/leetcode/tree/master/0739-daily-temperatures) |\n| [0740-delete-and-earn](https://github.com/EesunMoon/leetcode/tree/master/0740-delete-and-earn) |\n| [0747-min-cost-climbing-stairs](https://github.com/EesunMoon/leetcode/tree/master/0747-min-cost-climbing-stairs) |\n| [0753-open-the-lock](https://github.com/EesunMoon/leetcode/tree/master/0753-open-the-lock) |\n| [0792-binary-search](https://github.com/EesunMoon/leetcode/tree/master/0792-binary-search) |\n| [0794-swim-in-rising-water](https://github.com/EesunMoon/leetcode/tree/master/0794-swim-in-rising-water) |\n| [0817-design-hashmap](https://github.com/EesunMoon/leetcode/tree/master/0817-design-hashmap) |\n| [0827-expressive-words](https://github.com/EesunMoon/leetcode/tree/master/0827-expressive-words) |\n| [0860-design-circular-queue](https://github.com/EesunMoon/leetcode/tree/master/0860-design-circular-queue) |\n| [0876-hand-of-straights](https://github.com/EesunMoon/leetcode/tree/master/0876-hand-of-straights) |\n| [0879-maximize-distance-to-closest-person](https://github.com/EesunMoon/leetcode/tree/master/0879-maximize-distance-to-closest-person) |\n| [0883-car-fleet](https://github.com/EesunMoon/leetcode/tree/master/0883-car-fleet) |\n| [0907-koko-eating-bananas](https://github.com/EesunMoon/leetcode/tree/master/0907-koko-eating-bananas) |\n| [0912-random-pick-with-weight](https://github.com/EesunMoon/leetcode/tree/master/0912-random-pick-with-weight) |\n| [0943-sum-of-subarray-minimums](https://github.com/EesunMoon/leetcode/tree/master/0943-sum-of-subarray-minimums) |\n| [0948-sort-an-array](https://github.com/EesunMoon/leetcode/tree/master/0948-sort-an-array) |\n| [0965-unique-email-addresses](https://github.com/EesunMoon/leetcode/tree/master/0965-unique-email-addresses) |\n| [1002-maximum-width-ramp](https://github.com/EesunMoon/leetcode/tree/master/1002-maximum-width-ramp) |\n| [1009-pancake-sorting](https://github.com/EesunMoon/leetcode/tree/master/1009-pancake-sorting) |\n| [1014-k-closest-points-to-origin](https://github.com/EesunMoon/leetcode/tree/master/1014-k-closest-points-to-origin) |\n| [1036-rotting-oranges](https://github.com/EesunMoon/leetcode/tree/master/1036-rotting-oranges) |\n| [1046-max-consecutive-ones-iii](https://github.com/EesunMoon/leetcode/tree/master/1046-max-consecutive-ones-iii) |\n| [1049-minimum-domino-rotations-for-equal-row](https://github.com/EesunMoon/leetcode/tree/master/1049-minimum-domino-rotations-for-equal-row) |\n| [1094-matrix-cells-in-distance-order](https://github.com/EesunMoon/leetcode/tree/master/1094-matrix-cells-in-distance-order) |\n| [1108-analyze-user-website-visit-pattern](https://github.com/EesunMoon/leetcode/tree/master/1108-analyze-user-website-visit-pattern) |\n| [1126-minimum-cost-to-connect-sticks](https://github.com/EesunMoon/leetcode/tree/master/1126-minimum-cost-to-connect-sticks) |\n| [1127-last-stone-weight](https://github.com/EesunMoon/leetcode/tree/master/1127-last-stone-weight) |\n| [1137-height-checker](https://github.com/EesunMoon/leetcode/tree/master/1137-height-checker) |\n| [1249-snapshot-array](https://github.com/EesunMoon/leetcode/tree/master/1249-snapshot-array) |\n| [1256-rank-transform-of-an-array](https://github.com/EesunMoon/leetcode/tree/master/1256-rank-transform-of-an-array) |\n| [1306-minimum-absolute-difference](https://github.com/EesunMoon/leetcode/tree/master/1306-minimum-absolute-difference) |\n| [1396-count-servers-that-communicate](https://github.com/EesunMoon/leetcode/tree/master/1396-count-servers-that-communicate) |\n| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/EesunMoon/leetcode/tree/master/1463-the-k-weakest-rows-in-a-matrix) |\n| [1706-min-cost-to-connect-all-points](https://github.com/EesunMoon/leetcode/tree/master/1706-min-cost-to-connect-all-points) |\n| [1753-path-with-minimum-effort](https://github.com/EesunMoon/leetcode/tree/master/1753-path-with-minimum-effort) |\n| [1762-furthest-building-you-can-reach](https://github.com/EesunMoon/leetcode/tree/master/1762-furthest-building-you-can-reach) |\n| [1878-check-if-array-is-sorted-and-rotated](https://github.com/EesunMoon/leetcode/tree/master/1878-check-if-array-is-sorted-and-rotated) |\n| [1909-buildings-with-an-ocean-view](https://github.com/EesunMoon/leetcode/tree/master/1909-buildings-with-an-ocean-view) |\n| [1977-minimum-interval-to-include-each-query](https://github.com/EesunMoon/leetcode/tree/master/1977-minimum-interval-to-include-each-query) |\n| [2026-merge-triplets-to-form-target-triplet](https://github.com/EesunMoon/leetcode/tree/master/2026-merge-triplets-to-form-target-triplet) |\n| [2139-detect-squares](https://github.com/EesunMoon/leetcode/tree/master/2139-detect-squares) |\n| [2165-plates-between-candles](https://github.com/EesunMoon/leetcode/tree/master/2165-plates-between-candles) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/EesunMoon/leetcode/tree/master/2271-rearrange-array-elements-by-sign) |\n| [2354-minimum-health-to-beat-game](https://github.com/EesunMoon/leetcode/tree/master/2354-minimum-health-to-beat-game) |\n| [2436-make-array-zero-by-subtracting-equal-amounts](https://github.com/EesunMoon/leetcode/tree/master/2436-make-array-zero-by-subtracting-equal-amounts) |\n| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/EesunMoon/leetcode/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |\n| [2548-destroy-sequential-targets](https://github.com/EesunMoon/leetcode/tree/master/2548-destroy-sequential-targets) |\n| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/EesunMoon/leetcode/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |\n| [2718-minimum-operations-to-make-all-array-elements-equal](https://github.com/EesunMoon/leetcode/tree/master/2718-minimum-operations-to-make-all-array-elements-equal) |\n| [2792-neighboring-bitwise-xor](https://github.com/EesunMoon/leetcode/tree/master/2792-neighboring-bitwise-xor) |\n| [3429-special-array-i](https://github.com/EesunMoon/leetcode/tree/master/3429-special-array-i) |\n| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/EesunMoon/leetcode/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |\n| [3594-identify-the-largest-outlier-in-an-array](https://github.com/EesunMoon/leetcode/tree/master/3594-identify-the-largest-outlier-in-an-array) |\n| [3656-minimum-number-of-operations-to-make-elements-in-array-distinct](https://github.com/EesunMoon/leetcode/tree/master/3656-minimum-number-of-operations-to-make-elements-in-array-distinct) |\n## Binary Search\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/EesunMoon/leetcode/tree/master/0004-median-of-two-sorted-arrays) |\n| [0033-search-in-rotated-sorted-array](https://github.com/EesunMoon/leetcode/tree/master/0033-search-in-rotated-sorted-array) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/EesunMoon/leetcode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0069-sqrtx](https://github.com/EesunMoon/leetcode/tree/master/0069-sqrtx) |\n| [0074-search-a-2d-matrix](https://github.com/EesunMoon/leetcode/tree/master/0074-search-a-2d-matrix) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/EesunMoon/leetcode/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0162-find-peak-element](https://github.com/EesunMoon/leetcode/tree/master/0162-find-peak-element) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/EesunMoon/leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0209-minimum-size-subarray-sum](https://github.com/EesunMoon/leetcode/tree/master/0209-minimum-size-subarray-sum) |\n| [0240-search-a-2d-matrix-ii](https://github.com/EesunMoon/leetcode/tree/master/0240-search-a-2d-matrix-ii) |\n| [0268-missing-number](https://github.com/EesunMoon/leetcode/tree/master/0268-missing-number) |\n| [0278-first-bad-version](https://github.com/EesunMoon/leetcode/tree/master/0278-first-bad-version) |\n| [0287-find-the-duplicate-number](https://github.com/EesunMoon/leetcode/tree/master/0287-find-the-duplicate-number) |\n| [0300-longest-increasing-subsequence](https://github.com/EesunMoon/leetcode/tree/master/0300-longest-increasing-subsequence) |\n| [0349-intersection-of-two-arrays](https://github.com/EesunMoon/leetcode/tree/master/0349-intersection-of-two-arrays) |\n| [0362-design-hit-counter](https://github.com/EesunMoon/leetcode/tree/master/0362-design-hit-counter) |\n| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/EesunMoon/leetcode/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |\n| [0713-subarray-product-less-than-k](https://github.com/EesunMoon/leetcode/tree/master/0713-subarray-product-less-than-k) |\n| [0792-binary-search](https://github.com/EesunMoon/leetcode/tree/master/0792-binary-search) |\n| [0794-swim-in-rising-water](https://github.com/EesunMoon/leetcode/tree/master/0794-swim-in-rising-water) |\n| [0907-koko-eating-bananas](https://github.com/EesunMoon/leetcode/tree/master/0907-koko-eating-bananas) |\n| [0912-random-pick-with-weight](https://github.com/EesunMoon/leetcode/tree/master/0912-random-pick-with-weight) |\n| [1023-time-based-key-value-store](https://github.com/EesunMoon/leetcode/tree/master/1023-time-based-key-value-store) |\n| [1046-max-consecutive-ones-iii](https://github.com/EesunMoon/leetcode/tree/master/1046-max-consecutive-ones-iii) |\n| [1150-two-sum-bsts](https://github.com/EesunMoon/leetcode/tree/master/1150-two-sum-bsts) |\n| [1249-snapshot-array](https://github.com/EesunMoon/leetcode/tree/master/1249-snapshot-array) |\n| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/EesunMoon/leetcode/tree/master/1463-the-k-weakest-rows-in-a-matrix) |\n| [1753-path-with-minimum-effort](https://github.com/EesunMoon/leetcode/tree/master/1753-path-with-minimum-effort) |\n| [1977-minimum-interval-to-include-each-query](https://github.com/EesunMoon/leetcode/tree/master/1977-minimum-interval-to-include-each-query) |\n| [2165-plates-between-candles](https://github.com/EesunMoon/leetcode/tree/master/2165-plates-between-candles) |\n| [2718-minimum-operations-to-make-all-array-elements-equal](https://github.com/EesunMoon/leetcode/tree/master/2718-minimum-operations-to-make-all-array-elements-equal) |\n| [3881-minimize-maximum-component-cost](https://github.com/EesunMoon/leetcode/tree/master/3881-minimize-maximum-component-cost) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/EesunMoon/leetcode/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/EesunMoon/leetcode/tree/master/0018-4sum) |\n| [0049-group-anagrams](https://github.com/EesunMoon/leetcode/tree/master/0049-group-anagrams) |\n| [0056-merge-intervals](https://github.com/EesunMoon/leetcode/tree/master/0056-merge-intervals) |\n| [0075-sort-colors](https://github.com/EesunMoon/leetcode/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/EesunMoon/leetcode/tree/master/0088-merge-sorted-array) |\n| [0147-insertion-sort-list](https://github.com/EesunMoon/leetcode/tree/master/0147-insertion-sort-list) |\n| [0148-sort-list](https://github.com/EesunMoon/leetcode/tree/master/0148-sort-list) |\n| [0164-maximum-gap](https://github.com/EesunMoon/leetcode/tree/master/0164-maximum-gap) |\n| [0169-majority-element](https://github.com/EesunMoon/leetcode/tree/master/0169-majority-element) |\n| [0215-kth-largest-element-in-an-array](https://github.com/EesunMoon/leetcode/tree/master/0215-kth-largest-element-in-an-array) |\n| [0217-contains-duplicate](https://github.com/EesunMoon/leetcode/tree/master/0217-contains-duplicate) |\n| [0220-contains-duplicate-iii](https://github.com/EesunMoon/leetcode/tree/master/0220-contains-duplicate-iii) |\n| [0242-valid-anagram](https://github.com/EesunMoon/leetcode/tree/master/0242-valid-anagram) |\n| [0252-meeting-rooms](https://github.com/EesunMoon/leetcode/tree/master/0252-meeting-rooms) |\n| [0253-meeting-rooms-ii](https://github.com/EesunMoon/leetcode/tree/master/0253-meeting-rooms-ii) |\n| [0268-missing-number](https://github.com/EesunMoon/leetcode/tree/master/0268-missing-number) |\n| [0295-find-median-from-data-stream](https://github.com/EesunMoon/leetcode/tree/master/0295-find-median-from-data-stream) |\n| [0314-binary-tree-vertical-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0314-binary-tree-vertical-order-traversal) |\n| [0347-top-k-frequent-elements](https://github.com/EesunMoon/leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0349-intersection-of-two-arrays](https://github.com/EesunMoon/leetcode/tree/master/0349-intersection-of-two-arrays) |\n| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/EesunMoon/leetcode/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |\n| [0435-non-overlapping-intervals](https://github.com/EesunMoon/leetcode/tree/master/0435-non-overlapping-intervals) |\n| [0451-sort-characters-by-frequency](https://github.com/EesunMoon/leetcode/tree/master/0451-sort-characters-by-frequency) |\n| [0621-task-scheduler](https://github.com/EesunMoon/leetcode/tree/master/0621-task-scheduler) |\n| [0628-maximum-product-of-three-numbers](https://github.com/EesunMoon/leetcode/tree/master/0628-maximum-product-of-three-numbers) |\n| [0721-accounts-merge](https://github.com/EesunMoon/leetcode/tree/master/0721-accounts-merge) |\n| [0778-reorganize-string](https://github.com/EesunMoon/leetcode/tree/master/0778-reorganize-string) |\n| [0876-hand-of-straights](https://github.com/EesunMoon/leetcode/tree/master/0876-hand-of-straights) |\n| [0883-car-fleet](https://github.com/EesunMoon/leetcode/tree/master/0883-car-fleet) |\n| [0948-sort-an-array](https://github.com/EesunMoon/leetcode/tree/master/0948-sort-an-array) |\n| [1009-pancake-sorting](https://github.com/EesunMoon/leetcode/tree/master/1009-pancake-sorting) |\n| [1014-k-closest-points-to-origin](https://github.com/EesunMoon/leetcode/tree/master/1014-k-closest-points-to-origin) |\n| [1094-matrix-cells-in-distance-order](https://github.com/EesunMoon/leetcode/tree/master/1094-matrix-cells-in-distance-order) |\n| [1108-analyze-user-website-visit-pattern](https://github.com/EesunMoon/leetcode/tree/master/1108-analyze-user-website-visit-pattern) |\n| [1137-height-checker](https://github.com/EesunMoon/leetcode/tree/master/1137-height-checker) |\n| [1256-rank-transform-of-an-array](https://github.com/EesunMoon/leetcode/tree/master/1256-rank-transform-of-an-array) |\n| [1306-minimum-absolute-difference](https://github.com/EesunMoon/leetcode/tree/master/1306-minimum-absolute-difference) |\n| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/EesunMoon/leetcode/tree/master/1463-the-k-weakest-rows-in-a-matrix) |\n| [1977-minimum-interval-to-include-each-query](https://github.com/EesunMoon/leetcode/tree/master/1977-minimum-interval-to-include-each-query) |\n| [2436-make-array-zero-by-subtracting-equal-amounts](https://github.com/EesunMoon/leetcode/tree/master/2436-make-array-zero-by-subtracting-equal-amounts) |\n| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/EesunMoon/leetcode/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |\n| [2718-minimum-operations-to-make-all-array-elements-equal](https://github.com/EesunMoon/leetcode/tree/master/2718-minimum-operations-to-make-all-array-elements-equal) |\n| [3881-minimize-maximum-component-cost](https://github.com/EesunMoon/leetcode/tree/master/3881-minimize-maximum-component-cost) |\n## Prefix Sum\n|  |\n| ------- |\n| [0209-minimum-size-subarray-sum](https://github.com/EesunMoon/leetcode/tree/master/0209-minimum-size-subarray-sum) |\n| [0238-product-of-array-except-self](https://github.com/EesunMoon/leetcode/tree/master/0238-product-of-array-except-self) |\n| [0253-meeting-rooms-ii](https://github.com/EesunMoon/leetcode/tree/master/0253-meeting-rooms-ii) |\n| [0525-contiguous-array](https://github.com/EesunMoon/leetcode/tree/master/0525-contiguous-array) |\n| [0560-subarray-sum-equals-k](https://github.com/EesunMoon/leetcode/tree/master/0560-subarray-sum-equals-k) |\n| [0713-subarray-product-less-than-k](https://github.com/EesunMoon/leetcode/tree/master/0713-subarray-product-less-than-k) |\n| [0912-random-pick-with-weight](https://github.com/EesunMoon/leetcode/tree/master/0912-random-pick-with-weight) |\n| [1046-max-consecutive-ones-iii](https://github.com/EesunMoon/leetcode/tree/master/1046-max-consecutive-ones-iii) |\n| [2165-plates-between-candles](https://github.com/EesunMoon/leetcode/tree/master/2165-plates-between-candles) |\n| [2629-number-of-substrings-with-fixed-ratio](https://github.com/EesunMoon/leetcode/tree/master/2629-number-of-substrings-with-fixed-ratio) |\n| [2718-minimum-operations-to-make-all-array-elements-equal](https://github.com/EesunMoon/leetcode/tree/master/2718-minimum-operations-to-make-all-array-elements-equal) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/EesunMoon/leetcode/tree/master/0005-longest-palindromic-substring) |\n| [0022-generate-parentheses](https://github.com/EesunMoon/leetcode/tree/master/0022-generate-parentheses) |\n| [0032-longest-valid-parentheses](https://github.com/EesunMoon/leetcode/tree/master/0032-longest-valid-parentheses) |\n| [0042-trapping-rain-water](https://github.com/EesunMoon/leetcode/tree/master/0042-trapping-rain-water) |\n| [0045-jump-game-ii](https://github.com/EesunMoon/leetcode/tree/master/0045-jump-game-ii) |\n| [0053-maximum-subarray](https://github.com/EesunMoon/leetcode/tree/master/0053-maximum-subarray) |\n| [0055-jump-game](https://github.com/EesunMoon/leetcode/tree/master/0055-jump-game) |\n| [0062-unique-paths](https://github.com/EesunMoon/leetcode/tree/master/0062-unique-paths) |\n| [0064-minimum-path-sum](https://github.com/EesunMoon/leetcode/tree/master/0064-minimum-path-sum) |\n| [0070-climbing-stairs](https://github.com/EesunMoon/leetcode/tree/master/0070-climbing-stairs) |\n| [0072-edit-distance](https://github.com/EesunMoon/leetcode/tree/master/0072-edit-distance) |\n| [0091-decode-ways](https://github.com/EesunMoon/leetcode/tree/master/0091-decode-ways) |\n| [0097-interleaving-string](https://github.com/EesunMoon/leetcode/tree/master/0097-interleaving-string) |\n| [0115-distinct-subsequences](https://github.com/EesunMoon/leetcode/tree/master/0115-distinct-subsequences) |\n| [0118-pascals-triangle](https://github.com/EesunMoon/leetcode/tree/master/0118-pascals-triangle) |\n| [0119-pascals-triangle-ii](https://github.com/EesunMoon/leetcode/tree/master/0119-pascals-triangle-ii) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/EesunMoon/leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/EesunMoon/leetcode/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/EesunMoon/leetcode/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0131-palindrome-partitioning](https://github.com/EesunMoon/leetcode/tree/master/0131-palindrome-partitioning) |\n| [0139-word-break](https://github.com/EesunMoon/leetcode/tree/master/0139-word-break) |\n| [0152-maximum-product-subarray](https://github.com/EesunMoon/leetcode/tree/master/0152-maximum-product-subarray) |\n| [0198-house-robber](https://github.com/EesunMoon/leetcode/tree/master/0198-house-robber) |\n| [0213-house-robber-ii](https://github.com/EesunMoon/leetcode/tree/master/0213-house-robber-ii) |\n| [0279-perfect-squares](https://github.com/EesunMoon/leetcode/tree/master/0279-perfect-squares) |\n| [0300-longest-increasing-subsequence](https://github.com/EesunMoon/leetcode/tree/master/0300-longest-increasing-subsequence) |\n| [0309-best-time-to-buy-and-sell-stock-with-cooldown](https://github.com/EesunMoon/leetcode/tree/master/0309-best-time-to-buy-and-sell-stock-with-cooldown) |\n| [0312-burst-balloons](https://github.com/EesunMoon/leetcode/tree/master/0312-burst-balloons) |\n| [0322-coin-change](https://github.com/EesunMoon/leetcode/tree/master/0322-coin-change) |\n| [0329-longest-increasing-path-in-a-matrix](https://github.com/EesunMoon/leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |\n| [0338-counting-bits](https://github.com/EesunMoon/leetcode/tree/master/0338-counting-bits) |\n| [0392-is-subsequence](https://github.com/EesunMoon/leetcode/tree/master/0392-is-subsequence) |\n| [0416-partition-equal-subset-sum](https://github.com/EesunMoon/leetcode/tree/master/0416-partition-equal-subset-sum) |\n| [0435-non-overlapping-intervals](https://github.com/EesunMoon/leetcode/tree/master/0435-non-overlapping-intervals) |\n| [0494-target-sum](https://github.com/EesunMoon/leetcode/tree/master/0494-target-sum) |\n| [0518-coin-change-ii](https://github.com/EesunMoon/leetcode/tree/master/0518-coin-change-ii) |\n| [0542-01-matrix](https://github.com/EesunMoon/leetcode/tree/master/0542-01-matrix) |\n| [0647-palindromic-substrings](https://github.com/EesunMoon/leetcode/tree/master/0647-palindromic-substrings) |\n| [0673-number-of-longest-increasing-subsequence](https://github.com/EesunMoon/leetcode/tree/master/0673-number-of-longest-increasing-subsequence) |\n| [0678-valid-parenthesis-string](https://github.com/EesunMoon/leetcode/tree/master/0678-valid-parenthesis-string) |\n| [0740-delete-and-earn](https://github.com/EesunMoon/leetcode/tree/master/0740-delete-and-earn) |\n| [0747-min-cost-climbing-stairs](https://github.com/EesunMoon/leetcode/tree/master/0747-min-cost-climbing-stairs) |\n| [0803-cheapest-flights-within-k-stops](https://github.com/EesunMoon/leetcode/tree/master/0803-cheapest-flights-within-k-stops) |\n| [0943-sum-of-subarray-minimums](https://github.com/EesunMoon/leetcode/tree/master/0943-sum-of-subarray-minimums) |\n| [1013-fibonacci-number](https://github.com/EesunMoon/leetcode/tree/master/1013-fibonacci-number) |\n| [1236-n-th-tribonacci-number](https://github.com/EesunMoon/leetcode/tree/master/1236-n-th-tribonacci-number) |\n| [1250-longest-common-subsequence](https://github.com/EesunMoon/leetcode/tree/master/1250-longest-common-subsequence) |\n## Two Pointers\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/EesunMoon/leetcode/tree/master/0005-longest-palindromic-substring) |\n| [0011-container-with-most-water](https://github.com/EesunMoon/leetcode/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/EesunMoon/leetcode/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/EesunMoon/leetcode/tree/master/0018-4sum) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/EesunMoon/leetcode/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/EesunMoon/leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/EesunMoon/leetcode/tree/master/0027-remove-element) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/EesunMoon/leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0042-trapping-rain-water](https://github.com/EesunMoon/leetcode/tree/master/0042-trapping-rain-water) |\n| [0061-rotate-list](https://github.com/EesunMoon/leetcode/tree/master/0061-rotate-list) |\n| [0075-sort-colors](https://github.com/EesunMoon/leetcode/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/EesunMoon/leetcode/tree/master/0088-merge-sorted-array) |\n| [0125-valid-palindrome](https://github.com/EesunMoon/leetcode/tree/master/0125-valid-palindrome) |\n| [0141-linked-list-cycle](https://github.com/EesunMoon/leetcode/tree/master/0141-linked-list-cycle) |\n| [0143-reorder-list](https://github.com/EesunMoon/leetcode/tree/master/0143-reorder-list) |\n| [0148-sort-list](https://github.com/EesunMoon/leetcode/tree/master/0148-sort-list) |\n| [0151-reverse-words-in-a-string](https://github.com/EesunMoon/leetcode/tree/master/0151-reverse-words-in-a-string) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/EesunMoon/leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0189-rotate-array](https://github.com/EesunMoon/leetcode/tree/master/0189-rotate-array) |\n| [0202-happy-number](https://github.com/EesunMoon/leetcode/tree/master/0202-happy-number) |\n| [0234-palindrome-linked-list](https://github.com/EesunMoon/leetcode/tree/master/0234-palindrome-linked-list) |\n| [0253-meeting-rooms-ii](https://github.com/EesunMoon/leetcode/tree/master/0253-meeting-rooms-ii) |\n| [0283-move-zeroes](https://github.com/EesunMoon/leetcode/tree/master/0283-move-zeroes) |\n| [0287-find-the-duplicate-number](https://github.com/EesunMoon/leetcode/tree/master/0287-find-the-duplicate-number) |\n| [0295-find-median-from-data-stream](https://github.com/EesunMoon/leetcode/tree/master/0295-find-median-from-data-stream) |\n| [0344-reverse-string](https://github.com/EesunMoon/leetcode/tree/master/0344-reverse-string) |\n| [0349-intersection-of-two-arrays](https://github.com/EesunMoon/leetcode/tree/master/0349-intersection-of-two-arrays) |\n| [0392-is-subsequence](https://github.com/EesunMoon/leetcode/tree/master/0392-is-subsequence) |\n| [0443-string-compression](https://github.com/EesunMoon/leetcode/tree/master/0443-string-compression) |\n| [0567-permutation-in-string](https://github.com/EesunMoon/leetcode/tree/master/0567-permutation-in-string) |\n| [0647-palindromic-substrings](https://github.com/EesunMoon/leetcode/tree/master/0647-palindromic-substrings) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0768-partition-labels](https://github.com/EesunMoon/leetcode/tree/master/0768-partition-labels) |\n| [0827-expressive-words](https://github.com/EesunMoon/leetcode/tree/master/0827-expressive-words) |\n| [0874-backspace-string-compare](https://github.com/EesunMoon/leetcode/tree/master/0874-backspace-string-compare) |\n| [0908-middle-of-the-linked-list](https://github.com/EesunMoon/leetcode/tree/master/0908-middle-of-the-linked-list) |\n| [0961-long-pressed-name](https://github.com/EesunMoon/leetcode/tree/master/0961-long-pressed-name) |\n| [1002-maximum-width-ramp](https://github.com/EesunMoon/leetcode/tree/master/1002-maximum-width-ramp) |\n| [1009-pancake-sorting](https://github.com/EesunMoon/leetcode/tree/master/1009-pancake-sorting) |\n| [1150-two-sum-bsts](https://github.com/EesunMoon/leetcode/tree/master/1150-two-sum-bsts) |\n| [1790-lowest-common-ancestor-of-a-binary-tree-iii](https://github.com/EesunMoon/leetcode/tree/master/1790-lowest-common-ancestor-of-a-binary-tree-iii) |\n| [1894-merge-strings-alternately](https://github.com/EesunMoon/leetcode/tree/master/1894-merge-strings-alternately) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/EesunMoon/leetcode/tree/master/2271-rearrange-array-elements-by-sign) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/EesunMoon/leetcode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0005-longest-palindromic-substring](https://github.com/EesunMoon/leetcode/tree/master/0005-longest-palindromic-substring) |\n| [0006-zigzag-conversion](https://github.com/EesunMoon/leetcode/tree/master/0006-zigzag-conversion) |\n| [0013-roman-to-integer](https://github.com/EesunMoon/leetcode/tree/master/0013-roman-to-integer) |\n| [0014-longest-common-prefix](https://github.com/EesunMoon/leetcode/tree/master/0014-longest-common-prefix) |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/EesunMoon/leetcode/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0020-valid-parentheses](https://github.com/EesunMoon/leetcode/tree/master/0020-valid-parentheses) |\n| [0022-generate-parentheses](https://github.com/EesunMoon/leetcode/tree/master/0022-generate-parentheses) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/EesunMoon/leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0032-longest-valid-parentheses](https://github.com/EesunMoon/leetcode/tree/master/0032-longest-valid-parentheses) |\n| [0043-multiply-strings](https://github.com/EesunMoon/leetcode/tree/master/0043-multiply-strings) |\n| [0049-group-anagrams](https://github.com/EesunMoon/leetcode/tree/master/0049-group-anagrams) |\n| [0058-length-of-last-word](https://github.com/EesunMoon/leetcode/tree/master/0058-length-of-last-word) |\n| [0067-add-binary](https://github.com/EesunMoon/leetcode/tree/master/0067-add-binary) |\n| [0072-edit-distance](https://github.com/EesunMoon/leetcode/tree/master/0072-edit-distance) |\n| [0076-minimum-window-substring](https://github.com/EesunMoon/leetcode/tree/master/0076-minimum-window-substring) |\n| [0079-word-search](https://github.com/EesunMoon/leetcode/tree/master/0079-word-search) |\n| [0091-decode-ways](https://github.com/EesunMoon/leetcode/tree/master/0091-decode-ways) |\n| [0097-interleaving-string](https://github.com/EesunMoon/leetcode/tree/master/0097-interleaving-string) |\n| [0115-distinct-subsequences](https://github.com/EesunMoon/leetcode/tree/master/0115-distinct-subsequences) |\n| [0125-valid-palindrome](https://github.com/EesunMoon/leetcode/tree/master/0125-valid-palindrome) |\n| [0127-word-ladder](https://github.com/EesunMoon/leetcode/tree/master/0127-word-ladder) |\n| [0131-palindrome-partitioning](https://github.com/EesunMoon/leetcode/tree/master/0131-palindrome-partitioning) |\n| [0139-word-break](https://github.com/EesunMoon/leetcode/tree/master/0139-word-break) |\n| [0151-reverse-words-in-a-string](https://github.com/EesunMoon/leetcode/tree/master/0151-reverse-words-in-a-string) |\n| [0187-repeated-dna-sequences](https://github.com/EesunMoon/leetcode/tree/master/0187-repeated-dna-sequences) |\n| [0205-isomorphic-strings](https://github.com/EesunMoon/leetcode/tree/master/0205-isomorphic-strings) |\n| [0208-implement-trie-prefix-tree](https://github.com/EesunMoon/leetcode/tree/master/0208-implement-trie-prefix-tree) |\n| [0211-design-add-and-search-words-data-structure](https://github.com/EesunMoon/leetcode/tree/master/0211-design-add-and-search-words-data-structure) |\n| [0212-word-search-ii](https://github.com/EesunMoon/leetcode/tree/master/0212-word-search-ii) |\n| [0227-basic-calculator-ii](https://github.com/EesunMoon/leetcode/tree/master/0227-basic-calculator-ii) |\n| [0242-valid-anagram](https://github.com/EesunMoon/leetcode/tree/master/0242-valid-anagram) |\n| [0269-alien-dictionary](https://github.com/EesunMoon/leetcode/tree/master/0269-alien-dictionary) |\n| [0271-encode-and-decode-strings](https://github.com/EesunMoon/leetcode/tree/master/0271-encode-and-decode-strings) |\n| [0290-word-pattern](https://github.com/EesunMoon/leetcode/tree/master/0290-word-pattern) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0344-reverse-string](https://github.com/EesunMoon/leetcode/tree/master/0344-reverse-string) |\n| [0387-first-unique-character-in-a-string](https://github.com/EesunMoon/leetcode/tree/master/0387-first-unique-character-in-a-string) |\n| [0392-is-subsequence](https://github.com/EesunMoon/leetcode/tree/master/0392-is-subsequence) |\n| [0394-decode-string](https://github.com/EesunMoon/leetcode/tree/master/0394-decode-string) |\n| [0424-longest-repeating-character-replacement](https://github.com/EesunMoon/leetcode/tree/master/0424-longest-repeating-character-replacement) |\n| [0443-string-compression](https://github.com/EesunMoon/leetcode/tree/master/0443-string-compression) |\n| [0451-sort-characters-by-frequency](https://github.com/EesunMoon/leetcode/tree/master/0451-sort-characters-by-frequency) |\n| [0567-permutation-in-string](https://github.com/EesunMoon/leetcode/tree/master/0567-permutation-in-string) |\n| [0647-palindromic-substrings](https://github.com/EesunMoon/leetcode/tree/master/0647-palindromic-substrings) |\n| [0678-valid-parenthesis-string](https://github.com/EesunMoon/leetcode/tree/master/0678-valid-parenthesis-string) |\n| [0721-accounts-merge](https://github.com/EesunMoon/leetcode/tree/master/0721-accounts-merge) |\n| [0753-open-the-lock](https://github.com/EesunMoon/leetcode/tree/master/0753-open-the-lock) |\n| [0768-partition-labels](https://github.com/EesunMoon/leetcode/tree/master/0768-partition-labels) |\n| [0778-reorganize-string](https://github.com/EesunMoon/leetcode/tree/master/0778-reorganize-string) |\n| [0827-expressive-words](https://github.com/EesunMoon/leetcode/tree/master/0827-expressive-words) |\n| [0874-backspace-string-compare](https://github.com/EesunMoon/leetcode/tree/master/0874-backspace-string-compare) |\n| [0961-long-pressed-name](https://github.com/EesunMoon/leetcode/tree/master/0961-long-pressed-name) |\n| [0965-unique-email-addresses](https://github.com/EesunMoon/leetcode/tree/master/0965-unique-email-addresses) |\n| [1023-time-based-key-value-store](https://github.com/EesunMoon/leetcode/tree/master/1023-time-based-key-value-store) |\n| [1119-robot-bounded-in-circle](https://github.com/EesunMoon/leetcode/tree/master/1119-robot-bounded-in-circle) |\n| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/EesunMoon/leetcode/tree/master/1128-remove-all-adjacent-duplicates-in-string) |\n| [1250-longest-common-subsequence](https://github.com/EesunMoon/leetcode/tree/master/1250-longest-common-subsequence) |\n| [1274-number-of-days-between-two-dates](https://github.com/EesunMoon/leetcode/tree/master/1274-number-of-days-between-two-dates) |\n| [1320-remove-all-adjacent-duplicates-in-string-ii](https://github.com/EesunMoon/leetcode/tree/master/1320-remove-all-adjacent-duplicates-in-string-ii) |\n| [1838-number-of-distinct-substrings-in-a-string](https://github.com/EesunMoon/leetcode/tree/master/1838-number-of-distinct-substrings-in-a-string) |\n| [1894-merge-strings-alternately](https://github.com/EesunMoon/leetcode/tree/master/1894-merge-strings-alternately) |\n| [2021-remove-all-occurrences-of-a-substring](https://github.com/EesunMoon/leetcode/tree/master/2021-remove-all-occurrences-of-a-substring) |\n| [2165-plates-between-candles](https://github.com/EesunMoon/leetcode/tree/master/2165-plates-between-candles) |\n| [2629-number-of-substrings-with-fixed-ratio](https://github.com/EesunMoon/leetcode/tree/master/2629-number-of-substrings-with-fixed-ratio) |\n| [3684-substring-matching-pattern](https://github.com/EesunMoon/leetcode/tree/master/3684-substring-matching-pattern) |\n## String Matching\n|  |\n| ------- |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/EesunMoon/leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0572-subtree-of-another-tree](https://github.com/EesunMoon/leetcode/tree/master/0572-subtree-of-another-tree) |\n| [3684-substring-matching-pattern](https://github.com/EesunMoon/leetcode/tree/master/3684-substring-matching-pattern) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/EesunMoon/leetcode/tree/master/0014-longest-common-prefix) |\n| [0139-word-break](https://github.com/EesunMoon/leetcode/tree/master/0139-word-break) |\n| [0208-implement-trie-prefix-tree](https://github.com/EesunMoon/leetcode/tree/master/0208-implement-trie-prefix-tree) |\n| [0211-design-add-and-search-words-data-structure](https://github.com/EesunMoon/leetcode/tree/master/0211-design-add-and-search-words-data-structure) |\n| [0212-word-search-ii](https://github.com/EesunMoon/leetcode/tree/master/0212-word-search-ii) |\n| [1838-number-of-distinct-substrings-in-a-string](https://github.com/EesunMoon/leetcode/tree/master/1838-number-of-distinct-substrings-in-a-string) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/EesunMoon/leetcode/tree/master/0001-two-sum) |\n| [0003-longest-substring-without-repeating-characters](https://github.com/EesunMoon/leetcode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0013-roman-to-integer](https://github.com/EesunMoon/leetcode/tree/master/0013-roman-to-integer) |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/EesunMoon/leetcode/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0036-valid-sudoku](https://github.com/EesunMoon/leetcode/tree/master/0036-valid-sudoku) |\n| [0049-group-anagrams](https://github.com/EesunMoon/leetcode/tree/master/0049-group-anagrams) |\n| [0073-set-matrix-zeroes](https://github.com/EesunMoon/leetcode/tree/master/0073-set-matrix-zeroes) |\n| [0076-minimum-window-substring](https://github.com/EesunMoon/leetcode/tree/master/0076-minimum-window-substring) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/EesunMoon/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0127-word-ladder](https://github.com/EesunMoon/leetcode/tree/master/0127-word-ladder) |\n| [0128-longest-consecutive-sequence](https://github.com/EesunMoon/leetcode/tree/master/0128-longest-consecutive-sequence) |\n| [0133-clone-graph](https://github.com/EesunMoon/leetcode/tree/master/0133-clone-graph) |\n| [0138-copy-list-with-random-pointer](https://github.com/EesunMoon/leetcode/tree/master/0138-copy-list-with-random-pointer) |\n| [0139-word-break](https://github.com/EesunMoon/leetcode/tree/master/0139-word-break) |\n| [0141-linked-list-cycle](https://github.com/EesunMoon/leetcode/tree/master/0141-linked-list-cycle) |\n| [0146-lru-cache](https://github.com/EesunMoon/leetcode/tree/master/0146-lru-cache) |\n| [0169-majority-element](https://github.com/EesunMoon/leetcode/tree/master/0169-majority-element) |\n| [0187-repeated-dna-sequences](https://github.com/EesunMoon/leetcode/tree/master/0187-repeated-dna-sequences) |\n| [0202-happy-number](https://github.com/EesunMoon/leetcode/tree/master/0202-happy-number) |\n| [0205-isomorphic-strings](https://github.com/EesunMoon/leetcode/tree/master/0205-isomorphic-strings) |\n| [0208-implement-trie-prefix-tree](https://github.com/EesunMoon/leetcode/tree/master/0208-implement-trie-prefix-tree) |\n| [0217-contains-duplicate](https://github.com/EesunMoon/leetcode/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/EesunMoon/leetcode/tree/master/0242-valid-anagram) |\n| [0268-missing-number](https://github.com/EesunMoon/leetcode/tree/master/0268-missing-number) |\n| [0290-word-pattern](https://github.com/EesunMoon/leetcode/tree/master/0290-word-pattern) |\n| [0314-binary-tree-vertical-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0314-binary-tree-vertical-order-traversal) |\n| [0347-top-k-frequent-elements](https://github.com/EesunMoon/leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0349-intersection-of-two-arrays](https://github.com/EesunMoon/leetcode/tree/master/0349-intersection-of-two-arrays) |\n| [0355-design-twitter](https://github.com/EesunMoon/leetcode/tree/master/0355-design-twitter) |\n| [0359-logger-rate-limiter](https://github.com/EesunMoon/leetcode/tree/master/0359-logger-rate-limiter) |\n| [0380-insert-delete-getrandom-o1](https://github.com/EesunMoon/leetcode/tree/master/0380-insert-delete-getrandom-o1) |\n| [0387-first-unique-character-in-a-string](https://github.com/EesunMoon/leetcode/tree/master/0387-first-unique-character-in-a-string) |\n| [0424-longest-repeating-character-replacement](https://github.com/EesunMoon/leetcode/tree/master/0424-longest-repeating-character-replacement) |\n| [0451-sort-characters-by-frequency](https://github.com/EesunMoon/leetcode/tree/master/0451-sort-characters-by-frequency) |\n| [0460-lfu-cache](https://github.com/EesunMoon/leetcode/tree/master/0460-lfu-cache) |\n| [0491-non-decreasing-subsequences](https://github.com/EesunMoon/leetcode/tree/master/0491-non-decreasing-subsequences) |\n| [0496-next-greater-element-i](https://github.com/EesunMoon/leetcode/tree/master/0496-next-greater-element-i) |\n| [0525-contiguous-array](https://github.com/EesunMoon/leetcode/tree/master/0525-contiguous-array) |\n| [0560-subarray-sum-equals-k](https://github.com/EesunMoon/leetcode/tree/master/0560-subarray-sum-equals-k) |\n| [0567-permutation-in-string](https://github.com/EesunMoon/leetcode/tree/master/0567-permutation-in-string) |\n| [0621-task-scheduler](https://github.com/EesunMoon/leetcode/tree/master/0621-task-scheduler) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0721-accounts-merge](https://github.com/EesunMoon/leetcode/tree/master/0721-accounts-merge) |\n| [0740-delete-and-earn](https://github.com/EesunMoon/leetcode/tree/master/0740-delete-and-earn) |\n| [0753-open-the-lock](https://github.com/EesunMoon/leetcode/tree/master/0753-open-the-lock) |\n| [0768-partition-labels](https://github.com/EesunMoon/leetcode/tree/master/0768-partition-labels) |\n| [0778-reorganize-string](https://github.com/EesunMoon/leetcode/tree/master/0778-reorganize-string) |\n| [0817-design-hashmap](https://github.com/EesunMoon/leetcode/tree/master/0817-design-hashmap) |\n| [0876-hand-of-straights](https://github.com/EesunMoon/leetcode/tree/master/0876-hand-of-straights) |\n| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0893-all-nodes-distance-k-in-binary-tree) |\n| [0965-unique-email-addresses](https://github.com/EesunMoon/leetcode/tree/master/0965-unique-email-addresses) |\n| [1023-time-based-key-value-store](https://github.com/EesunMoon/leetcode/tree/master/1023-time-based-key-value-store) |\n| [1108-analyze-user-website-visit-pattern](https://github.com/EesunMoon/leetcode/tree/master/1108-analyze-user-website-visit-pattern) |\n| [1249-snapshot-array](https://github.com/EesunMoon/leetcode/tree/master/1249-snapshot-array) |\n| [1256-rank-transform-of-an-array](https://github.com/EesunMoon/leetcode/tree/master/1256-rank-transform-of-an-array) |\n| [1790-lowest-common-ancestor-of-a-binary-tree-iii](https://github.com/EesunMoon/leetcode/tree/master/1790-lowest-common-ancestor-of-a-binary-tree-iii) |\n| [2139-detect-squares](https://github.com/EesunMoon/leetcode/tree/master/2139-detect-squares) |\n| [2436-make-array-zero-by-subtracting-equal-amounts](https://github.com/EesunMoon/leetcode/tree/master/2436-make-array-zero-by-subtracting-equal-amounts) |\n| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/EesunMoon/leetcode/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |\n| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/EesunMoon/leetcode/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |\n| [2548-destroy-sequential-targets](https://github.com/EesunMoon/leetcode/tree/master/2548-destroy-sequential-targets) |\n| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/EesunMoon/leetcode/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |\n| [2629-number-of-substrings-with-fixed-ratio](https://github.com/EesunMoon/leetcode/tree/master/2629-number-of-substrings-with-fixed-ratio) |\n| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/EesunMoon/leetcode/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |\n| [3594-identify-the-largest-outlier-in-an-array](https://github.com/EesunMoon/leetcode/tree/master/3594-identify-the-largest-outlier-in-an-array) |\n| [3656-minimum-number-of-operations-to-make-elements-in-array-distinct](https://github.com/EesunMoon/leetcode/tree/master/3656-minimum-number-of-operations-to-make-elements-in-array-distinct) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/EesunMoon/leetcode/tree/master/0002-add-two-numbers) |\n| [0007-reverse-integer](https://github.com/EesunMoon/leetcode/tree/master/0007-reverse-integer) |\n| [0009-palindrome-number](https://github.com/EesunMoon/leetcode/tree/master/0009-palindrome-number) |\n| [0013-roman-to-integer](https://github.com/EesunMoon/leetcode/tree/master/0013-roman-to-integer) |\n| [0043-multiply-strings](https://github.com/EesunMoon/leetcode/tree/master/0043-multiply-strings) |\n| [0048-rotate-image](https://github.com/EesunMoon/leetcode/tree/master/0048-rotate-image) |\n| [0050-powx-n](https://github.com/EesunMoon/leetcode/tree/master/0050-powx-n) |\n| [0062-unique-paths](https://github.com/EesunMoon/leetcode/tree/master/0062-unique-paths) |\n| [0066-plus-one](https://github.com/EesunMoon/leetcode/tree/master/0066-plus-one) |\n| [0067-add-binary](https://github.com/EesunMoon/leetcode/tree/master/0067-add-binary) |\n| [0069-sqrtx](https://github.com/EesunMoon/leetcode/tree/master/0069-sqrtx) |\n| [0070-climbing-stairs](https://github.com/EesunMoon/leetcode/tree/master/0070-climbing-stairs) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/EesunMoon/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0189-rotate-array](https://github.com/EesunMoon/leetcode/tree/master/0189-rotate-array) |\n| [0202-happy-number](https://github.com/EesunMoon/leetcode/tree/master/0202-happy-number) |\n| [0227-basic-calculator-ii](https://github.com/EesunMoon/leetcode/tree/master/0227-basic-calculator-ii) |\n| [0268-missing-number](https://github.com/EesunMoon/leetcode/tree/master/0268-missing-number) |\n| [0279-perfect-squares](https://github.com/EesunMoon/leetcode/tree/master/0279-perfect-squares) |\n| [0371-sum-of-two-integers](https://github.com/EesunMoon/leetcode/tree/master/0371-sum-of-two-integers) |\n| [0380-insert-delete-getrandom-o1](https://github.com/EesunMoon/leetcode/tree/master/0380-insert-delete-getrandom-o1) |\n| [0628-maximum-product-of-three-numbers](https://github.com/EesunMoon/leetcode/tree/master/0628-maximum-product-of-three-numbers) |\n| [0912-random-pick-with-weight](https://github.com/EesunMoon/leetcode/tree/master/0912-random-pick-with-weight) |\n| [1013-fibonacci-number](https://github.com/EesunMoon/leetcode/tree/master/1013-fibonacci-number) |\n| [1014-k-closest-points-to-origin](https://github.com/EesunMoon/leetcode/tree/master/1014-k-closest-points-to-origin) |\n| [1094-matrix-cells-in-distance-order](https://github.com/EesunMoon/leetcode/tree/master/1094-matrix-cells-in-distance-order) |\n| [1119-robot-bounded-in-circle](https://github.com/EesunMoon/leetcode/tree/master/1119-robot-bounded-in-circle) |\n| [1236-n-th-tribonacci-number](https://github.com/EesunMoon/leetcode/tree/master/1236-n-th-tribonacci-number) |\n| [1274-number-of-days-between-two-dates](https://github.com/EesunMoon/leetcode/tree/master/1274-number-of-days-between-two-dates) |\n| [1585-the-kth-factor-of-n](https://github.com/EesunMoon/leetcode/tree/master/1585-the-kth-factor-of-n) |\n| [2279-maximum-split-of-positive-even-integers](https://github.com/EesunMoon/leetcode/tree/master/2279-maximum-split-of-positive-even-integers) |\n| [2383-add-two-integers](https://github.com/EesunMoon/leetcode/tree/master/2383-add-two-integers) |\n| [2629-number-of-substrings-with-fixed-ratio](https://github.com/EesunMoon/leetcode/tree/master/2629-number-of-substrings-with-fixed-ratio) |\n| [2663-distribute-money-to-maximum-children](https://github.com/EesunMoon/leetcode/tree/master/2663-distribute-money-to-maximum-children) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/EesunMoon/leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0098-validate-binary-search-tree) |\n| [0099-recover-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0099-recover-binary-search-tree) |\n| [0100-same-tree](https://github.com/EesunMoon/leetcode/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/EesunMoon/leetcode/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/EesunMoon/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/EesunMoon/leetcode/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0110-balanced-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0110-balanced-binary-tree) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/EesunMoon/leetcode/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0173-binary-search-tree-iterator](https://github.com/EesunMoon/leetcode/tree/master/0173-binary-search-tree-iterator) |\n| [0199-binary-tree-right-side-view](https://github.com/EesunMoon/leetcode/tree/master/0199-binary-tree-right-side-view) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0285-inorder-successor-in-bst](https://github.com/EesunMoon/leetcode/tree/master/0285-inorder-successor-in-bst) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0314-binary-tree-vertical-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0314-binary-tree-vertical-order-traversal) |\n| [0341-flatten-nested-list-iterator](https://github.com/EesunMoon/leetcode/tree/master/0341-flatten-nested-list-iterator) |\n| [0450-delete-node-in-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0450-delete-node-in-a-bst) |\n| [0530-minimum-absolute-difference-in-bst](https://github.com/EesunMoon/leetcode/tree/master/0530-minimum-absolute-difference-in-bst) |\n| [0543-diameter-of-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0543-diameter-of-binary-tree) |\n| [0572-subtree-of-another-tree](https://github.com/EesunMoon/leetcode/tree/master/0572-subtree-of-another-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0783-search-in-a-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0783-search-in-a-binary-search-tree) |\n| [0784-insert-into-a-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0784-insert-into-a-binary-search-tree) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/EesunMoon/leetcode/tree/master/0789-kth-largest-element-in-a-stream) |\n| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0893-all-nodes-distance-k-in-binary-tree) |\n| [1035-cousins-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/1035-cousins-in-binary-tree) |\n| [1150-two-sum-bsts](https://github.com/EesunMoon/leetcode/tree/master/1150-two-sum-bsts) |\n| [1544-count-good-nodes-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/1544-count-good-nodes-in-binary-tree) |\n| [1790-lowest-common-ancestor-of-a-binary-tree-iii](https://github.com/EesunMoon/leetcode/tree/master/1790-lowest-common-ancestor-of-a-binary-tree-iii) |\n| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/EesunMoon/leetcode/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |\n## Depth-First Search\n|  |\n| ------- |\n| [0079-word-search](https://github.com/EesunMoon/leetcode/tree/master/0079-word-search) |\n| [0094-binary-tree-inorder-traversal](https://github.com/EesunMoon/leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0098-validate-binary-search-tree) |\n| [0099-recover-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0099-recover-binary-search-tree) |\n| [0100-same-tree](https://github.com/EesunMoon/leetcode/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/EesunMoon/leetcode/tree/master/0101-symmetric-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0110-balanced-binary-tree) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/EesunMoon/leetcode/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0130-surrounded-regions](https://github.com/EesunMoon/leetcode/tree/master/0130-surrounded-regions) |\n| [0133-clone-graph](https://github.com/EesunMoon/leetcode/tree/master/0133-clone-graph) |\n| [0199-binary-tree-right-side-view](https://github.com/EesunMoon/leetcode/tree/master/0199-binary-tree-right-side-view) |\n| [0200-number-of-islands](https://github.com/EesunMoon/leetcode/tree/master/0200-number-of-islands) |\n| [0207-course-schedule](https://github.com/EesunMoon/leetcode/tree/master/0207-course-schedule) |\n| [0210-course-schedule-ii](https://github.com/EesunMoon/leetcode/tree/master/0210-course-schedule-ii) |\n| [0211-design-add-and-search-words-data-structure](https://github.com/EesunMoon/leetcode/tree/master/0211-design-add-and-search-words-data-structure) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0261-graph-valid-tree](https://github.com/EesunMoon/leetcode/tree/master/0261-graph-valid-tree) |\n| [0269-alien-dictionary](https://github.com/EesunMoon/leetcode/tree/master/0269-alien-dictionary) |\n| [0285-inorder-successor-in-bst](https://github.com/EesunMoon/leetcode/tree/master/0285-inorder-successor-in-bst) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0314-binary-tree-vertical-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0314-binary-tree-vertical-order-traversal) |\n| [0323-number-of-connected-components-in-an-undirected-graph](https://github.com/EesunMoon/leetcode/tree/master/0323-number-of-connected-components-in-an-undirected-graph) |\n| [0329-longest-increasing-path-in-a-matrix](https://github.com/EesunMoon/leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |\n| [0332-reconstruct-itinerary](https://github.com/EesunMoon/leetcode/tree/master/0332-reconstruct-itinerary) |\n| [0341-flatten-nested-list-iterator](https://github.com/EesunMoon/leetcode/tree/master/0341-flatten-nested-list-iterator) |\n| [0417-pacific-atlantic-water-flow](https://github.com/EesunMoon/leetcode/tree/master/0417-pacific-atlantic-water-flow) |\n| [0530-minimum-absolute-difference-in-bst](https://github.com/EesunMoon/leetcode/tree/master/0530-minimum-absolute-difference-in-bst) |\n| [0543-diameter-of-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0543-diameter-of-binary-tree) |\n| [0547-number-of-provinces](https://github.com/EesunMoon/leetcode/tree/master/0547-number-of-provinces) |\n| [0572-subtree-of-another-tree](https://github.com/EesunMoon/leetcode/tree/master/0572-subtree-of-another-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0684-redundant-connection](https://github.com/EesunMoon/leetcode/tree/master/0684-redundant-connection) |\n| [0695-max-area-of-island](https://github.com/EesunMoon/leetcode/tree/master/0695-max-area-of-island) |\n| [0721-accounts-merge](https://github.com/EesunMoon/leetcode/tree/master/0721-accounts-merge) |\n| [0744-network-delay-time](https://github.com/EesunMoon/leetcode/tree/master/0744-network-delay-time) |\n| [0794-swim-in-rising-water](https://github.com/EesunMoon/leetcode/tree/master/0794-swim-in-rising-water) |\n| [0803-cheapest-flights-within-k-stops](https://github.com/EesunMoon/leetcode/tree/master/0803-cheapest-flights-within-k-stops) |\n| [0813-all-paths-from-source-to-target](https://github.com/EesunMoon/leetcode/tree/master/0813-all-paths-from-source-to-target) |\n| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0893-all-nodes-distance-k-in-binary-tree) |\n| [1035-cousins-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/1035-cousins-in-binary-tree) |\n| [1150-two-sum-bsts](https://github.com/EesunMoon/leetcode/tree/master/1150-two-sum-bsts) |\n| [1396-count-servers-that-communicate](https://github.com/EesunMoon/leetcode/tree/master/1396-count-servers-that-communicate) |\n| [1442-number-of-operations-to-make-network-connected](https://github.com/EesunMoon/leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |\n| [1544-count-good-nodes-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/1544-count-good-nodes-in-binary-tree) |\n| [1558-course-schedule-iv](https://github.com/EesunMoon/leetcode/tree/master/1558-course-schedule-iv) |\n| [1753-path-with-minimum-effort](https://github.com/EesunMoon/leetcode/tree/master/1753-path-with-minimum-effort) |\n| [2121-find-if-path-exists-in-graph](https://github.com/EesunMoon/leetcode/tree/master/2121-find-if-path-exists-in-graph) |\n| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/EesunMoon/leetcode/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/EesunMoon/leetcode/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/EesunMoon/leetcode/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/EesunMoon/leetcode/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0127-word-ladder](https://github.com/EesunMoon/leetcode/tree/master/0127-word-ladder) |\n| [0130-surrounded-regions](https://github.com/EesunMoon/leetcode/tree/master/0130-surrounded-regions) |\n| [0133-clone-graph](https://github.com/EesunMoon/leetcode/tree/master/0133-clone-graph) |\n| [0199-binary-tree-right-side-view](https://github.com/EesunMoon/leetcode/tree/master/0199-binary-tree-right-side-view) |\n| [0200-number-of-islands](https://github.com/EesunMoon/leetcode/tree/master/0200-number-of-islands) |\n| [0207-course-schedule](https://github.com/EesunMoon/leetcode/tree/master/0207-course-schedule) |\n| [0210-course-schedule-ii](https://github.com/EesunMoon/leetcode/tree/master/0210-course-schedule-ii) |\n| [0261-graph-valid-tree](https://github.com/EesunMoon/leetcode/tree/master/0261-graph-valid-tree) |\n| [0269-alien-dictionary](https://github.com/EesunMoon/leetcode/tree/master/0269-alien-dictionary) |\n| [0279-perfect-squares](https://github.com/EesunMoon/leetcode/tree/master/0279-perfect-squares) |\n| [0286-walls-and-gates](https://github.com/EesunMoon/leetcode/tree/master/0286-walls-and-gates) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0314-binary-tree-vertical-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0314-binary-tree-vertical-order-traversal) |\n| [0322-coin-change](https://github.com/EesunMoon/leetcode/tree/master/0322-coin-change) |\n| [0323-number-of-connected-components-in-an-undirected-graph](https://github.com/EesunMoon/leetcode/tree/master/0323-number-of-connected-components-in-an-undirected-graph) |\n| [0329-longest-increasing-path-in-a-matrix](https://github.com/EesunMoon/leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |\n| [0417-pacific-atlantic-water-flow](https://github.com/EesunMoon/leetcode/tree/master/0417-pacific-atlantic-water-flow) |\n| [0530-minimum-absolute-difference-in-bst](https://github.com/EesunMoon/leetcode/tree/master/0530-minimum-absolute-difference-in-bst) |\n| [0542-01-matrix](https://github.com/EesunMoon/leetcode/tree/master/0542-01-matrix) |\n| [0547-number-of-provinces](https://github.com/EesunMoon/leetcode/tree/master/0547-number-of-provinces) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0684-redundant-connection](https://github.com/EesunMoon/leetcode/tree/master/0684-redundant-connection) |\n| [0695-max-area-of-island](https://github.com/EesunMoon/leetcode/tree/master/0695-max-area-of-island) |\n| [0721-accounts-merge](https://github.com/EesunMoon/leetcode/tree/master/0721-accounts-merge) |\n| [0744-network-delay-time](https://github.com/EesunMoon/leetcode/tree/master/0744-network-delay-time) |\n| [0753-open-the-lock](https://github.com/EesunMoon/leetcode/tree/master/0753-open-the-lock) |\n| [0794-swim-in-rising-water](https://github.com/EesunMoon/leetcode/tree/master/0794-swim-in-rising-water) |\n| [0803-cheapest-flights-within-k-stops](https://github.com/EesunMoon/leetcode/tree/master/0803-cheapest-flights-within-k-stops) |\n| [0813-all-paths-from-source-to-target](https://github.com/EesunMoon/leetcode/tree/master/0813-all-paths-from-source-to-target) |\n| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0893-all-nodes-distance-k-in-binary-tree) |\n| [1035-cousins-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/1035-cousins-in-binary-tree) |\n| [1036-rotting-oranges](https://github.com/EesunMoon/leetcode/tree/master/1036-rotting-oranges) |\n| [1396-count-servers-that-communicate](https://github.com/EesunMoon/leetcode/tree/master/1396-count-servers-that-communicate) |\n| [1442-number-of-operations-to-make-network-connected](https://github.com/EesunMoon/leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |\n| [1544-count-good-nodes-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/1544-count-good-nodes-in-binary-tree) |\n| [1558-course-schedule-iv](https://github.com/EesunMoon/leetcode/tree/master/1558-course-schedule-iv) |\n| [1753-path-with-minimum-effort](https://github.com/EesunMoon/leetcode/tree/master/1753-path-with-minimum-effort) |\n| [2121-find-if-path-exists-in-graph](https://github.com/EesunMoon/leetcode/tree/master/2121-find-if-path-exists-in-graph) |\n| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/EesunMoon/leetcode/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0098-validate-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0098-validate-binary-search-tree) |\n| [0099-recover-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0099-recover-binary-search-tree) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0173-binary-search-tree-iterator](https://github.com/EesunMoon/leetcode/tree/master/0173-binary-search-tree-iterator) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0285-inorder-successor-in-bst](https://github.com/EesunMoon/leetcode/tree/master/0285-inorder-successor-in-bst) |\n| [0450-delete-node-in-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0450-delete-node-in-a-bst) |\n| [0530-minimum-absolute-difference-in-bst](https://github.com/EesunMoon/leetcode/tree/master/0530-minimum-absolute-difference-in-bst) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0783-search-in-a-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0783-search-in-a-binary-search-tree) |\n| [0784-insert-into-a-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0784-insert-into-a-binary-search-tree) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/EesunMoon/leetcode/tree/master/0789-kth-largest-element-in-a-stream) |\n| [1150-two-sum-bsts](https://github.com/EesunMoon/leetcode/tree/master/1150-two-sum-bsts) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/EesunMoon/leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0098-validate-binary-search-tree) |\n| [0099-recover-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0099-recover-binary-search-tree) |\n| [0100-same-tree](https://github.com/EesunMoon/leetcode/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/EesunMoon/leetcode/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/EesunMoon/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/EesunMoon/leetcode/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0110-balanced-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0110-balanced-binary-tree) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/EesunMoon/leetcode/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0173-binary-search-tree-iterator](https://github.com/EesunMoon/leetcode/tree/master/0173-binary-search-tree-iterator) |\n| [0199-binary-tree-right-side-view](https://github.com/EesunMoon/leetcode/tree/master/0199-binary-tree-right-side-view) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0285-inorder-successor-in-bst](https://github.com/EesunMoon/leetcode/tree/master/0285-inorder-successor-in-bst) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0314-binary-tree-vertical-order-traversal](https://github.com/EesunMoon/leetcode/tree/master/0314-binary-tree-vertical-order-traversal) |\n| [0450-delete-node-in-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0450-delete-node-in-a-bst) |\n| [0530-minimum-absolute-difference-in-bst](https://github.com/EesunMoon/leetcode/tree/master/0530-minimum-absolute-difference-in-bst) |\n| [0543-diameter-of-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0543-diameter-of-binary-tree) |\n| [0572-subtree-of-another-tree](https://github.com/EesunMoon/leetcode/tree/master/0572-subtree-of-another-tree) |\n| [0653-two-sum-iv-input-is-a-bst](https://github.com/EesunMoon/leetcode/tree/master/0653-two-sum-iv-input-is-a-bst) |\n| [0783-search-in-a-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0783-search-in-a-binary-search-tree) |\n| [0784-insert-into-a-binary-search-tree](https://github.com/EesunMoon/leetcode/tree/master/0784-insert-into-a-binary-search-tree) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/EesunMoon/leetcode/tree/master/0789-kth-largest-element-in-a-stream) |\n| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0893-all-nodes-distance-k-in-binary-tree) |\n| [1035-cousins-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/1035-cousins-in-binary-tree) |\n| [1150-two-sum-bsts](https://github.com/EesunMoon/leetcode/tree/master/1150-two-sum-bsts) |\n| [1544-count-good-nodes-in-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/1544-count-good-nodes-in-binary-tree) |\n| [1790-lowest-common-ancestor-of-a-binary-tree-iii](https://github.com/EesunMoon/leetcode/tree/master/1790-lowest-common-ancestor-of-a-binary-tree-iii) |\n| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/EesunMoon/leetcode/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/EesunMoon/leetcode/tree/master/0020-valid-parentheses) |\n| [0032-longest-valid-parentheses](https://github.com/EesunMoon/leetcode/tree/master/0032-longest-valid-parentheses) |\n| [0042-trapping-rain-water](https://github.com/EesunMoon/leetcode/tree/master/0042-trapping-rain-water) |\n| [0084-largest-rectangle-in-histogram](https://github.com/EesunMoon/leetcode/tree/master/0084-largest-rectangle-in-histogram) |\n| [0094-binary-tree-inorder-traversal](https://github.com/EesunMoon/leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0143-reorder-list](https://github.com/EesunMoon/leetcode/tree/master/0143-reorder-list) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/EesunMoon/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0155-min-stack](https://github.com/EesunMoon/leetcode/tree/master/0155-min-stack) |\n| [0173-binary-search-tree-iterator](https://github.com/EesunMoon/leetcode/tree/master/0173-binary-search-tree-iterator) |\n| [0227-basic-calculator-ii](https://github.com/EesunMoon/leetcode/tree/master/0227-basic-calculator-ii) |\n| [0232-implement-queue-using-stacks](https://github.com/EesunMoon/leetcode/tree/master/0232-implement-queue-using-stacks) |\n| [0234-palindrome-linked-list](https://github.com/EesunMoon/leetcode/tree/master/0234-palindrome-linked-list) |\n| [0341-flatten-nested-list-iterator](https://github.com/EesunMoon/leetcode/tree/master/0341-flatten-nested-list-iterator) |\n| [0394-decode-string](https://github.com/EesunMoon/leetcode/tree/master/0394-decode-string) |\n| [0496-next-greater-element-i](https://github.com/EesunMoon/leetcode/tree/master/0496-next-greater-element-i) |\n| [0678-valid-parenthesis-string](https://github.com/EesunMoon/leetcode/tree/master/0678-valid-parenthesis-string) |\n| [0735-asteroid-collision](https://github.com/EesunMoon/leetcode/tree/master/0735-asteroid-collision) |\n| [0739-daily-temperatures](https://github.com/EesunMoon/leetcode/tree/master/0739-daily-temperatures) |\n| [0874-backspace-string-compare](https://github.com/EesunMoon/leetcode/tree/master/0874-backspace-string-compare) |\n| [0883-car-fleet](https://github.com/EesunMoon/leetcode/tree/master/0883-car-fleet) |\n| [0937-online-stock-span](https://github.com/EesunMoon/leetcode/tree/master/0937-online-stock-span) |\n| [0943-sum-of-subarray-minimums](https://github.com/EesunMoon/leetcode/tree/master/0943-sum-of-subarray-minimums) |\n| [1002-maximum-width-ramp](https://github.com/EesunMoon/leetcode/tree/master/1002-maximum-width-ramp) |\n| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/EesunMoon/leetcode/tree/master/1128-remove-all-adjacent-duplicates-in-string) |\n| [1150-two-sum-bsts](https://github.com/EesunMoon/leetcode/tree/master/1150-two-sum-bsts) |\n| [1320-remove-all-adjacent-duplicates-in-string-ii](https://github.com/EesunMoon/leetcode/tree/master/1320-remove-all-adjacent-duplicates-in-string-ii) |\n| [1909-buildings-with-an-ocean-view](https://github.com/EesunMoon/leetcode/tree/master/1909-buildings-with-an-ocean-view) |\n| [2021-remove-all-occurrences-of-a-substring](https://github.com/EesunMoon/leetcode/tree/master/2021-remove-all-occurrences-of-a-substring) |\n## Design\n|  |\n| ------- |\n| [0146-lru-cache](https://github.com/EesunMoon/leetcode/tree/master/0146-lru-cache) |\n| [0155-min-stack](https://github.com/EesunMoon/leetcode/tree/master/0155-min-stack) |\n| [0173-binary-search-tree-iterator](https://github.com/EesunMoon/leetcode/tree/master/0173-binary-search-tree-iterator) |\n| [0208-implement-trie-prefix-tree](https://github.com/EesunMoon/leetcode/tree/master/0208-implement-trie-prefix-tree) |\n| [0211-design-add-and-search-words-data-structure](https://github.com/EesunMoon/leetcode/tree/master/0211-design-add-and-search-words-data-structure) |\n| [0232-implement-queue-using-stacks](https://github.com/EesunMoon/leetcode/tree/master/0232-implement-queue-using-stacks) |\n| [0271-encode-and-decode-strings](https://github.com/EesunMoon/leetcode/tree/master/0271-encode-and-decode-strings) |\n| [0284-peeking-iterator](https://github.com/EesunMoon/leetcode/tree/master/0284-peeking-iterator) |\n| [0295-find-median-from-data-stream](https://github.com/EesunMoon/leetcode/tree/master/0295-find-median-from-data-stream) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/EesunMoon/leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0341-flatten-nested-list-iterator](https://github.com/EesunMoon/leetcode/tree/master/0341-flatten-nested-list-iterator) |\n| [0346-moving-average-from-data-stream](https://github.com/EesunMoon/leetcode/tree/master/0346-moving-average-from-data-stream) |\n| [0355-design-twitter](https://github.com/EesunMoon/leetcode/tree/master/0355-design-twitter) |\n| [0359-logger-rate-limiter](https://github.com/EesunMoon/leetcode/tree/master/0359-logger-rate-limiter) |\n| [0362-design-hit-counter](https://github.com/EesunMoon/leetcode/tree/master/0362-design-hit-counter) |\n| [0380-insert-delete-getrandom-o1](https://github.com/EesunMoon/leetcode/tree/master/0380-insert-delete-getrandom-o1) |\n| [0460-lfu-cache](https://github.com/EesunMoon/leetcode/tree/master/0460-lfu-cache) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/EesunMoon/leetcode/tree/master/0789-kth-largest-element-in-a-stream) |\n| [0817-design-hashmap](https://github.com/EesunMoon/leetcode/tree/master/0817-design-hashmap) |\n| [0860-design-circular-queue](https://github.com/EesunMoon/leetcode/tree/master/0860-design-circular-queue) |\n| [0937-online-stock-span](https://github.com/EesunMoon/leetcode/tree/master/0937-online-stock-span) |\n| [1023-time-based-key-value-store](https://github.com/EesunMoon/leetcode/tree/master/1023-time-based-key-value-store) |\n| [1249-snapshot-array](https://github.com/EesunMoon/leetcode/tree/master/1249-snapshot-array) |\n| [2139-detect-squares](https://github.com/EesunMoon/leetcode/tree/master/2139-detect-squares) |\n## Iterator\n|  |\n| ------- |\n| [0173-binary-search-tree-iterator](https://github.com/EesunMoon/leetcode/tree/master/0173-binary-search-tree-iterator) |\n| [0284-peeking-iterator](https://github.com/EesunMoon/leetcode/tree/master/0284-peeking-iterator) |\n| [0341-flatten-nested-list-iterator](https://github.com/EesunMoon/leetcode/tree/master/0341-flatten-nested-list-iterator) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/EesunMoon/leetcode/tree/master/0128-longest-consecutive-sequence) |\n| [0130-surrounded-regions](https://github.com/EesunMoon/leetcode/tree/master/0130-surrounded-regions) |\n| [0200-number-of-islands](https://github.com/EesunMoon/leetcode/tree/master/0200-number-of-islands) |\n| [0261-graph-valid-tree](https://github.com/EesunMoon/leetcode/tree/master/0261-graph-valid-tree) |\n| [0323-number-of-connected-components-in-an-undirected-graph](https://github.com/EesunMoon/leetcode/tree/master/0323-number-of-connected-components-in-an-undirected-graph) |\n| [0547-number-of-provinces](https://github.com/EesunMoon/leetcode/tree/master/0547-number-of-provinces) |\n| [0684-redundant-connection](https://github.com/EesunMoon/leetcode/tree/master/0684-redundant-connection) |\n| [0695-max-area-of-island](https://github.com/EesunMoon/leetcode/tree/master/0695-max-area-of-island) |\n| [0721-accounts-merge](https://github.com/EesunMoon/leetcode/tree/master/0721-accounts-merge) |\n| [0794-swim-in-rising-water](https://github.com/EesunMoon/leetcode/tree/master/0794-swim-in-rising-water) |\n| [1396-count-servers-that-communicate](https://github.com/EesunMoon/leetcode/tree/master/1396-count-servers-that-communicate) |\n| [1442-number-of-operations-to-make-network-connected](https://github.com/EesunMoon/leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |\n| [1706-min-cost-to-connect-all-points](https://github.com/EesunMoon/leetcode/tree/master/1706-min-cost-to-connect-all-points) |\n| [1753-path-with-minimum-effort](https://github.com/EesunMoon/leetcode/tree/master/1753-path-with-minimum-effort) |\n| [2121-find-if-path-exists-in-graph](https://github.com/EesunMoon/leetcode/tree/master/2121-find-if-path-exists-in-graph) |\n| [3881-minimize-maximum-component-cost](https://github.com/EesunMoon/leetcode/tree/master/3881-minimize-maximum-component-cost) |\n## Graph\n|  |\n| ------- |\n| [0133-clone-graph](https://github.com/EesunMoon/leetcode/tree/master/0133-clone-graph) |\n| [0207-course-schedule](https://github.com/EesunMoon/leetcode/tree/master/0207-course-schedule) |\n| [0210-course-schedule-ii](https://github.com/EesunMoon/leetcode/tree/master/0210-course-schedule-ii) |\n| [0261-graph-valid-tree](https://github.com/EesunMoon/leetcode/tree/master/0261-graph-valid-tree) |\n| [0269-alien-dictionary](https://github.com/EesunMoon/leetcode/tree/master/0269-alien-dictionary) |\n| [0323-number-of-connected-components-in-an-undirected-graph](https://github.com/EesunMoon/leetcode/tree/master/0323-number-of-connected-components-in-an-undirected-graph) |\n| [0329-longest-increasing-path-in-a-matrix](https://github.com/EesunMoon/leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |\n| [0332-reconstruct-itinerary](https://github.com/EesunMoon/leetcode/tree/master/0332-reconstruct-itinerary) |\n| [0547-number-of-provinces](https://github.com/EesunMoon/leetcode/tree/master/0547-number-of-provinces) |\n| [0684-redundant-connection](https://github.com/EesunMoon/leetcode/tree/master/0684-redundant-connection) |\n| [0744-network-delay-time](https://github.com/EesunMoon/leetcode/tree/master/0744-network-delay-time) |\n| [0803-cheapest-flights-within-k-stops](https://github.com/EesunMoon/leetcode/tree/master/0803-cheapest-flights-within-k-stops) |\n| [0813-all-paths-from-source-to-target](https://github.com/EesunMoon/leetcode/tree/master/0813-all-paths-from-source-to-target) |\n| [1442-number-of-operations-to-make-network-connected](https://github.com/EesunMoon/leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |\n| [1558-course-schedule-iv](https://github.com/EesunMoon/leetcode/tree/master/1558-course-schedule-iv) |\n| [1706-min-cost-to-connect-all-points](https://github.com/EesunMoon/leetcode/tree/master/1706-min-cost-to-connect-all-points) |\n| [2121-find-if-path-exists-in-graph](https://github.com/EesunMoon/leetcode/tree/master/2121-find-if-path-exists-in-graph) |\n| [3881-minimize-maximum-component-cost](https://github.com/EesunMoon/leetcode/tree/master/3881-minimize-maximum-component-cost) |\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/EesunMoon/leetcode/tree/master/0002-add-two-numbers) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/EesunMoon/leetcode/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0021-merge-two-sorted-lists](https://github.com/EesunMoon/leetcode/tree/master/0021-merge-two-sorted-lists) |\n| [0023-merge-k-sorted-lists](https://github.com/EesunMoon/leetcode/tree/master/0023-merge-k-sorted-lists) |\n| [0024-swap-nodes-in-pairs](https://github.com/EesunMoon/leetcode/tree/master/0024-swap-nodes-in-pairs) |\n| [0025-reverse-nodes-in-k-group](https://github.com/EesunMoon/leetcode/tree/master/0025-reverse-nodes-in-k-group) |\n| [0061-rotate-list](https://github.com/EesunMoon/leetcode/tree/master/0061-rotate-list) |\n| [0138-copy-list-with-random-pointer](https://github.com/EesunMoon/leetcode/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/EesunMoon/leetcode/tree/master/0141-linked-list-cycle) |\n| [0143-reorder-list](https://github.com/EesunMoon/leetcode/tree/master/0143-reorder-list) |\n| [0146-lru-cache](https://github.com/EesunMoon/leetcode/tree/master/0146-lru-cache) |\n| [0147-insertion-sort-list](https://github.com/EesunMoon/leetcode/tree/master/0147-insertion-sort-list) |\n| [0148-sort-list](https://github.com/EesunMoon/leetcode/tree/master/0148-sort-list) |\n| [0206-reverse-linked-list](https://github.com/EesunMoon/leetcode/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/EesunMoon/leetcode/tree/master/0234-palindrome-linked-list) |\n| [0328-odd-even-linked-list](https://github.com/EesunMoon/leetcode/tree/master/0328-odd-even-linked-list) |\n| [0355-design-twitter](https://github.com/EesunMoon/leetcode/tree/master/0355-design-twitter) |\n| [0460-lfu-cache](https://github.com/EesunMoon/leetcode/tree/master/0460-lfu-cache) |\n| [0817-design-hashmap](https://github.com/EesunMoon/leetcode/tree/master/0817-design-hashmap) |\n| [0860-design-circular-queue](https://github.com/EesunMoon/leetcode/tree/master/0860-design-circular-queue) |\n| [0908-middle-of-the-linked-list](https://github.com/EesunMoon/leetcode/tree/master/0908-middle-of-the-linked-list) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/EesunMoon/leetcode/tree/master/0002-add-two-numbers) |\n| [0021-merge-two-sorted-lists](https://github.com/EesunMoon/leetcode/tree/master/0021-merge-two-sorted-lists) |\n| [0024-swap-nodes-in-pairs](https://github.com/EesunMoon/leetcode/tree/master/0024-swap-nodes-in-pairs) |\n| [0025-reverse-nodes-in-k-group](https://github.com/EesunMoon/leetcode/tree/master/0025-reverse-nodes-in-k-group) |\n| [0050-powx-n](https://github.com/EesunMoon/leetcode/tree/master/0050-powx-n) |\n| [0143-reorder-list](https://github.com/EesunMoon/leetcode/tree/master/0143-reorder-list) |\n| [0206-reverse-linked-list](https://github.com/EesunMoon/leetcode/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/EesunMoon/leetcode/tree/master/0234-palindrome-linked-list) |\n| [0394-decode-string](https://github.com/EesunMoon/leetcode/tree/master/0394-decode-string) |\n| [1013-fibonacci-number](https://github.com/EesunMoon/leetcode/tree/master/1013-fibonacci-number) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/EesunMoon/leetcode/tree/master/0070-climbing-stairs) |\n| [0139-word-break](https://github.com/EesunMoon/leetcode/tree/master/0139-word-break) |\n| [0329-longest-increasing-path-in-a-matrix](https://github.com/EesunMoon/leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |\n| [1013-fibonacci-number](https://github.com/EesunMoon/leetcode/tree/master/1013-fibonacci-number) |\n| [1236-n-th-tribonacci-number](https://github.com/EesunMoon/leetcode/tree/master/1236-n-th-tribonacci-number) |\n## Queue\n|  |\n| ------- |\n| [0232-implement-queue-using-stacks](https://github.com/EesunMoon/leetcode/tree/master/0232-implement-queue-using-stacks) |\n| [0239-sliding-window-maximum](https://github.com/EesunMoon/leetcode/tree/master/0239-sliding-window-maximum) |\n| [0341-flatten-nested-list-iterator](https://github.com/EesunMoon/leetcode/tree/master/0341-flatten-nested-list-iterator) |\n| [0346-moving-average-from-data-stream](https://github.com/EesunMoon/leetcode/tree/master/0346-moving-average-from-data-stream) |\n| [0362-design-hit-counter](https://github.com/EesunMoon/leetcode/tree/master/0362-design-hit-counter) |\n| [0387-first-unique-character-in-a-string](https://github.com/EesunMoon/leetcode/tree/master/0387-first-unique-character-in-a-string) |\n| [0860-design-circular-queue](https://github.com/EesunMoon/leetcode/tree/master/0860-design-circular-queue) |\n## Data Stream\n|  |\n| ------- |\n| [0295-find-median-from-data-stream](https://github.com/EesunMoon/leetcode/tree/master/0295-find-median-from-data-stream) |\n| [0346-moving-average-from-data-stream](https://github.com/EesunMoon/leetcode/tree/master/0346-moving-average-from-data-stream) |\n| [0359-logger-rate-limiter](https://github.com/EesunMoon/leetcode/tree/master/0359-logger-rate-limiter) |\n| [0362-design-hit-counter](https://github.com/EesunMoon/leetcode/tree/master/0362-design-hit-counter) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/EesunMoon/leetcode/tree/master/0789-kth-largest-element-in-a-stream) |\n| [0937-online-stock-span](https://github.com/EesunMoon/leetcode/tree/master/0937-online-stock-span) |\n## Matrix\n|  |\n| ------- |\n| [0036-valid-sudoku](https://github.com/EesunMoon/leetcode/tree/master/0036-valid-sudoku) |\n| [0048-rotate-image](https://github.com/EesunMoon/leetcode/tree/master/0048-rotate-image) |\n| [0054-spiral-matrix](https://github.com/EesunMoon/leetcode/tree/master/0054-spiral-matrix) |\n| [0064-minimum-path-sum](https://github.com/EesunMoon/leetcode/tree/master/0064-minimum-path-sum) |\n| [0073-set-matrix-zeroes](https://github.com/EesunMoon/leetcode/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/EesunMoon/leetcode/tree/master/0074-search-a-2d-matrix) |\n| [0079-word-search](https://github.com/EesunMoon/leetcode/tree/master/0079-word-search) |\n| [0130-surrounded-regions](https://github.com/EesunMoon/leetcode/tree/master/0130-surrounded-regions) |\n| [0200-number-of-islands](https://github.com/EesunMoon/leetcode/tree/master/0200-number-of-islands) |\n| [0212-word-search-ii](https://github.com/EesunMoon/leetcode/tree/master/0212-word-search-ii) |\n| [0240-search-a-2d-matrix-ii](https://github.com/EesunMoon/leetcode/tree/master/0240-search-a-2d-matrix-ii) |\n| [0286-walls-and-gates](https://github.com/EesunMoon/leetcode/tree/master/0286-walls-and-gates) |\n| [0329-longest-increasing-path-in-a-matrix](https://github.com/EesunMoon/leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |\n| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/EesunMoon/leetcode/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |\n| [0417-pacific-atlantic-water-flow](https://github.com/EesunMoon/leetcode/tree/master/0417-pacific-atlantic-water-flow) |\n| [0498-diagonal-traverse](https://github.com/EesunMoon/leetcode/tree/master/0498-diagonal-traverse) |\n| [0542-01-matrix](https://github.com/EesunMoon/leetcode/tree/master/0542-01-matrix) |\n| [0695-max-area-of-island](https://github.com/EesunMoon/leetcode/tree/master/0695-max-area-of-island) |\n| [0794-swim-in-rising-water](https://github.com/EesunMoon/leetcode/tree/master/0794-swim-in-rising-water) |\n| [1036-rotting-oranges](https://github.com/EesunMoon/leetcode/tree/master/1036-rotting-oranges) |\n| [1094-matrix-cells-in-distance-order](https://github.com/EesunMoon/leetcode/tree/master/1094-matrix-cells-in-distance-order) |\n| [1396-count-servers-that-communicate](https://github.com/EesunMoon/leetcode/tree/master/1396-count-servers-that-communicate) |\n| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/EesunMoon/leetcode/tree/master/1463-the-k-weakest-rows-in-a-matrix) |\n| [1753-path-with-minimum-effort](https://github.com/EesunMoon/leetcode/tree/master/1753-path-with-minimum-effort) |\n## Backtracking\n|  |\n| ------- |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/EesunMoon/leetcode/tree/master/0017-letter-combinations-o","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Feesunmoon%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Feesunmoon%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Feesunmoon%2Fleetcode/lists"}