{"id":22973136,"url":"https://github.com/huy-dna/leethub","last_synced_at":"2025-04-02T07:14:38.405Z","repository":{"id":263878763,"uuid":"891653487","full_name":"Huy-DNA/Leethub","owner":"Huy-DNA","description":"A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)","archived":false,"fork":false,"pushed_at":"2025-02-23T03:09:58.000Z","size":420,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-29T17:46:47.970Z","etag":null,"topics":["leetcode"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Huy-DNA.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}},"created_at":"2024-11-20T18:01:14.000Z","updated_at":"2025-02-23T03:10:02.000Z","dependencies_parsed_at":"2025-01-01T08:24:43.651Z","dependency_job_id":"6fd27fd0-5f2d-4eab-aae7-99987aa23f64","html_url":"https://github.com/Huy-DNA/Leethub","commit_stats":null,"previous_names":["huy-dna/leethub"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Huy-DNA%2FLeethub","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Huy-DNA%2FLeethub/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Huy-DNA%2FLeethub/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Huy-DNA%2FLeethub/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Huy-DNA","download_url":"https://codeload.github.com/Huy-DNA/Leethub/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246769968,"owners_count":20830771,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["leetcode"],"created_at":"2024-12-14T23:39:48.741Z","updated_at":"2025-04-02T07:14:38.397Z","avatar_url":"https://github.com/Huy-DNA.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leethub\nA collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/Huy-DNA/Leethub/tree/master/0001-two-sum) |\n| [0011-container-with-most-water](https://github.com/Huy-DNA/Leethub/tree/master/0011-container-with-most-water) |\n| [0035-search-insert-position](https://github.com/Huy-DNA/Leethub/tree/master/0035-search-insert-position) |\n| [0036-valid-sudoku](https://github.com/Huy-DNA/Leethub/tree/master/0036-valid-sudoku) |\n| [0042-trapping-rain-water](https://github.com/Huy-DNA/Leethub/tree/master/0042-trapping-rain-water) |\n| [0046-permutations](https://github.com/Huy-DNA/Leethub/tree/master/0046-permutations) |\n| [0051-n-queens](https://github.com/Huy-DNA/Leethub/tree/master/0051-n-queens) |\n| [0053-maximum-subarray](https://github.com/Huy-DNA/Leethub/tree/master/0053-maximum-subarray) |\n| [0074-search-a-2d-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0074-search-a-2d-matrix) |\n| [0075-sort-colors](https://github.com/Huy-DNA/Leethub/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/0088-merge-sorted-array) |\n| [0118-pascals-triangle](https://github.com/Huy-DNA/Leethub/tree/master/0118-pascals-triangle) |\n| [0120-triangle](https://github.com/Huy-DNA/Leethub/tree/master/0120-triangle) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/Huy-DNA/Leethub/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Huy-DNA/Leethub/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |\n| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/Huy-DNA/Leethub/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |\n| [0128-longest-consecutive-sequence](https://github.com/Huy-DNA/Leethub/tree/master/0128-longest-consecutive-sequence) |\n| [0136-single-number](https://github.com/Huy-DNA/Leethub/tree/master/0136-single-number) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/Huy-DNA/Leethub/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Huy-DNA/Leethub/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0198-house-robber](https://github.com/Huy-DNA/Leethub/tree/master/0198-house-robber) |\n| [0200-number-of-islands](https://github.com/Huy-DNA/Leethub/tree/master/0200-number-of-islands) |\n| [0213-house-robber-ii](https://github.com/Huy-DNA/Leethub/tree/master/0213-house-robber-ii) |\n| [0217-contains-duplicate](https://github.com/Huy-DNA/Leethub/tree/master/0217-contains-duplicate) |\n| [0283-move-zeroes](https://github.com/Huy-DNA/Leethub/tree/master/0283-move-zeroes) |\n| [0300-longest-increasing-subsequence](https://github.com/Huy-DNA/Leethub/tree/master/0300-longest-increasing-subsequence) |\n| [0307-range-sum-query-mutable](https://github.com/Huy-DNA/Leethub/tree/master/0307-range-sum-query-mutable) |\n| [0330-patching-array](https://github.com/Huy-DNA/Leethub/tree/master/0330-patching-array) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/Huy-DNA/Leethub/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0368-largest-divisible-subset](https://github.com/Huy-DNA/Leethub/tree/master/0368-largest-divisible-subset) |\n| [0377-combination-sum-iv](https://github.com/Huy-DNA/Leethub/tree/master/0377-combination-sum-iv) |\n| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |\n| [0446-arithmetic-slices-ii-subsequence](https://github.com/Huy-DNA/Leethub/tree/master/0446-arithmetic-slices-ii-subsequence) |\n| [0502-ipo](https://github.com/Huy-DNA/Leethub/tree/master/0502-ipo) |\n| [0523-continuous-subarray-sum](https://github.com/Huy-DNA/Leethub/tree/master/0523-continuous-subarray-sum) |\n| [0542-01-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0542-01-matrix) |\n| [0566-reshape-the-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0566-reshape-the-matrix) |\n| [0695-max-area-of-island](https://github.com/Huy-DNA/Leethub/tree/master/0695-max-area-of-island) |\n| [0729-my-calendar-i](https://github.com/Huy-DNA/Leethub/tree/master/0729-my-calendar-i) |\n| [0733-flood-fill](https://github.com/Huy-DNA/Leethub/tree/master/0733-flood-fill) |\n| [0748-largest-number-at-least-twice-of-others](https://github.com/Huy-DNA/Leethub/tree/master/0748-largest-number-at-least-twice-of-others) |\n| [0792-binary-search](https://github.com/Huy-DNA/Leethub/tree/master/0792-binary-search) |\n| [0822-unique-morse-code-words](https://github.com/Huy-DNA/Leethub/tree/master/0822-unique-morse-code-words) |\n| [0843-binary-trees-with-factors](https://github.com/Huy-DNA/Leethub/tree/master/0843-binary-trees-with-factors) |\n| [0909-stone-game](https://github.com/Huy-DNA/Leethub/tree/master/0909-stone-game) |\n| [0917-boats-to-save-people](https://github.com/Huy-DNA/Leethub/tree/master/0917-boats-to-save-people) |\n| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Huy-DNA/Leethub/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |\n| [0967-minimum-falling-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0967-minimum-falling-path-sum) |\n| [1016-subarray-sums-divisible-by-k](https://github.com/Huy-DNA/Leethub/tree/master/1016-subarray-sums-divisible-by-k) |\n| [1019-squares-of-a-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/1019-squares-of-a-sorted-array) |\n| [1020-longest-turbulent-subarray](https://github.com/Huy-DNA/Leethub/tree/master/1020-longest-turbulent-subarray) |\n| [1036-rotting-oranges](https://github.com/Huy-DNA/Leethub/tree/master/1036-rotting-oranges) |\n| [1049-minimum-domino-rotations-for-equal-row](https://github.com/Huy-DNA/Leethub/tree/master/1049-minimum-domino-rotations-for-equal-row) |\n| [1095-two-city-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1095-two-city-scheduling) |\n| [1127-last-stone-weight](https://github.com/Huy-DNA/Leethub/tree/master/1127-last-stone-weight) |\n| [1137-height-checker](https://github.com/Huy-DNA/Leethub/tree/master/1137-height-checker) |\n| [1352-maximum-profit-in-job-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1352-maximum-profit-in-job-scheduling) |\n| [1396-count-servers-that-communicate](https://github.com/Huy-DNA/Leethub/tree/master/1396-count-servers-that-communicate) |\n| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/Huy-DNA/Leethub/tree/master/1463-the-k-weakest-rows-in-a-matrix) |\n| [1464-reduce-array-size-to-the-half](https://github.com/Huy-DNA/Leethub/tree/master/1464-reduce-array-size-to-the-half) |\n| [1524-string-matching-in-an-array](https://github.com/Huy-DNA/Leethub/tree/master/1524-string-matching-in-an-array) |\n| [1553-count-triplets-that-can-form-two-arrays-of-equal-xor](https://github.com/Huy-DNA/Leethub/tree/master/1553-count-triplets-that-can-form-two-arrays-of-equal-xor) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/Huy-DNA/Leethub/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n| [1730-special-array-with-x-elements-greater-than-or-equal-x](https://github.com/Huy-DNA/Leethub/tree/master/1730-special-array-with-x-elements-greater-than-or-equal-x) |\n| [1876-map-of-highest-peak](https://github.com/Huy-DNA/Leethub/tree/master/1876-map-of-highest-peak) |\n| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/Huy-DNA/Leethub/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |\n| [1927-maximum-ascending-subarray-sum](https://github.com/Huy-DNA/Leethub/tree/master/1927-maximum-ascending-subarray-sum) |\n| [2107-find-unique-binary-string](https://github.com/Huy-DNA/Leethub/tree/master/2107-find-unique-binary-string) |\n| [2117-find-original-array-from-doubled-array](https://github.com/Huy-DNA/Leethub/tree/master/2117-find-original-array-from-doubled-array) |\n| [2145-grid-game](https://github.com/Huy-DNA/Leethub/tree/master/2145-grid-game) |\n| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/Huy-DNA/Leethub/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |\n| [2164-two-best-non-overlapping-events](https://github.com/Huy-DNA/Leethub/tree/master/2164-two-best-non-overlapping-events) |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/Huy-DNA/Leethub/tree/master/2244-number-of-laser-beams-in-a-bank) |\n| [2274-keep-multiplying-found-values-by-two](https://github.com/Huy-DNA/Leethub/tree/master/2274-keep-multiplying-found-values-by-two) |\n| [2292-counting-words-with-a-given-prefix](https://github.com/Huy-DNA/Leethub/tree/master/2292-counting-words-with-a-given-prefix) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/Huy-DNA/Leethub/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n| [2358-number-of-ways-to-split-array](https://github.com/Huy-DNA/Leethub/tree/master/2358-number-of-ways-to-split-array) |\n| [2465-shifting-letters-ii](https://github.com/Huy-DNA/Leethub/tree/master/2465-shifting-letters-ii) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/Huy-DNA/Leethub/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n| [2691-count-vowel-strings-in-ranges](https://github.com/Huy-DNA/Leethub/tree/master/2691-count-vowel-strings-in-ranges) |\n| [2724-convert-an-array-into-a-2d-array-with-conditions](https://github.com/Huy-DNA/Leethub/tree/master/2724-convert-an-array-into-a-2d-array-with-conditions) |\n| [2866-longest-even-odd-subarray-with-threshold](https://github.com/Huy-DNA/Leethub/tree/master/2866-longest-even-odd-subarray-with-threshold) |\n| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/Huy-DNA/Leethub/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Huy-DNA/Leethub/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/Huy-DNA/Leethub/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |\n| [3427-special-array-ii](https://github.com/Huy-DNA/Leethub/tree/master/3427-special-array-ii) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/Huy-DNA/Leethub/tree/master/0001-two-sum) |\n| [0003-longest-substring-without-repeating-characters](https://github.com/Huy-DNA/Leethub/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0013-roman-to-integer](https://github.com/Huy-DNA/Leethub/tree/master/0013-roman-to-integer) |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/Huy-DNA/Leethub/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0036-valid-sudoku](https://github.com/Huy-DNA/Leethub/tree/master/0036-valid-sudoku) |\n| [0126-word-ladder-ii](https://github.com/Huy-DNA/Leethub/tree/master/0126-word-ladder-ii) |\n| [0128-longest-consecutive-sequence](https://github.com/Huy-DNA/Leethub/tree/master/0128-longest-consecutive-sequence) |\n| [0138-copy-list-with-random-pointer](https://github.com/Huy-DNA/Leethub/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/Huy-DNA/Leethub/tree/master/0141-linked-list-cycle) |\n| [0202-happy-number](https://github.com/Huy-DNA/Leethub/tree/master/0202-happy-number) |\n| [0217-contains-duplicate](https://github.com/Huy-DNA/Leethub/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/Huy-DNA/Leethub/tree/master/0242-valid-anagram) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/Huy-DNA/Leethub/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0383-ransom-note](https://github.com/Huy-DNA/Leethub/tree/master/0383-ransom-note) |\n| [0387-first-unique-character-in-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0387-first-unique-character-in-a-string) |\n| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |\n| [0523-continuous-subarray-sum](https://github.com/Huy-DNA/Leethub/tree/master/0523-continuous-subarray-sum) |\n| [0567-permutation-in-string](https://github.com/Huy-DNA/Leethub/tree/master/0567-permutation-in-string) |\n| [0768-partition-labels](https://github.com/Huy-DNA/Leethub/tree/master/0768-partition-labels) |\n| [0822-unique-morse-code-words](https://github.com/Huy-DNA/Leethub/tree/master/0822-unique-morse-code-words) |\n| [0843-binary-trees-with-factors](https://github.com/Huy-DNA/Leethub/tree/master/0843-binary-trees-with-factors) |\n| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Huy-DNA/Leethub/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |\n| [1016-subarray-sums-divisible-by-k](https://github.com/Huy-DNA/Leethub/tree/master/1016-subarray-sums-divisible-by-k) |\n| [1160-letter-tile-possibilities](https://github.com/Huy-DNA/Leethub/tree/master/1160-letter-tile-possibilities) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n| [1464-reduce-array-size-to-the-half](https://github.com/Huy-DNA/Leethub/tree/master/1464-reduce-array-size-to-the-half) |\n| [1469-minimum-number-of-steps-to-make-two-strings-anagram](https://github.com/Huy-DNA/Leethub/tree/master/1469-minimum-number-of-steps-to-make-two-strings-anagram) |\n| [1553-count-triplets-that-can-form-two-arrays-of-equal-xor](https://github.com/Huy-DNA/Leethub/tree/master/1553-count-triplets-that-can-form-two-arrays-of-equal-xor) |\n| [1777-determine-if-two-strings-are-close](https://github.com/Huy-DNA/Leethub/tree/master/1777-determine-if-two-strings-are-close) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Huy-DNA/Leethub/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/Huy-DNA/Leethub/tree/master/2059-unique-length-3-palindromic-subsequences) |\n| [2107-find-unique-binary-string](https://github.com/Huy-DNA/Leethub/tree/master/2107-find-unique-binary-string) |\n| [2117-find-original-array-from-doubled-array](https://github.com/Huy-DNA/Leethub/tree/master/2117-find-original-array-from-doubled-array) |\n| [2274-keep-multiplying-found-values-by-two](https://github.com/Huy-DNA/Leethub/tree/master/2274-keep-multiplying-found-values-by-two) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/Huy-DNA/Leethub/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/Huy-DNA/Leethub/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n| [2724-convert-an-array-into-a-2d-array-with-conditions](https://github.com/Huy-DNA/Leethub/tree/master/2724-convert-an-array-into-a-2d-array-with-conditions) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0002-add-two-numbers) |\n| [0009-palindrome-number](https://github.com/Huy-DNA/Leethub/tree/master/0009-palindrome-number) |\n| [0013-roman-to-integer](https://github.com/Huy-DNA/Leethub/tree/master/0013-roman-to-integer) |\n| [0062-unique-paths](https://github.com/Huy-DNA/Leethub/tree/master/0062-unique-paths) |\n| [0070-climbing-stairs](https://github.com/Huy-DNA/Leethub/tree/master/0070-climbing-stairs) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/Huy-DNA/Leethub/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0202-happy-number](https://github.com/Huy-DNA/Leethub/tree/master/0202-happy-number) |\n| [0231-power-of-two](https://github.com/Huy-DNA/Leethub/tree/master/0231-power-of-two) |\n| [0233-number-of-digit-one](https://github.com/Huy-DNA/Leethub/tree/master/0233-number-of-digit-one) |\n| [0241-different-ways-to-add-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0241-different-ways-to-add-parentheses) |\n| [0326-power-of-three](https://github.com/Huy-DNA/Leethub/tree/master/0326-power-of-three) |\n| [0342-power-of-four](https://github.com/Huy-DNA/Leethub/tree/master/0342-power-of-four) |\n| [0343-integer-break](https://github.com/Huy-DNA/Leethub/tree/master/0343-integer-break) |\n| [0368-largest-divisible-subset](https://github.com/Huy-DNA/Leethub/tree/master/0368-largest-divisible-subset) |\n| [0458-poor-pigs](https://github.com/Huy-DNA/Leethub/tree/master/0458-poor-pigs) |\n| [0523-continuous-subarray-sum](https://github.com/Huy-DNA/Leethub/tree/master/0523-continuous-subarray-sum) |\n| [0650-2-keys-keyboard](https://github.com/Huy-DNA/Leethub/tree/master/0650-2-keys-keyboard) |\n| [0909-stone-game](https://github.com/Huy-DNA/Leethub/tree/master/0909-stone-game) |\n| [1033-broken-calculator](https://github.com/Huy-DNA/Leethub/tree/master/1033-broken-calculator) |\n| [1553-count-triplets-that-can-form-two-arrays-of-equal-xor](https://github.com/Huy-DNA/Leethub/tree/master/1553-count-triplets-that-can-form-two-arrays-of-equal-xor) |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/Huy-DNA/Leethub/tree/master/2244-number-of-laser-beams-in-a-bank) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0022-generate-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0022-generate-parentheses) |\n| [0032-longest-valid-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0032-longest-valid-parentheses) |\n| [0042-trapping-rain-water](https://github.com/Huy-DNA/Leethub/tree/master/0042-trapping-rain-water) |\n| [0053-maximum-subarray](https://github.com/Huy-DNA/Leethub/tree/master/0053-maximum-subarray) |\n| [0062-unique-paths](https://github.com/Huy-DNA/Leethub/tree/master/0062-unique-paths) |\n| [0070-climbing-stairs](https://github.com/Huy-DNA/Leethub/tree/master/0070-climbing-stairs) |\n| [0118-pascals-triangle](https://github.com/Huy-DNA/Leethub/tree/master/0118-pascals-triangle) |\n| [0120-triangle](https://github.com/Huy-DNA/Leethub/tree/master/0120-triangle) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/Huy-DNA/Leethub/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Huy-DNA/Leethub/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |\n| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/Huy-DNA/Leethub/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0198-house-robber](https://github.com/Huy-DNA/Leethub/tree/master/0198-house-robber) |\n| [0213-house-robber-ii](https://github.com/Huy-DNA/Leethub/tree/master/0213-house-robber-ii) |\n| [0233-number-of-digit-one](https://github.com/Huy-DNA/Leethub/tree/master/0233-number-of-digit-one) |\n| [0241-different-ways-to-add-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0241-different-ways-to-add-parentheses) |\n| [0300-longest-increasing-subsequence](https://github.com/Huy-DNA/Leethub/tree/master/0300-longest-increasing-subsequence) |\n| [0343-integer-break](https://github.com/Huy-DNA/Leethub/tree/master/0343-integer-break) |\n| [0368-largest-divisible-subset](https://github.com/Huy-DNA/Leethub/tree/master/0368-largest-divisible-subset) |\n| [0377-combination-sum-iv](https://github.com/Huy-DNA/Leethub/tree/master/0377-combination-sum-iv) |\n| [0446-arithmetic-slices-ii-subsequence](https://github.com/Huy-DNA/Leethub/tree/master/0446-arithmetic-slices-ii-subsequence) |\n| [0458-poor-pigs](https://github.com/Huy-DNA/Leethub/tree/master/0458-poor-pigs) |\n| [0542-01-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0542-01-matrix) |\n| [0650-2-keys-keyboard](https://github.com/Huy-DNA/Leethub/tree/master/0650-2-keys-keyboard) |\n| [0843-binary-trees-with-factors](https://github.com/Huy-DNA/Leethub/tree/master/0843-binary-trees-with-factors) |\n| [0909-stone-game](https://github.com/Huy-DNA/Leethub/tree/master/0909-stone-game) |\n| [0967-minimum-falling-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0967-minimum-falling-path-sum) |\n| [1020-longest-turbulent-subarray](https://github.com/Huy-DNA/Leethub/tree/master/1020-longest-turbulent-subarray) |\n| [1332-count-vowels-permutation](https://github.com/Huy-DNA/Leethub/tree/master/1332-count-vowels-permutation) |\n| [1352-maximum-profit-in-job-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1352-maximum-profit-in-job-scheduling) |\n| [1897-maximize-palindrome-length-from-subsequences](https://github.com/Huy-DNA/Leethub/tree/master/1897-maximize-palindrome-length-from-subsequences) |\n| [2164-two-best-non-overlapping-events](https://github.com/Huy-DNA/Leethub/tree/master/2164-two-best-non-overlapping-events) |\n## Greedy\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/Huy-DNA/Leethub/tree/master/0011-container-with-most-water) |\n| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Huy-DNA/Leethub/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |\n| [0330-patching-array](https://github.com/Huy-DNA/Leethub/tree/master/0330-patching-array) |\n| [0502-ipo](https://github.com/Huy-DNA/Leethub/tree/master/0502-ipo) |\n| [0768-partition-labels](https://github.com/Huy-DNA/Leethub/tree/master/0768-partition-labels) |\n| [0917-boats-to-save-people](https://github.com/Huy-DNA/Leethub/tree/master/0917-boats-to-save-people) |\n| [1033-broken-calculator](https://github.com/Huy-DNA/Leethub/tree/master/1033-broken-calculator) |\n| [1049-minimum-domino-rotations-for-equal-row](https://github.com/Huy-DNA/Leethub/tree/master/1049-minimum-domino-rotations-for-equal-row) |\n| [1095-two-city-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1095-two-city-scheduling) |\n| [1464-reduce-array-size-to-the-half](https://github.com/Huy-DNA/Leethub/tree/master/1464-reduce-array-size-to-the-half) |\n| [1782-smallest-string-with-a-given-numeric-value](https://github.com/Huy-DNA/Leethub/tree/master/1782-smallest-string-with-a-given-numeric-value) |\n| [2117-find-original-array-from-doubled-array](https://github.com/Huy-DNA/Leethub/tree/master/2117-find-original-array-from-doubled-array) |\n| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/Huy-DNA/Leethub/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |\n| [2456-construct-smallest-number-from-di-string](https://github.com/Huy-DNA/Leethub/tree/master/2456-construct-smallest-number-from-di-string) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/Huy-DNA/Leethub/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n## Sorting\n|  |\n| ------- |\n| [0075-sort-colors](https://github.com/Huy-DNA/Leethub/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/0088-merge-sorted-array) |\n| [0217-contains-duplicate](https://github.com/Huy-DNA/Leethub/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/Huy-DNA/Leethub/tree/master/0242-valid-anagram) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/Huy-DNA/Leethub/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0368-largest-divisible-subset](https://github.com/Huy-DNA/Leethub/tree/master/0368-largest-divisible-subset) |\n| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |\n| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |\n| [0502-ipo](https://github.com/Huy-DNA/Leethub/tree/master/0502-ipo) |\n| [0748-largest-number-at-least-twice-of-others](https://github.com/Huy-DNA/Leethub/tree/master/0748-largest-number-at-least-twice-of-others) |\n| [0843-binary-trees-with-factors](https://github.com/Huy-DNA/Leethub/tree/master/0843-binary-trees-with-factors) |\n| [0917-boats-to-save-people](https://github.com/Huy-DNA/Leethub/tree/master/0917-boats-to-save-people) |\n| [1019-squares-of-a-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/1019-squares-of-a-sorted-array) |\n| [1095-two-city-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1095-two-city-scheduling) |\n| [1137-height-checker](https://github.com/Huy-DNA/Leethub/tree/master/1137-height-checker) |\n| [1352-maximum-profit-in-job-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1352-maximum-profit-in-job-scheduling) |\n| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/Huy-DNA/Leethub/tree/master/1463-the-k-weakest-rows-in-a-matrix) |\n| [1464-reduce-array-size-to-the-half](https://github.com/Huy-DNA/Leethub/tree/master/1464-reduce-array-size-to-the-half) |\n| [1730-special-array-with-x-elements-greater-than-or-equal-x](https://github.com/Huy-DNA/Leethub/tree/master/1730-special-array-with-x-elements-greater-than-or-equal-x) |\n| [1777-determine-if-two-strings-are-close](https://github.com/Huy-DNA/Leethub/tree/master/1777-determine-if-two-strings-are-close) |\n| [2117-find-original-array-from-doubled-array](https://github.com/Huy-DNA/Leethub/tree/master/2117-find-original-array-from-doubled-array) |\n| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/Huy-DNA/Leethub/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |\n| [2164-two-best-non-overlapping-events](https://github.com/Huy-DNA/Leethub/tree/master/2164-two-best-non-overlapping-events) |\n| [2274-keep-multiplying-found-values-by-two](https://github.com/Huy-DNA/Leethub/tree/master/2274-keep-multiplying-found-values-by-two) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/Huy-DNA/Leethub/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/Huy-DNA/Leethub/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |\n| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |\n| [0502-ipo](https://github.com/Huy-DNA/Leethub/tree/master/0502-ipo) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |\n| [1127-last-stone-weight](https://github.com/Huy-DNA/Leethub/tree/master/1127-last-stone-weight) |\n| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/Huy-DNA/Leethub/tree/master/1463-the-k-weakest-rows-in-a-matrix) |\n| [1464-reduce-array-size-to-the-half](https://github.com/Huy-DNA/Leethub/tree/master/1464-reduce-array-size-to-the-half) |\n| [2164-two-best-non-overlapping-events](https://github.com/Huy-DNA/Leethub/tree/master/2164-two-best-non-overlapping-events) |\n## Counting Sort\n|  |\n| ------- |\n| [0383-ransom-note](https://github.com/Huy-DNA/Leethub/tree/master/0383-ransom-note) |\n| [0387-first-unique-character-in-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0387-first-unique-character-in-a-string) |\n| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |\n| [1137-height-checker](https://github.com/Huy-DNA/Leethub/tree/master/1137-height-checker) |\n| [1160-letter-tile-possibilities](https://github.com/Huy-DNA/Leethub/tree/master/1160-letter-tile-possibilities) |\n| [1396-count-servers-that-communicate](https://github.com/Huy-DNA/Leethub/tree/master/1396-count-servers-that-communicate) |\n| [1469-minimum-number-of-steps-to-make-two-strings-anagram](https://github.com/Huy-DNA/Leethub/tree/master/1469-minimum-number-of-steps-to-make-two-strings-anagram) |\n| [1777-determine-if-two-strings-are-close](https://github.com/Huy-DNA/Leethub/tree/master/1777-determine-if-two-strings-are-close) |\n| [1823-determine-if-string-halves-are-alike](https://github.com/Huy-DNA/Leethub/tree/master/1823-determine-if-string-halves-are-alike) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Huy-DNA/Leethub/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/Huy-DNA/Leethub/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/Huy-DNA/Leethub/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n## Two Pointers\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/Huy-DNA/Leethub/tree/master/0011-container-with-most-water) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/Huy-DNA/Leethub/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0042-trapping-rain-water](https://github.com/Huy-DNA/Leethub/tree/master/0042-trapping-rain-water) |\n| [0061-rotate-list](https://github.com/Huy-DNA/Leethub/tree/master/0061-rotate-list) |\n| [0075-sort-colors](https://github.com/Huy-DNA/Leethub/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/0088-merge-sorted-array) |\n| [0141-linked-list-cycle](https://github.com/Huy-DNA/Leethub/tree/master/0141-linked-list-cycle) |\n| [0143-reorder-list](https://github.com/Huy-DNA/Leethub/tree/master/0143-reorder-list) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Huy-DNA/Leethub/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0202-happy-number](https://github.com/Huy-DNA/Leethub/tree/master/0202-happy-number) |\n| [0234-palindrome-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0234-palindrome-linked-list) |\n| [0283-move-zeroes](https://github.com/Huy-DNA/Leethub/tree/master/0283-move-zeroes) |\n| [0344-reverse-string](https://github.com/Huy-DNA/Leethub/tree/master/0344-reverse-string) |\n| [0345-reverse-vowels-of-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0345-reverse-vowels-of-a-string) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/Huy-DNA/Leethub/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0557-reverse-words-in-a-string-iii](https://github.com/Huy-DNA/Leethub/tree/master/0557-reverse-words-in-a-string-iii) |\n| [0567-permutation-in-string](https://github.com/Huy-DNA/Leethub/tree/master/0567-permutation-in-string) |\n| [0768-partition-labels](https://github.com/Huy-DNA/Leethub/tree/master/0768-partition-labels) |\n| [0908-middle-of-the-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0908-middle-of-the-linked-list) |\n| [0917-boats-to-save-people](https://github.com/Huy-DNA/Leethub/tree/master/0917-boats-to-save-people) |\n| [1019-squares-of-a-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/1019-squares-of-a-sorted-array) |\n## Prefix Sum\n|  |\n| ------- |\n| [0523-continuous-subarray-sum](https://github.com/Huy-DNA/Leethub/tree/master/0523-continuous-subarray-sum) |\n| [1016-subarray-sums-divisible-by-k](https://github.com/Huy-DNA/Leethub/tree/master/1016-subarray-sums-divisible-by-k) |\n| [1321-get-equal-substrings-within-budget](https://github.com/Huy-DNA/Leethub/tree/master/1321-get-equal-substrings-within-budget) |\n| [1537-maximum-score-after-splitting-a-string](https://github.com/Huy-DNA/Leethub/tree/master/1537-maximum-score-after-splitting-a-string) |\n| [1553-count-triplets-that-can-form-two-arrays-of-equal-xor](https://github.com/Huy-DNA/Leethub/tree/master/1553-count-triplets-that-can-form-two-arrays-of-equal-xor) |\n| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/Huy-DNA/Leethub/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/Huy-DNA/Leethub/tree/master/2059-unique-length-3-palindromic-subsequences) |\n| [2145-grid-game](https://github.com/Huy-DNA/Leethub/tree/master/2145-grid-game) |\n| [2358-number-of-ways-to-split-array](https://github.com/Huy-DNA/Leethub/tree/master/2358-number-of-ways-to-split-array) |\n| [2465-shifting-letters-ii](https://github.com/Huy-DNA/Leethub/tree/master/2465-shifting-letters-ii) |\n| [2691-count-vowel-strings-in-ranges](https://github.com/Huy-DNA/Leethub/tree/master/2691-count-vowel-strings-in-ranges) |\n| [3427-special-array-ii](https://github.com/Huy-DNA/Leethub/tree/master/3427-special-array-ii) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/Huy-DNA/Leethub/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0013-roman-to-integer](https://github.com/Huy-DNA/Leethub/tree/master/0013-roman-to-integer) |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/Huy-DNA/Leethub/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0022-generate-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0022-generate-parentheses) |\n| [0032-longest-valid-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0032-longest-valid-parentheses) |\n| [0126-word-ladder-ii](https://github.com/Huy-DNA/Leethub/tree/master/0126-word-ladder-ii) |\n| [0241-different-ways-to-add-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0241-different-ways-to-add-parentheses) |\n| [0242-valid-anagram](https://github.com/Huy-DNA/Leethub/tree/master/0242-valid-anagram) |\n| [0344-reverse-string](https://github.com/Huy-DNA/Leethub/tree/master/0344-reverse-string) |\n| [0345-reverse-vowels-of-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0345-reverse-vowels-of-a-string) |\n| [0383-ransom-note](https://github.com/Huy-DNA/Leethub/tree/master/0383-ransom-note) |\n| [0387-first-unique-character-in-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0387-first-unique-character-in-a-string) |\n| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |\n| [0557-reverse-words-in-a-string-iii](https://github.com/Huy-DNA/Leethub/tree/master/0557-reverse-words-in-a-string-iii) |\n| [0567-permutation-in-string](https://github.com/Huy-DNA/Leethub/tree/master/0567-permutation-in-string) |\n| [0768-partition-labels](https://github.com/Huy-DNA/Leethub/tree/master/0768-partition-labels) |\n| [0800-letter-case-permutation](https://github.com/Huy-DNA/Leethub/tree/master/0800-letter-case-permutation) |\n| [0822-unique-morse-code-words](https://github.com/Huy-DNA/Leethub/tree/master/0822-unique-morse-code-words) |\n| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Huy-DNA/Leethub/tree/master/1093-recover-a-tree-from-preorder-traversal) |\n| [1160-letter-tile-possibilities](https://github.com/Huy-DNA/Leethub/tree/master/1160-letter-tile-possibilities) |\n| [1197-parsing-a-boolean-expression](https://github.com/Huy-DNA/Leethub/tree/master/1197-parsing-a-boolean-expression) |\n| [1321-get-equal-substrings-within-budget](https://github.com/Huy-DNA/Leethub/tree/master/1321-get-equal-substrings-within-budget) |\n| [1469-minimum-number-of-steps-to-make-two-strings-anagram](https://github.com/Huy-DNA/Leethub/tree/master/1469-minimum-number-of-steps-to-make-two-strings-anagram) |\n| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/Huy-DNA/Leethub/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |\n| [1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one](https://github.com/Huy-DNA/Leethub/tree/master/1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one) |\n| [1524-string-matching-in-an-array](https://github.com/Huy-DNA/Leethub/tree/master/1524-string-matching-in-an-array) |\n| [1537-maximum-score-after-splitting-a-string](https://github.com/Huy-DNA/Leethub/tree/master/1537-maximum-score-after-splitting-a-string) |\n| [1777-determine-if-two-strings-are-close](https://github.com/Huy-DNA/Leethub/tree/master/1777-determine-if-two-strings-are-close) |\n| [1782-smallest-string-with-a-given-numeric-value](https://github.com/Huy-DNA/Leethub/tree/master/1782-smallest-string-with-a-given-numeric-value) |\n| [1823-determine-if-string-halves-are-alike](https://github.com/Huy-DNA/Leethub/tree/master/1823-determine-if-string-halves-are-alike) |\n| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/Huy-DNA/Leethub/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |\n| [1897-maximize-palindrome-length-from-subsequences](https://github.com/Huy-DNA/Leethub/tree/master/1897-maximize-palindrome-length-from-subsequences) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Huy-DNA/Leethub/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/Huy-DNA/Leethub/tree/master/2059-unique-length-3-palindromic-subsequences) |\n| [2107-find-unique-binary-string](https://github.com/Huy-DNA/Leethub/tree/master/2107-find-unique-binary-string) |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/Huy-DNA/Leethub/tree/master/2244-number-of-laser-beams-in-a-bank) |\n| [2292-counting-words-with-a-given-prefix](https://github.com/Huy-DNA/Leethub/tree/master/2292-counting-words-with-a-given-prefix) |\n| [2456-construct-smallest-number-from-di-string](https://github.com/Huy-DNA/Leethub/tree/master/2456-construct-smallest-number-from-di-string) |\n| [2465-shifting-letters-ii](https://github.com/Huy-DNA/Leethub/tree/master/2465-shifting-letters-ii) |\n| [2691-count-vowel-strings-in-ranges](https://github.com/Huy-DNA/Leethub/tree/master/2691-count-vowel-strings-in-ranges) |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Huy-DNA/Leethub/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n| [3379-score-of-a-string](https://github.com/Huy-DNA/Leethub/tree/master/3379-score-of-a-string) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0136-single-number](https://github.com/Huy-DNA/Leethub/tree/master/0136-single-number) |\n| [0190-reverse-bits](https://github.com/Huy-DNA/Leethub/tree/master/0190-reverse-bits) |\n| [0191-number-of-1-bits](https://github.com/Huy-DNA/Leethub/tree/master/0191-number-of-1-bits) |\n| [0231-power-of-two](https://github.com/Huy-DNA/Leethub/tree/master/0231-power-of-two) |\n| [0342-power-of-four](https://github.com/Huy-DNA/Leethub/tree/master/0342-power-of-four) |\n| [0800-letter-case-permutation](https://github.com/Huy-DNA/Leethub/tree/master/0800-letter-case-permutation) |\n| [1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one](https://github.com/Huy-DNA/Leethub/tree/master/1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one) |\n| [1553-count-triplets-that-can-form-two-arrays-of-equal-xor](https://github.com/Huy-DNA/Leethub/tree/master/1553-count-triplets-that-can-form-two-arrays-of-equal-xor) |\n| [1568-pseudo-palindromic-paths-in-a-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1568-pseudo-palindromic-paths-in-a-binary-tree) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/Huy-DNA/Leethub/tree/master/2059-unique-length-3-palindromic-subsequences) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/Huy-DNA/Leethub/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n## Binary Search\n|  |\n| ------- |\n| [0035-search-insert-position](https://github.com/Huy-DNA/Leethub/tree/master/0035-search-insert-position) |\n| [0074-search-a-2d-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0074-search-a-2d-matrix) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Huy-DNA/Leethub/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0278-first-bad-version](https://github.com/Huy-DNA/Leethub/tree/master/0278-first-bad-version) |\n| [0300-longest-increasing-subsequence](https://github.com/Huy-DNA/Leethub/tree/master/0300-longest-increasing-subsequence) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/Huy-DNA/Leethub/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |\n| [0729-my-calendar-i](https://github.com/Huy-DNA/Leethub/tree/master/0729-my-calendar-i) |\n| [0792-binary-search](https://github.com/Huy-DNA/Leethub/tree/master/0792-binary-search) |\n| [1321-get-equal-substrings-within-budget](https://github.com/Huy-DNA/Leethub/tree/master/1321-get-equal-substrings-within-budget) |\n| [1352-maximum-profit-in-job-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1352-maximum-profit-in-job-scheduling) |\n| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/Huy-DNA/Leethub/tree/master/1463-the-k-weakest-rows-in-a-matrix) |\n| [1730-special-array-with-x-elements-greater-than-or-equal-x](https://github.com/Huy-DNA/Leethub/tree/master/1730-special-array-with-x-elements-greater-than-or-equal-x) |\n| [2164-two-best-non-overlapping-events](https://github.com/Huy-DNA/Leethub/tree/master/2164-two-best-non-overlapping-events) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/Huy-DNA/Leethub/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n| [3427-special-array-ii](https://github.com/Huy-DNA/Leethub/tree/master/3427-special-array-ii) |\n## Sliding Window\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/Huy-DNA/Leethub/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0567-permutation-in-string](https://github.com/Huy-DNA/Leethub/tree/master/0567-permutation-in-string) |\n| [1020-longest-turbulent-subarray](https://github.com/Huy-DNA/Leethub/tree/master/1020-longest-turbulent-subarray) |\n| [1321-get-equal-substrings-within-budget](https://github.com/Huy-DNA/Leethub/tree/master/1321-get-equal-substrings-within-budget) |\n| [2866-longest-even-odd-subarray-with-threshold](https://github.com/Huy-DNA/Leethub/tree/master/2866-longest-even-odd-subarray-with-threshold) |\n## Game Theory\n|  |\n| ------- |\n| [0909-stone-game](https://github.com/Huy-DNA/Leethub/tree/master/0909-stone-game) |\n## Stack\n|  |\n| ------- |\n| [0032-longest-valid-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0032-longest-valid-parentheses) |\n| [0042-trapping-rain-water](https://github.com/Huy-DNA/Leethub/tree/master/0042-trapping-rain-water) |\n| [0143-reorder-list](https://github.com/Huy-DNA/Leethub/tree/master/0143-reorder-list) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/Huy-DNA/Leethub/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0234-palindrome-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0234-palindrome-linked-list) |\n| [1197-parsing-a-boolean-expression](https://github.com/Huy-DNA/Leethub/tree/master/1197-parsing-a-boolean-expression) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/Huy-DNA/Leethub/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n| [2456-construct-smallest-number-from-di-string](https://github.com/Huy-DNA/Leethub/tree/master/2456-construct-smallest-number-from-di-string) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0042-trapping-rain-water](https://github.com/Huy-DNA/Leethub/tree/master/0042-trapping-rain-water) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/Huy-DNA/Leethub/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0002-add-two-numbers) |\n| [0024-swap-nodes-in-pairs](https://github.com/Huy-DNA/Leethub/tree/master/0024-swap-nodes-in-pairs) |\n| [0143-reorder-list](https://github.com/Huy-DNA/Leethub/tree/master/0143-reorder-list) |\n| [0203-remove-linked-list-elements](https://github.com/Huy-DNA/Leethub/tree/master/0203-remove-linked-list-elements) |\n| [0206-reverse-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0206-reverse-linked-list) |\n| [0231-power-of-two](https://github.com/Huy-DNA/Leethub/tree/master/0231-power-of-two) |\n| [0233-number-of-digit-one](https://github.com/Huy-DNA/Leethub/tree/master/0233-number-of-digit-one) |\n| [0234-palindrome-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0234-palindrome-linked-list) |\n| [0241-different-ways-to-add-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0241-different-ways-to-add-parentheses) |\n| [0326-power-of-three](https://github.com/Huy-DNA/Leethub/tree/master/0326-power-of-three) |\n| [0342-power-of-four](https://github.com/Huy-DNA/Leethub/tree/master/0342-power-of-four) |\n| [1197-parsing-a-boolean-expression](https://github.com/Huy-DNA/Leethub/tree/master/1197-parsing-a-boolean-expression) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/Huy-DNA/Leethub/tree/master/0070-climbing-stairs) |\n| [0241-different-ways-to-add-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0241-different-ways-to-add-parentheses) |\n## Backtracking\n|  |\n| ------- |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/Huy-DNA/Leethub/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0022-generate-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0022-generate-parentheses) |\n| [0046-permutations](https://github.com/Huy-DNA/Leethub/tree/master/0046-permutations) |\n| [0051-n-queens](https://github.com/Huy-DNA/Leethub/tree/master/0051-n-queens) |\n| [0077-combinations](https://github.com/Huy-DNA/Leethub/tree/master/0077-combinations) |\n| [0113-path-sum-ii](https://github.com/Huy-DNA/Leethub/tree/master/0113-path-sum-ii) |\n| [0126-word-ladder-ii](https://github.com/Huy-DNA/Leethub/tree/master/0126-word-ladder-ii) |\n| [0800-letter-case-permutation](https://github.com/Huy-DNA/Leethub/tree/master/0800-letter-case-permutation) |\n| [1160-letter-tile-possibilities](https://github.com/Huy-DNA/Leethub/tree/master/1160-letter-tile-possibilities) |\n| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/Huy-DNA/Leethub/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |\n| [2107-find-unique-binary-string](https://github.com/Huy-DNA/Leethub/tree/master/2107-find-unique-binary-string) |\n| [2456-construct-smallest-number-from-di-string](https://github.com/Huy-DNA/Leethub/tree/master/2456-construct-smallest-number-from-di-string) |\n## Depth-First Search\n|  |\n| ------- |\n| [0098-validate-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/Huy-DNA/Leethub/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/Huy-DNA/Leethub/tree/master/0101-symmetric-tree) |\n| [0112-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0112-path-sum) |\n| [0113-path-sum-ii](https://github.com/Huy-DNA/Leethub/tree/master/0113-path-sum-ii) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/Huy-DNA/Leethub/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0129-sum-root-to-leaf-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0129-sum-root-to-leaf-numbers) |\n| [0200-number-of-islands](https://github.com/Huy-DNA/Leethub/tree/master/0200-number-of-islands) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0695-max-area-of-island](https://github.com/Huy-DNA/Leethub/tree/master/0695-max-area-of-island) |\n| [0733-flood-fill](https://github.com/Huy-DNA/Leethub/tree/master/0733-flood-fill) |\n| [0820-find-eventual-safe-states](https://github.com/Huy-DNA/Leethub/tree/master/0820-find-eventual-safe-states) |\n| [0904-leaf-similar-trees](https://github.com/Huy-DNA/Leethub/tree/master/0904-leaf-similar-trees) |\n| [0975-range-sum-of-bst](https://github.com/Huy-DNA/Leethub/tree/master/0975-range-sum-of-bst) |\n| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Huy-DNA/Leethub/tree/master/1093-recover-a-tree-from-preorder-traversal) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n| [1396-count-servers-that-communicate](https://github.com/Huy-DNA/Leethub/tree/master/1396-count-servers-that-communicate) |\n| [1568-pseudo-palindromic-paths-in-a-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1568-pseudo-palindromic-paths-in-a-binary-tree) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/Huy-DNA/Leethub/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/Huy-DNA/Leethub/tree/master/0101-symmetric-tree) |\n| [0112-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0112-path-sum) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/Huy-DNA/Leethub/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0126-word-ladder-ii](https://github.com/Huy-DNA/Leethub/tree/master/0126-word-ladder-ii) |\n| [0200-number-of-islands](https://github.com/Huy-DNA/Leethub/tree/master/0200-number-of-islands) |\n| [0542-01-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0542-01-matrix) |\n| [0695-max-area-of-island](https://github.com/Huy-DNA/Leethub/tree/master/0695-max-area-of-island) |\n| [0733-flood-fill](https://github.com/Huy-DNA/Leethub/tree/master/0733-flood-fill) |\n| [0820-find-eventual-safe-states](https://github.com/Huy-DNA/Leethub/tree/master/0820-find-eventual-safe-states) |\n| [1036-rotting-oranges](https://github.com/Huy-DNA/Leethub/tree/master/1036-rotting-oranges) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n| [1396-count-servers-that-communicate](https://github.com/Huy-DNA/Leethub/tree/master/1396-count-servers-that-communicate) |\n| [1568-pseudo-palindromic-paths-in-a-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1568-pseudo-palindromic-paths-in-a-binary-tree) |\n| [1876-map-of-highest-peak](https://github.com/Huy-DNA/Leethub/tree/master/1876-map-of-highest-peak) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/Huy-DNA/Leethub/tree/master/0128-longest-consecutive-sequence) |\n| [0200-number-of-islands](https://github.com/Huy-DNA/Leethub/tree/master/0200-number-of-islands) |\n| [0695-max-area-of-island](https://github.com/Huy-DNA/Leethub/tree/master/0695-max-area-of-island) |\n| [1396-count-servers-that-communicate](https://github.com/Huy-DNA/Leethub/tree/master/1396-count-servers-that-communicate) |\n| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/Huy-DNA/Leethub/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |\n## Matrix\n|  |\n| ------- |\n| [0036-valid-sudoku](https://github.com/Huy-DNA/Leethub/tree/master/0036-valid-sudoku) |\n| [0074-search-a-2d-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0074-search-a-2d-matrix) |\n| [0200-number-of-islands](https://github.com/Huy-DNA/Leethub/tree/master/0200-number-of-islands) |\n| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |\n| [0542-01-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0542-01-matrix) |\n| [0566-reshape-the-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0566-reshape-the-matrix) |\n| [0695-max-area-of-island](https://github.com/Huy-DNA/Leethub/tree/master/0695-max-area-of-island) |\n| [0733-flood-fill](https://github.com/Huy-DNA/Leethub/tree/master/0733-flood-fill) |\n| [0967-minimum-falling-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0967-minimum-falling-path-sum) |\n| [1036-rotting-oranges](https://github.com/Huy-DNA/Leethub/tree/master/1036-rotting-oranges) |\n| [1396-count-servers-that-communicate](https://github.com/Huy-DNA/Leethub/tree/master/1396-count-servers-that-communicate) |\n| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/Huy-DNA/Leethub/tree/master/1463-the-k-weakest-rows-in-a-matrix) |\n| [1876-map-of-highest-peak](https://github.com/Huy-DNA/Leethub/tree/master/1876-map-of-highest-peak) |\n| [2145-grid-game](https://github.com/Huy-DNA/Leethub/tree/master/2145-grid-game) |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/Huy-DNA/Leethub/tree/master/2244-number-of-laser-beams-in-a-bank) |\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0002-add-two-numbers) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/Huy-DNA/Leethub/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0024-swap-nodes-in-pairs](https://github.com/Huy-DNA/Leethub/tree/master/0024-swap-nodes-in-pairs) |\n| [0061-rotate-list](https://github.com/Huy-DNA/Leethub/tree/master/0061-rotate-list) |\n| [0083-remove-duplicates-from-sorted-list](https://github.com/Huy-DNA/Leethub/tree/master/0083-remove-duplicates-from-sorted-list) |\n| [0092-reverse-linked-list-ii](https://github.com/Huy-DNA/Leethub/tree/master/0092-reverse-linked-list-ii) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/Huy-DNA/Leethub/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0138-copy-list-with-random-pointer](https://github.com/Huy-DNA/Leethub/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/Huy-DNA/Leethub/tree/master/0141-linked-list-cycle) |\n| [0143-reorder-list](https://github.com/Huy-DNA/Leethub/tree/master/0143-reorder-list) |\n| [0203-remove-linked-list-elements](https://github.com/Huy-DNA/Leethub/tree/master/0203-remove-linked-list-elements) |\n| [0206-reverse-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0234-palindrome-linked-list) |\n| [0725-split-linked-list-in-parts](https://github.com/Huy-DNA/Leethub/tree/master/0725-split-linked-list-in-parts) |\n| [0908-middle-of-the-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0908-middle-of-the-linked-list) |\n## Bucket Sort\n|  |\n| ------- |\n| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |\n## Tree\n|  |\n| ------- |\n| [0098-validate-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/Huy-DNA/Leethub/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/Huy-DNA/Leethub/tree/master/0101-symmetric-tree) |\n| [0112-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0112-path-sum) |\n| [0113-path-sum-ii](https://github.com/Huy-DNA/Leethub/tree/master/0113-path-sum-ii) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/Huy-DNA/Leethub/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0129-sum-root-to-leaf-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0129-sum-root-to-leaf-numbers) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |\n| [0904-leaf-similar-trees](https://github.com/Huy-DNA/Leethub/tree/master/0904-leaf-similar-trees) |\n| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Huy-DNA/Leethub/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |\n| [0975-range-sum-of-bst](https://github.com/Huy-DNA/Leethub/tree/master/0975-range-sum-of-bst) |\n| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Huy-DNA/Leethub/tree/master/1093-recover-a-tree-from-preorder-traversal) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n| [1568-pseudo-palindromic-paths-in-a-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1568-pseudo-palindromic-paths-in-a-binary-tree) |\n## Binary Tree\n|  |\n| ------- |\n| [0098-validate-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/Huy-DNA/Leethub/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/Huy-DNA/Leethub/tree/master/0101-symmetric-tree) |\n| [0112-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0112-path-sum) |\n| [0113-path-sum-ii](https://github.com/Huy-DNA/Leethub/tree/master/0113-path-sum-ii) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/Huy-DNA/Leethub/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0124-binary-tree-maximum-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0124-binary-tree-maximum-path-sum) |\n| [0129-sum-root-to-leaf-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0129-sum-root-to-leaf-numbers) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |\n| [0904-leaf-similar-trees](https://github.com/Huy-DNA/Leethub/tree/master/0904-leaf-similar-trees) |\n| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Huy-DNA/Leethub/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |\n| [0975-range-sum-of-bst](https://github.com/Huy-DNA/Leethub/tree/master/0975-range-sum-of-bst) |\n| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Huy-DNA/Leethub/tree/master/1093-recover-a-tree-from-preorder-traversal) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n| [1568-pseudo-palindromic-paths-in-a-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1568-pseudo-palindromic-paths-in-a-binary-tree) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0098-validate-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0098-validate-binary-search-tree) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |\n| [0975-range-sum-of-bst](https://github.com/Huy-DNA/Leethub/tree/master/0975-range-sum-of-bst) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0053-maximum-subarray](https://github.com/Huy-DNA/Leethub/tree/master/0053-maximum-subarray) |\n| [0190-reverse-bits](https://github.com/Huy-DNA/Leethub/tree/master/0190-reverse-bits) |\n| [0191-number-of-1-bits](https://github.com/Huy-DNA/Leethub/tree/master/0191-number-of-1-bits) |\n| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Huy-DNA/Leethub/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |\n## Simulation\n|  |\n| ------- |\n| [0566-reshape-the-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0566-reshape-the-matrix) |\n| [2274-keep-multiplying-found-values-by-two](https://github.com/Huy-DNA/Leethub/tree/master/2274-keep-multiplying-found-values-by-two) |\n## Queue\n|  |\n| ------- |\n| [0387-first-unique-character-in-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0387-first-unique-character-in-a-string) |\n## Combinatorics\n|  |\n| ------- |\n| [0062-unique-paths](https://github.com/Huy-DNA/Leethub/tree/master/0062-unique-paths) |\n| [0458-poor-pigs](https://github.com/Huy-DNA/Leethub/tree/master/0458-poor-pigs) |\n## Design\n|  |\n| ------- |\n| [0307-range-sum-query-mutable](https://github.com/Huy-DNA/Leethub/tree/master/0307-range-sum-query-mutable) |\n| [0729-my-calendar-i](https://github.com/Huy-DNA/Leethub/tree/master/0729-my-calendar-i) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |\n| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |\n## Segment Tree\n|  |\n| ------- |\n| [0307-range-sum-query-mutable](https://github.com/Huy-DNA/Leethub/tree/master/0307-range-sum-query-mutable) |\n| [0729-my-calendar-i](https://github.com/Huy-DNA/Leethub/tree/master/0729-my-calendar-i) |\n## Ordered Set\n|  |\n| ------- |\n| [0729-my-calendar-i](https://github.com/Huy-DNA/Leethub/tree/master/0729-my-calendar-i) |\n## Interactive\n|  |\n| ------- |\n| [0278-first-bad-version](https://github.com/Huy-DNA/Leethub/tree/master/0278-first-bad-version) |\n## Binary Indexed Tree\n|  |\n| ------- |\n| [0307-range-sum-query-mutable](https://github.com/Huy-DNA/Leethub/tree/master/0307-range-sum-query-mutable) |\n## Data Stream\n|  |\n| ------- |\n| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |\n## String Matching\n|  |\n| ------- |\n| [1524-string-matching-in-an-array](https://github.com/Huy-DNA/Leethub/tree/master/1524-string-matching-in-an-array) |\n| [2292-counting-words-with-a-given-prefix](https://github.com/Huy-DNA/Leethub/tree/master/2292-counting-words-with-a-given-prefix) |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Huy-DNA/Leethub/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n## Trie\n|  |\n| ------- |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Huy-DNA/Leethub/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n## Rolling Hash\n|  |\n| ------- |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Huy-DNA/Leethub/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n## Hash Function\n|  |\n| ------- |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Huy-DNA/Leethub/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n## Graph\n|  |\n| ------- |\n| [0820-find-eventual-safe-states](https://github.com/Huy-DNA/Leethub/tree/master/0820-find-eventual-safe-states) |\n## Topological Sort\n|  |\n| ------- |\n| [0820-find-eventual-safe-states](https://github.com/Huy-DNA/Leethub/tree/master/0820-find-eventual-safe-states) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuy-dna%2Fleethub","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhuy-dna%2Fleethub","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuy-dna%2Fleethub/lists"}