Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/huy-dna/leethub
A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
https://github.com/huy-dna/leethub
leetcode
Last synced: about 1 month ago
JSON representation
A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
- Host: GitHub
- URL: https://github.com/huy-dna/leethub
- Owner: Huy-DNA
- Created: 2024-11-20T18:01:14.000Z (2 months ago)
- Default Branch: main
- Last Pushed: 2024-12-08T19:32:47.000Z (about 2 months ago)
- Last Synced: 2024-12-08T20:25:37.429Z (about 2 months ago)
- Topics: leetcode
- Language: C++
- Homepage:
- Size: 507 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Leethub
A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
# LeetCode Topics
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/Huy-DNA/Leethub/tree/master/0001-two-sum) |
| [0011-container-with-most-water](https://github.com/Huy-DNA/Leethub/tree/master/0011-container-with-most-water) |
| [0035-search-insert-position](https://github.com/Huy-DNA/Leethub/tree/master/0035-search-insert-position) |
| [0036-valid-sudoku](https://github.com/Huy-DNA/Leethub/tree/master/0036-valid-sudoku) |
| [0042-trapping-rain-water](https://github.com/Huy-DNA/Leethub/tree/master/0042-trapping-rain-water) |
| [0046-permutations](https://github.com/Huy-DNA/Leethub/tree/master/0046-permutations) |
| [0051-n-queens](https://github.com/Huy-DNA/Leethub/tree/master/0051-n-queens) |
| [0053-maximum-subarray](https://github.com/Huy-DNA/Leethub/tree/master/0053-maximum-subarray) |
| [0074-search-a-2d-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0074-search-a-2d-matrix) |
| [0075-sort-colors](https://github.com/Huy-DNA/Leethub/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/0088-merge-sorted-array) |
| [0118-pascals-triangle](https://github.com/Huy-DNA/Leethub/tree/master/0118-pascals-triangle) |
| [0120-triangle](https://github.com/Huy-DNA/Leethub/tree/master/0120-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Huy-DNA/Leethub/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [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) |
| [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) |
| [0128-longest-consecutive-sequence](https://github.com/Huy-DNA/Leethub/tree/master/0128-longest-consecutive-sequence) |
| [0136-single-number](https://github.com/Huy-DNA/Leethub/tree/master/0136-single-number) |
| [0150-evaluate-reverse-polish-notation](https://github.com/Huy-DNA/Leethub/tree/master/0150-evaluate-reverse-polish-notation) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Huy-DNA/Leethub/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0198-house-robber](https://github.com/Huy-DNA/Leethub/tree/master/0198-house-robber) |
| [0200-number-of-islands](https://github.com/Huy-DNA/Leethub/tree/master/0200-number-of-islands) |
| [0213-house-robber-ii](https://github.com/Huy-DNA/Leethub/tree/master/0213-house-robber-ii) |
| [0217-contains-duplicate](https://github.com/Huy-DNA/Leethub/tree/master/0217-contains-duplicate) |
| [0283-move-zeroes](https://github.com/Huy-DNA/Leethub/tree/master/0283-move-zeroes) |
| [0300-longest-increasing-subsequence](https://github.com/Huy-DNA/Leethub/tree/master/0300-longest-increasing-subsequence) |
| [0307-range-sum-query-mutable](https://github.com/Huy-DNA/Leethub/tree/master/0307-range-sum-query-mutable) |
| [0330-patching-array](https://github.com/Huy-DNA/Leethub/tree/master/0330-patching-array) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Huy-DNA/Leethub/tree/master/0350-intersection-of-two-arrays-ii) |
| [0368-largest-divisible-subset](https://github.com/Huy-DNA/Leethub/tree/master/0368-largest-divisible-subset) |
| [0377-combination-sum-iv](https://github.com/Huy-DNA/Leethub/tree/master/0377-combination-sum-iv) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0446-arithmetic-slices-ii-subsequence](https://github.com/Huy-DNA/Leethub/tree/master/0446-arithmetic-slices-ii-subsequence) |
| [0502-ipo](https://github.com/Huy-DNA/Leethub/tree/master/0502-ipo) |
| [0523-continuous-subarray-sum](https://github.com/Huy-DNA/Leethub/tree/master/0523-continuous-subarray-sum) |
| [0542-01-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0542-01-matrix) |
| [0566-reshape-the-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0566-reshape-the-matrix) |
| [0695-max-area-of-island](https://github.com/Huy-DNA/Leethub/tree/master/0695-max-area-of-island) |
| [0729-my-calendar-i](https://github.com/Huy-DNA/Leethub/tree/master/0729-my-calendar-i) |
| [0733-flood-fill](https://github.com/Huy-DNA/Leethub/tree/master/0733-flood-fill) |
| [0748-largest-number-at-least-twice-of-others](https://github.com/Huy-DNA/Leethub/tree/master/0748-largest-number-at-least-twice-of-others) |
| [0792-binary-search](https://github.com/Huy-DNA/Leethub/tree/master/0792-binary-search) |
| [0822-unique-morse-code-words](https://github.com/Huy-DNA/Leethub/tree/master/0822-unique-morse-code-words) |
| [0843-binary-trees-with-factors](https://github.com/Huy-DNA/Leethub/tree/master/0843-binary-trees-with-factors) |
| [0909-stone-game](https://github.com/Huy-DNA/Leethub/tree/master/0909-stone-game) |
| [0917-boats-to-save-people](https://github.com/Huy-DNA/Leethub/tree/master/0917-boats-to-save-people) |
| [0967-minimum-falling-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0967-minimum-falling-path-sum) |
| [1016-subarray-sums-divisible-by-k](https://github.com/Huy-DNA/Leethub/tree/master/1016-subarray-sums-divisible-by-k) |
| [1019-squares-of-a-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/1019-squares-of-a-sorted-array) |
| [1020-longest-turbulent-subarray](https://github.com/Huy-DNA/Leethub/tree/master/1020-longest-turbulent-subarray) |
| [1036-rotting-oranges](https://github.com/Huy-DNA/Leethub/tree/master/1036-rotting-oranges) |
| [1049-minimum-domino-rotations-for-equal-row](https://github.com/Huy-DNA/Leethub/tree/master/1049-minimum-domino-rotations-for-equal-row) |
| [1095-two-city-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1095-two-city-scheduling) |
| [1127-last-stone-weight](https://github.com/Huy-DNA/Leethub/tree/master/1127-last-stone-weight) |
| [1137-height-checker](https://github.com/Huy-DNA/Leethub/tree/master/1137-height-checker) |
| [1352-maximum-profit-in-job-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1352-maximum-profit-in-job-scheduling) |
| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/Huy-DNA/Leethub/tree/master/1463-the-k-weakest-rows-in-a-matrix) |
| [1464-reduce-array-size-to-the-half](https://github.com/Huy-DNA/Leethub/tree/master/1464-reduce-array-size-to-the-half) |
| [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) |
| [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) |
| [2117-find-original-array-from-doubled-array](https://github.com/Huy-DNA/Leethub/tree/master/2117-find-original-array-from-doubled-array) |
| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/Huy-DNA/Leethub/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |
| [2164-two-best-non-overlapping-events](https://github.com/Huy-DNA/Leethub/tree/master/2164-two-best-non-overlapping-events) |
| [2244-number-of-laser-beams-in-a-bank](https://github.com/Huy-DNA/Leethub/tree/master/2244-number-of-laser-beams-in-a-bank) |
| [2274-keep-multiplying-found-values-by-two](https://github.com/Huy-DNA/Leethub/tree/master/2274-keep-multiplying-found-values-by-two) |
| [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) |
| [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) |
| [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) |
| [3427-special-array-ii](https://github.com/Huy-DNA/Leethub/tree/master/3427-special-array-ii) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/Huy-DNA/Leethub/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/Huy-DNA/Leethub/tree/master/0003-longest-substring-without-repeating-characters) |
| [0013-roman-to-integer](https://github.com/Huy-DNA/Leethub/tree/master/0013-roman-to-integer) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/Huy-DNA/Leethub/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0036-valid-sudoku](https://github.com/Huy-DNA/Leethub/tree/master/0036-valid-sudoku) |
| [0126-word-ladder-ii](https://github.com/Huy-DNA/Leethub/tree/master/0126-word-ladder-ii) |
| [0128-longest-consecutive-sequence](https://github.com/Huy-DNA/Leethub/tree/master/0128-longest-consecutive-sequence) |
| [0138-copy-list-with-random-pointer](https://github.com/Huy-DNA/Leethub/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/Huy-DNA/Leethub/tree/master/0141-linked-list-cycle) |
| [0202-happy-number](https://github.com/Huy-DNA/Leethub/tree/master/0202-happy-number) |
| [0217-contains-duplicate](https://github.com/Huy-DNA/Leethub/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/Huy-DNA/Leethub/tree/master/0242-valid-anagram) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Huy-DNA/Leethub/tree/master/0350-intersection-of-two-arrays-ii) |
| [0383-ransom-note](https://github.com/Huy-DNA/Leethub/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0387-first-unique-character-in-a-string) |
| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |
| [0523-continuous-subarray-sum](https://github.com/Huy-DNA/Leethub/tree/master/0523-continuous-subarray-sum) |
| [0567-permutation-in-string](https://github.com/Huy-DNA/Leethub/tree/master/0567-permutation-in-string) |
| [0768-partition-labels](https://github.com/Huy-DNA/Leethub/tree/master/0768-partition-labels) |
| [0822-unique-morse-code-words](https://github.com/Huy-DNA/Leethub/tree/master/0822-unique-morse-code-words) |
| [0843-binary-trees-with-factors](https://github.com/Huy-DNA/Leethub/tree/master/0843-binary-trees-with-factors) |
| [1016-subarray-sums-divisible-by-k](https://github.com/Huy-DNA/Leethub/tree/master/1016-subarray-sums-divisible-by-k) |
| [1464-reduce-array-size-to-the-half](https://github.com/Huy-DNA/Leethub/tree/master/1464-reduce-array-size-to-the-half) |
| [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) |
| [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) |
| [1777-determine-if-two-strings-are-close](https://github.com/Huy-DNA/Leethub/tree/master/1777-determine-if-two-strings-are-close) |
| [2117-find-original-array-from-doubled-array](https://github.com/Huy-DNA/Leethub/tree/master/2117-find-original-array-from-doubled-array) |
| [2274-keep-multiplying-found-values-by-two](https://github.com/Huy-DNA/Leethub/tree/master/2274-keep-multiplying-found-values-by-two) |
| [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) |
| [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) |
| [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) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0002-add-two-numbers) |
| [0009-palindrome-number](https://github.com/Huy-DNA/Leethub/tree/master/0009-palindrome-number) |
| [0013-roman-to-integer](https://github.com/Huy-DNA/Leethub/tree/master/0013-roman-to-integer) |
| [0062-unique-paths](https://github.com/Huy-DNA/Leethub/tree/master/0062-unique-paths) |
| [0070-climbing-stairs](https://github.com/Huy-DNA/Leethub/tree/master/0070-climbing-stairs) |
| [0150-evaluate-reverse-polish-notation](https://github.com/Huy-DNA/Leethub/tree/master/0150-evaluate-reverse-polish-notation) |
| [0202-happy-number](https://github.com/Huy-DNA/Leethub/tree/master/0202-happy-number) |
| [0231-power-of-two](https://github.com/Huy-DNA/Leethub/tree/master/0231-power-of-two) |
| [0233-number-of-digit-one](https://github.com/Huy-DNA/Leethub/tree/master/0233-number-of-digit-one) |
| [0241-different-ways-to-add-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0241-different-ways-to-add-parentheses) |
| [0326-power-of-three](https://github.com/Huy-DNA/Leethub/tree/master/0326-power-of-three) |
| [0342-power-of-four](https://github.com/Huy-DNA/Leethub/tree/master/0342-power-of-four) |
| [0343-integer-break](https://github.com/Huy-DNA/Leethub/tree/master/0343-integer-break) |
| [0368-largest-divisible-subset](https://github.com/Huy-DNA/Leethub/tree/master/0368-largest-divisible-subset) |
| [0458-poor-pigs](https://github.com/Huy-DNA/Leethub/tree/master/0458-poor-pigs) |
| [0523-continuous-subarray-sum](https://github.com/Huy-DNA/Leethub/tree/master/0523-continuous-subarray-sum) |
| [0650-2-keys-keyboard](https://github.com/Huy-DNA/Leethub/tree/master/0650-2-keys-keyboard) |
| [0909-stone-game](https://github.com/Huy-DNA/Leethub/tree/master/0909-stone-game) |
| [1033-broken-calculator](https://github.com/Huy-DNA/Leethub/tree/master/1033-broken-calculator) |
| [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) |
| [2244-number-of-laser-beams-in-a-bank](https://github.com/Huy-DNA/Leethub/tree/master/2244-number-of-laser-beams-in-a-bank) |
## Dynamic Programming
| |
| ------- |
| [0022-generate-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0022-generate-parentheses) |
| [0032-longest-valid-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0032-longest-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/Huy-DNA/Leethub/tree/master/0042-trapping-rain-water) |
| [0053-maximum-subarray](https://github.com/Huy-DNA/Leethub/tree/master/0053-maximum-subarray) |
| [0062-unique-paths](https://github.com/Huy-DNA/Leethub/tree/master/0062-unique-paths) |
| [0070-climbing-stairs](https://github.com/Huy-DNA/Leethub/tree/master/0070-climbing-stairs) |
| [0118-pascals-triangle](https://github.com/Huy-DNA/Leethub/tree/master/0118-pascals-triangle) |
| [0120-triangle](https://github.com/Huy-DNA/Leethub/tree/master/0120-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Huy-DNA/Leethub/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [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) |
| [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) |
| [0124-binary-tree-maximum-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0124-binary-tree-maximum-path-sum) |
| [0198-house-robber](https://github.com/Huy-DNA/Leethub/tree/master/0198-house-robber) |
| [0213-house-robber-ii](https://github.com/Huy-DNA/Leethub/tree/master/0213-house-robber-ii) |
| [0233-number-of-digit-one](https://github.com/Huy-DNA/Leethub/tree/master/0233-number-of-digit-one) |
| [0241-different-ways-to-add-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0241-different-ways-to-add-parentheses) |
| [0300-longest-increasing-subsequence](https://github.com/Huy-DNA/Leethub/tree/master/0300-longest-increasing-subsequence) |
| [0343-integer-break](https://github.com/Huy-DNA/Leethub/tree/master/0343-integer-break) |
| [0368-largest-divisible-subset](https://github.com/Huy-DNA/Leethub/tree/master/0368-largest-divisible-subset) |
| [0377-combination-sum-iv](https://github.com/Huy-DNA/Leethub/tree/master/0377-combination-sum-iv) |
| [0446-arithmetic-slices-ii-subsequence](https://github.com/Huy-DNA/Leethub/tree/master/0446-arithmetic-slices-ii-subsequence) |
| [0458-poor-pigs](https://github.com/Huy-DNA/Leethub/tree/master/0458-poor-pigs) |
| [0542-01-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0542-01-matrix) |
| [0650-2-keys-keyboard](https://github.com/Huy-DNA/Leethub/tree/master/0650-2-keys-keyboard) |
| [0843-binary-trees-with-factors](https://github.com/Huy-DNA/Leethub/tree/master/0843-binary-trees-with-factors) |
| [0909-stone-game](https://github.com/Huy-DNA/Leethub/tree/master/0909-stone-game) |
| [0967-minimum-falling-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0967-minimum-falling-path-sum) |
| [1020-longest-turbulent-subarray](https://github.com/Huy-DNA/Leethub/tree/master/1020-longest-turbulent-subarray) |
| [1332-count-vowels-permutation](https://github.com/Huy-DNA/Leethub/tree/master/1332-count-vowels-permutation) |
| [1352-maximum-profit-in-job-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1352-maximum-profit-in-job-scheduling) |
| [1897-maximize-palindrome-length-from-subsequences](https://github.com/Huy-DNA/Leethub/tree/master/1897-maximize-palindrome-length-from-subsequences) |
| [2164-two-best-non-overlapping-events](https://github.com/Huy-DNA/Leethub/tree/master/2164-two-best-non-overlapping-events) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Huy-DNA/Leethub/tree/master/0011-container-with-most-water) |
| [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) |
| [0330-patching-array](https://github.com/Huy-DNA/Leethub/tree/master/0330-patching-array) |
| [0502-ipo](https://github.com/Huy-DNA/Leethub/tree/master/0502-ipo) |
| [0768-partition-labels](https://github.com/Huy-DNA/Leethub/tree/master/0768-partition-labels) |
| [0917-boats-to-save-people](https://github.com/Huy-DNA/Leethub/tree/master/0917-boats-to-save-people) |
| [1033-broken-calculator](https://github.com/Huy-DNA/Leethub/tree/master/1033-broken-calculator) |
| [1049-minimum-domino-rotations-for-equal-row](https://github.com/Huy-DNA/Leethub/tree/master/1049-minimum-domino-rotations-for-equal-row) |
| [1095-two-city-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1095-two-city-scheduling) |
| [1464-reduce-array-size-to-the-half](https://github.com/Huy-DNA/Leethub/tree/master/1464-reduce-array-size-to-the-half) |
| [1782-smallest-string-with-a-given-numeric-value](https://github.com/Huy-DNA/Leethub/tree/master/1782-smallest-string-with-a-given-numeric-value) |
| [2117-find-original-array-from-doubled-array](https://github.com/Huy-DNA/Leethub/tree/master/2117-find-original-array-from-doubled-array) |
| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/Huy-DNA/Leethub/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |
| [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) |
## Sorting
| |
| ------- |
| [0075-sort-colors](https://github.com/Huy-DNA/Leethub/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/0088-merge-sorted-array) |
| [0217-contains-duplicate](https://github.com/Huy-DNA/Leethub/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/Huy-DNA/Leethub/tree/master/0242-valid-anagram) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Huy-DNA/Leethub/tree/master/0350-intersection-of-two-arrays-ii) |
| [0368-largest-divisible-subset](https://github.com/Huy-DNA/Leethub/tree/master/0368-largest-divisible-subset) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |
| [0502-ipo](https://github.com/Huy-DNA/Leethub/tree/master/0502-ipo) |
| [0748-largest-number-at-least-twice-of-others](https://github.com/Huy-DNA/Leethub/tree/master/0748-largest-number-at-least-twice-of-others) |
| [0843-binary-trees-with-factors](https://github.com/Huy-DNA/Leethub/tree/master/0843-binary-trees-with-factors) |
| [0917-boats-to-save-people](https://github.com/Huy-DNA/Leethub/tree/master/0917-boats-to-save-people) |
| [1019-squares-of-a-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/1019-squares-of-a-sorted-array) |
| [1095-two-city-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1095-two-city-scheduling) |
| [1137-height-checker](https://github.com/Huy-DNA/Leethub/tree/master/1137-height-checker) |
| [1352-maximum-profit-in-job-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1352-maximum-profit-in-job-scheduling) |
| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/Huy-DNA/Leethub/tree/master/1463-the-k-weakest-rows-in-a-matrix) |
| [1464-reduce-array-size-to-the-half](https://github.com/Huy-DNA/Leethub/tree/master/1464-reduce-array-size-to-the-half) |
| [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) |
| [1777-determine-if-two-strings-are-close](https://github.com/Huy-DNA/Leethub/tree/master/1777-determine-if-two-strings-are-close) |
| [2117-find-original-array-from-doubled-array](https://github.com/Huy-DNA/Leethub/tree/master/2117-find-original-array-from-doubled-array) |
| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/Huy-DNA/Leethub/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |
| [2164-two-best-non-overlapping-events](https://github.com/Huy-DNA/Leethub/tree/master/2164-two-best-non-overlapping-events) |
| [2274-keep-multiplying-found-values-by-two](https://github.com/Huy-DNA/Leethub/tree/master/2274-keep-multiplying-found-values-by-two) |
| [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) |
## Heap (Priority Queue)
| |
| ------- |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |
| [0502-ipo](https://github.com/Huy-DNA/Leethub/tree/master/0502-ipo) |
| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |
| [1127-last-stone-weight](https://github.com/Huy-DNA/Leethub/tree/master/1127-last-stone-weight) |
| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/Huy-DNA/Leethub/tree/master/1463-the-k-weakest-rows-in-a-matrix) |
| [1464-reduce-array-size-to-the-half](https://github.com/Huy-DNA/Leethub/tree/master/1464-reduce-array-size-to-the-half) |
| [2164-two-best-non-overlapping-events](https://github.com/Huy-DNA/Leethub/tree/master/2164-two-best-non-overlapping-events) |
## Counting Sort
| |
| ------- |
| [0383-ransom-note](https://github.com/Huy-DNA/Leethub/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0387-first-unique-character-in-a-string) |
| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |
| [1137-height-checker](https://github.com/Huy-DNA/Leethub/tree/master/1137-height-checker) |
| [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) |
| [1777-determine-if-two-strings-are-close](https://github.com/Huy-DNA/Leethub/tree/master/1777-determine-if-two-strings-are-close) |
| [1823-determine-if-string-halves-are-alike](https://github.com/Huy-DNA/Leethub/tree/master/1823-determine-if-string-halves-are-alike) |
| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/Huy-DNA/Leethub/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |
| [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) |
## Two Pointers
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Huy-DNA/Leethub/tree/master/0011-container-with-most-water) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Huy-DNA/Leethub/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0042-trapping-rain-water](https://github.com/Huy-DNA/Leethub/tree/master/0042-trapping-rain-water) |
| [0061-rotate-list](https://github.com/Huy-DNA/Leethub/tree/master/0061-rotate-list) |
| [0075-sort-colors](https://github.com/Huy-DNA/Leethub/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/0088-merge-sorted-array) |
| [0141-linked-list-cycle](https://github.com/Huy-DNA/Leethub/tree/master/0141-linked-list-cycle) |
| [0143-reorder-list](https://github.com/Huy-DNA/Leethub/tree/master/0143-reorder-list) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Huy-DNA/Leethub/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0202-happy-number](https://github.com/Huy-DNA/Leethub/tree/master/0202-happy-number) |
| [0234-palindrome-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0234-palindrome-linked-list) |
| [0283-move-zeroes](https://github.com/Huy-DNA/Leethub/tree/master/0283-move-zeroes) |
| [0344-reverse-string](https://github.com/Huy-DNA/Leethub/tree/master/0344-reverse-string) |
| [0345-reverse-vowels-of-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0345-reverse-vowels-of-a-string) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Huy-DNA/Leethub/tree/master/0350-intersection-of-two-arrays-ii) |
| [0557-reverse-words-in-a-string-iii](https://github.com/Huy-DNA/Leethub/tree/master/0557-reverse-words-in-a-string-iii) |
| [0567-permutation-in-string](https://github.com/Huy-DNA/Leethub/tree/master/0567-permutation-in-string) |
| [0768-partition-labels](https://github.com/Huy-DNA/Leethub/tree/master/0768-partition-labels) |
| [0908-middle-of-the-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0908-middle-of-the-linked-list) |
| [0917-boats-to-save-people](https://github.com/Huy-DNA/Leethub/tree/master/0917-boats-to-save-people) |
| [1019-squares-of-a-sorted-array](https://github.com/Huy-DNA/Leethub/tree/master/1019-squares-of-a-sorted-array) |
## Prefix Sum
| |
| ------- |
| [0523-continuous-subarray-sum](https://github.com/Huy-DNA/Leethub/tree/master/0523-continuous-subarray-sum) |
| [1016-subarray-sums-divisible-by-k](https://github.com/Huy-DNA/Leethub/tree/master/1016-subarray-sums-divisible-by-k) |
| [1321-get-equal-substrings-within-budget](https://github.com/Huy-DNA/Leethub/tree/master/1321-get-equal-substrings-within-budget) |
| [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) |
| [3427-special-array-ii](https://github.com/Huy-DNA/Leethub/tree/master/3427-special-array-ii) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Huy-DNA/Leethub/tree/master/0003-longest-substring-without-repeating-characters) |
| [0013-roman-to-integer](https://github.com/Huy-DNA/Leethub/tree/master/0013-roman-to-integer) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/Huy-DNA/Leethub/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0022-generate-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0022-generate-parentheses) |
| [0032-longest-valid-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0032-longest-valid-parentheses) |
| [0126-word-ladder-ii](https://github.com/Huy-DNA/Leethub/tree/master/0126-word-ladder-ii) |
| [0241-different-ways-to-add-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0241-different-ways-to-add-parentheses) |
| [0242-valid-anagram](https://github.com/Huy-DNA/Leethub/tree/master/0242-valid-anagram) |
| [0344-reverse-string](https://github.com/Huy-DNA/Leethub/tree/master/0344-reverse-string) |
| [0345-reverse-vowels-of-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0345-reverse-vowels-of-a-string) |
| [0383-ransom-note](https://github.com/Huy-DNA/Leethub/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0387-first-unique-character-in-a-string) |
| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |
| [0557-reverse-words-in-a-string-iii](https://github.com/Huy-DNA/Leethub/tree/master/0557-reverse-words-in-a-string-iii) |
| [0567-permutation-in-string](https://github.com/Huy-DNA/Leethub/tree/master/0567-permutation-in-string) |
| [0768-partition-labels](https://github.com/Huy-DNA/Leethub/tree/master/0768-partition-labels) |
| [0800-letter-case-permutation](https://github.com/Huy-DNA/Leethub/tree/master/0800-letter-case-permutation) |
| [0822-unique-morse-code-words](https://github.com/Huy-DNA/Leethub/tree/master/0822-unique-morse-code-words) |
| [1197-parsing-a-boolean-expression](https://github.com/Huy-DNA/Leethub/tree/master/1197-parsing-a-boolean-expression) |
| [1321-get-equal-substrings-within-budget](https://github.com/Huy-DNA/Leethub/tree/master/1321-get-equal-substrings-within-budget) |
| [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) |
| [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) |
| [1777-determine-if-two-strings-are-close](https://github.com/Huy-DNA/Leethub/tree/master/1777-determine-if-two-strings-are-close) |
| [1782-smallest-string-with-a-given-numeric-value](https://github.com/Huy-DNA/Leethub/tree/master/1782-smallest-string-with-a-given-numeric-value) |
| [1823-determine-if-string-halves-are-alike](https://github.com/Huy-DNA/Leethub/tree/master/1823-determine-if-string-halves-are-alike) |
| [1897-maximize-palindrome-length-from-subsequences](https://github.com/Huy-DNA/Leethub/tree/master/1897-maximize-palindrome-length-from-subsequences) |
| [2244-number-of-laser-beams-in-a-bank](https://github.com/Huy-DNA/Leethub/tree/master/2244-number-of-laser-beams-in-a-bank) |
| [3379-score-of-a-string](https://github.com/Huy-DNA/Leethub/tree/master/3379-score-of-a-string) |
## Bit Manipulation
| |
| ------- |
| [0136-single-number](https://github.com/Huy-DNA/Leethub/tree/master/0136-single-number) |
| [0190-reverse-bits](https://github.com/Huy-DNA/Leethub/tree/master/0190-reverse-bits) |
| [0191-number-of-1-bits](https://github.com/Huy-DNA/Leethub/tree/master/0191-number-of-1-bits) |
| [0231-power-of-two](https://github.com/Huy-DNA/Leethub/tree/master/0231-power-of-two) |
| [0342-power-of-four](https://github.com/Huy-DNA/Leethub/tree/master/0342-power-of-four) |
| [0800-letter-case-permutation](https://github.com/Huy-DNA/Leethub/tree/master/0800-letter-case-permutation) |
| [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) |
| [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) |
| [1568-pseudo-palindromic-paths-in-a-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1568-pseudo-palindromic-paths-in-a-binary-tree) |
| [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) |
## Binary Search
| |
| ------- |
| [0035-search-insert-position](https://github.com/Huy-DNA/Leethub/tree/master/0035-search-insert-position) |
| [0074-search-a-2d-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0074-search-a-2d-matrix) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Huy-DNA/Leethub/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0278-first-bad-version](https://github.com/Huy-DNA/Leethub/tree/master/0278-first-bad-version) |
| [0300-longest-increasing-subsequence](https://github.com/Huy-DNA/Leethub/tree/master/0300-longest-increasing-subsequence) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Huy-DNA/Leethub/tree/master/0350-intersection-of-two-arrays-ii) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0729-my-calendar-i](https://github.com/Huy-DNA/Leethub/tree/master/0729-my-calendar-i) |
| [0792-binary-search](https://github.com/Huy-DNA/Leethub/tree/master/0792-binary-search) |
| [1321-get-equal-substrings-within-budget](https://github.com/Huy-DNA/Leethub/tree/master/1321-get-equal-substrings-within-budget) |
| [1352-maximum-profit-in-job-scheduling](https://github.com/Huy-DNA/Leethub/tree/master/1352-maximum-profit-in-job-scheduling) |
| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/Huy-DNA/Leethub/tree/master/1463-the-k-weakest-rows-in-a-matrix) |
| [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) |
| [2164-two-best-non-overlapping-events](https://github.com/Huy-DNA/Leethub/tree/master/2164-two-best-non-overlapping-events) |
| [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) |
| [3427-special-array-ii](https://github.com/Huy-DNA/Leethub/tree/master/3427-special-array-ii) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Huy-DNA/Leethub/tree/master/0003-longest-substring-without-repeating-characters) |
| [0567-permutation-in-string](https://github.com/Huy-DNA/Leethub/tree/master/0567-permutation-in-string) |
| [1020-longest-turbulent-subarray](https://github.com/Huy-DNA/Leethub/tree/master/1020-longest-turbulent-subarray) |
| [1321-get-equal-substrings-within-budget](https://github.com/Huy-DNA/Leethub/tree/master/1321-get-equal-substrings-within-budget) |
## Game Theory
| |
| ------- |
| [0909-stone-game](https://github.com/Huy-DNA/Leethub/tree/master/0909-stone-game) |
## Stack
| |
| ------- |
| [0032-longest-valid-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0032-longest-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/Huy-DNA/Leethub/tree/master/0042-trapping-rain-water) |
| [0143-reorder-list](https://github.com/Huy-DNA/Leethub/tree/master/0143-reorder-list) |
| [0150-evaluate-reverse-polish-notation](https://github.com/Huy-DNA/Leethub/tree/master/0150-evaluate-reverse-polish-notation) |
| [0234-palindrome-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0234-palindrome-linked-list) |
| [1197-parsing-a-boolean-expression](https://github.com/Huy-DNA/Leethub/tree/master/1197-parsing-a-boolean-expression) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/Huy-DNA/Leethub/tree/master/0042-trapping-rain-water) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0002-add-two-numbers) |
| [0024-swap-nodes-in-pairs](https://github.com/Huy-DNA/Leethub/tree/master/0024-swap-nodes-in-pairs) |
| [0143-reorder-list](https://github.com/Huy-DNA/Leethub/tree/master/0143-reorder-list) |
| [0203-remove-linked-list-elements](https://github.com/Huy-DNA/Leethub/tree/master/0203-remove-linked-list-elements) |
| [0206-reverse-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0206-reverse-linked-list) |
| [0231-power-of-two](https://github.com/Huy-DNA/Leethub/tree/master/0231-power-of-two) |
| [0233-number-of-digit-one](https://github.com/Huy-DNA/Leethub/tree/master/0233-number-of-digit-one) |
| [0234-palindrome-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0234-palindrome-linked-list) |
| [0241-different-ways-to-add-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0241-different-ways-to-add-parentheses) |
| [0326-power-of-three](https://github.com/Huy-DNA/Leethub/tree/master/0326-power-of-three) |
| [0342-power-of-four](https://github.com/Huy-DNA/Leethub/tree/master/0342-power-of-four) |
| [1197-parsing-a-boolean-expression](https://github.com/Huy-DNA/Leethub/tree/master/1197-parsing-a-boolean-expression) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/Huy-DNA/Leethub/tree/master/0070-climbing-stairs) |
| [0241-different-ways-to-add-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0241-different-ways-to-add-parentheses) |
## Backtracking
| |
| ------- |
| [0017-letter-combinations-of-a-phone-number](https://github.com/Huy-DNA/Leethub/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0022-generate-parentheses](https://github.com/Huy-DNA/Leethub/tree/master/0022-generate-parentheses) |
| [0046-permutations](https://github.com/Huy-DNA/Leethub/tree/master/0046-permutations) |
| [0051-n-queens](https://github.com/Huy-DNA/Leethub/tree/master/0051-n-queens) |
| [0077-combinations](https://github.com/Huy-DNA/Leethub/tree/master/0077-combinations) |
| [0113-path-sum-ii](https://github.com/Huy-DNA/Leethub/tree/master/0113-path-sum-ii) |
| [0126-word-ladder-ii](https://github.com/Huy-DNA/Leethub/tree/master/0126-word-ladder-ii) |
| [0800-letter-case-permutation](https://github.com/Huy-DNA/Leethub/tree/master/0800-letter-case-permutation) |
## Depth-First Search
| |
| ------- |
| [0098-validate-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0098-validate-binary-search-tree) |
| [0100-same-tree](https://github.com/Huy-DNA/Leethub/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Huy-DNA/Leethub/tree/master/0101-symmetric-tree) |
| [0112-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/Huy-DNA/Leethub/tree/master/0113-path-sum-ii) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/Huy-DNA/Leethub/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0124-binary-tree-maximum-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0129-sum-root-to-leaf-numbers) |
| [0200-number-of-islands](https://github.com/Huy-DNA/Leethub/tree/master/0200-number-of-islands) |
| [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) |
| [0695-max-area-of-island](https://github.com/Huy-DNA/Leethub/tree/master/0695-max-area-of-island) |
| [0733-flood-fill](https://github.com/Huy-DNA/Leethub/tree/master/0733-flood-fill) |
| [0904-leaf-similar-trees](https://github.com/Huy-DNA/Leethub/tree/master/0904-leaf-similar-trees) |
| [0975-range-sum-of-bst](https://github.com/Huy-DNA/Leethub/tree/master/0975-range-sum-of-bst) |
| [1568-pseudo-palindromic-paths-in-a-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1568-pseudo-palindromic-paths-in-a-binary-tree) |
## Breadth-First Search
| |
| ------- |
| [0100-same-tree](https://github.com/Huy-DNA/Leethub/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Huy-DNA/Leethub/tree/master/0101-symmetric-tree) |
| [0112-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0112-path-sum) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/Huy-DNA/Leethub/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0126-word-ladder-ii](https://github.com/Huy-DNA/Leethub/tree/master/0126-word-ladder-ii) |
| [0200-number-of-islands](https://github.com/Huy-DNA/Leethub/tree/master/0200-number-of-islands) |
| [0542-01-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0542-01-matrix) |
| [0695-max-area-of-island](https://github.com/Huy-DNA/Leethub/tree/master/0695-max-area-of-island) |
| [0733-flood-fill](https://github.com/Huy-DNA/Leethub/tree/master/0733-flood-fill) |
| [1036-rotting-oranges](https://github.com/Huy-DNA/Leethub/tree/master/1036-rotting-oranges) |
| [1568-pseudo-palindromic-paths-in-a-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1568-pseudo-palindromic-paths-in-a-binary-tree) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/Huy-DNA/Leethub/tree/master/0128-longest-consecutive-sequence) |
| [0200-number-of-islands](https://github.com/Huy-DNA/Leethub/tree/master/0200-number-of-islands) |
| [0695-max-area-of-island](https://github.com/Huy-DNA/Leethub/tree/master/0695-max-area-of-island) |
## Matrix
| |
| ------- |
| [0036-valid-sudoku](https://github.com/Huy-DNA/Leethub/tree/master/0036-valid-sudoku) |
| [0074-search-a-2d-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0074-search-a-2d-matrix) |
| [0200-number-of-islands](https://github.com/Huy-DNA/Leethub/tree/master/0200-number-of-islands) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0542-01-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0542-01-matrix) |
| [0566-reshape-the-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0566-reshape-the-matrix) |
| [0695-max-area-of-island](https://github.com/Huy-DNA/Leethub/tree/master/0695-max-area-of-island) |
| [0733-flood-fill](https://github.com/Huy-DNA/Leethub/tree/master/0733-flood-fill) |
| [0967-minimum-falling-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0967-minimum-falling-path-sum) |
| [1036-rotting-oranges](https://github.com/Huy-DNA/Leethub/tree/master/1036-rotting-oranges) |
| [1463-the-k-weakest-rows-in-a-matrix](https://github.com/Huy-DNA/Leethub/tree/master/1463-the-k-weakest-rows-in-a-matrix) |
| [2244-number-of-laser-beams-in-a-bank](https://github.com/Huy-DNA/Leethub/tree/master/2244-number-of-laser-beams-in-a-bank) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Huy-DNA/Leethub/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0024-swap-nodes-in-pairs](https://github.com/Huy-DNA/Leethub/tree/master/0024-swap-nodes-in-pairs) |
| [0061-rotate-list](https://github.com/Huy-DNA/Leethub/tree/master/0061-rotate-list) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/Huy-DNA/Leethub/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0092-reverse-linked-list-ii](https://github.com/Huy-DNA/Leethub/tree/master/0092-reverse-linked-list-ii) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/Huy-DNA/Leethub/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0138-copy-list-with-random-pointer](https://github.com/Huy-DNA/Leethub/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/Huy-DNA/Leethub/tree/master/0141-linked-list-cycle) |
| [0143-reorder-list](https://github.com/Huy-DNA/Leethub/tree/master/0143-reorder-list) |
| [0203-remove-linked-list-elements](https://github.com/Huy-DNA/Leethub/tree/master/0203-remove-linked-list-elements) |
| [0206-reverse-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0234-palindrome-linked-list) |
| [0725-split-linked-list-in-parts](https://github.com/Huy-DNA/Leethub/tree/master/0725-split-linked-list-in-parts) |
| [0908-middle-of-the-linked-list](https://github.com/Huy-DNA/Leethub/tree/master/0908-middle-of-the-linked-list) |
## Bucket Sort
| |
| ------- |
| [0451-sort-characters-by-frequency](https://github.com/Huy-DNA/Leethub/tree/master/0451-sort-characters-by-frequency) |
## Tree
| |
| ------- |
| [0098-validate-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0098-validate-binary-search-tree) |
| [0100-same-tree](https://github.com/Huy-DNA/Leethub/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Huy-DNA/Leethub/tree/master/0101-symmetric-tree) |
| [0112-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/Huy-DNA/Leethub/tree/master/0113-path-sum-ii) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/Huy-DNA/Leethub/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0124-binary-tree-maximum-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0129-sum-root-to-leaf-numbers) |
| [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) |
| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |
| [0904-leaf-similar-trees](https://github.com/Huy-DNA/Leethub/tree/master/0904-leaf-similar-trees) |
| [0975-range-sum-of-bst](https://github.com/Huy-DNA/Leethub/tree/master/0975-range-sum-of-bst) |
| [1568-pseudo-palindromic-paths-in-a-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1568-pseudo-palindromic-paths-in-a-binary-tree) |
## Binary Tree
| |
| ------- |
| [0098-validate-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0098-validate-binary-search-tree) |
| [0100-same-tree](https://github.com/Huy-DNA/Leethub/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Huy-DNA/Leethub/tree/master/0101-symmetric-tree) |
| [0112-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/Huy-DNA/Leethub/tree/master/0113-path-sum-ii) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/Huy-DNA/Leethub/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0124-binary-tree-maximum-path-sum](https://github.com/Huy-DNA/Leethub/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/Huy-DNA/Leethub/tree/master/0129-sum-root-to-leaf-numbers) |
| [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) |
| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |
| [0904-leaf-similar-trees](https://github.com/Huy-DNA/Leethub/tree/master/0904-leaf-similar-trees) |
| [0975-range-sum-of-bst](https://github.com/Huy-DNA/Leethub/tree/master/0975-range-sum-of-bst) |
| [1568-pseudo-palindromic-paths-in-a-binary-tree](https://github.com/Huy-DNA/Leethub/tree/master/1568-pseudo-palindromic-paths-in-a-binary-tree) |
## Binary Search Tree
| |
| ------- |
| [0098-validate-binary-search-tree](https://github.com/Huy-DNA/Leethub/tree/master/0098-validate-binary-search-tree) |
| [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) |
| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |
| [0975-range-sum-of-bst](https://github.com/Huy-DNA/Leethub/tree/master/0975-range-sum-of-bst) |
## Divide and Conquer
| |
| ------- |
| [0053-maximum-subarray](https://github.com/Huy-DNA/Leethub/tree/master/0053-maximum-subarray) |
| [0190-reverse-bits](https://github.com/Huy-DNA/Leethub/tree/master/0190-reverse-bits) |
| [0191-number-of-1-bits](https://github.com/Huy-DNA/Leethub/tree/master/0191-number-of-1-bits) |
## Simulation
| |
| ------- |
| [0566-reshape-the-matrix](https://github.com/Huy-DNA/Leethub/tree/master/0566-reshape-the-matrix) |
| [2274-keep-multiplying-found-values-by-two](https://github.com/Huy-DNA/Leethub/tree/master/2274-keep-multiplying-found-values-by-two) |
## Queue
| |
| ------- |
| [0387-first-unique-character-in-a-string](https://github.com/Huy-DNA/Leethub/tree/master/0387-first-unique-character-in-a-string) |
## Combinatorics
| |
| ------- |
| [0062-unique-paths](https://github.com/Huy-DNA/Leethub/tree/master/0062-unique-paths) |
| [0458-poor-pigs](https://github.com/Huy-DNA/Leethub/tree/master/0458-poor-pigs) |
## Design
| |
| ------- |
| [0307-range-sum-query-mutable](https://github.com/Huy-DNA/Leethub/tree/master/0307-range-sum-query-mutable) |
| [0729-my-calendar-i](https://github.com/Huy-DNA/Leethub/tree/master/0729-my-calendar-i) |
| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |
## Segment Tree
| |
| ------- |
| [0307-range-sum-query-mutable](https://github.com/Huy-DNA/Leethub/tree/master/0307-range-sum-query-mutable) |
| [0729-my-calendar-i](https://github.com/Huy-DNA/Leethub/tree/master/0729-my-calendar-i) |
## Ordered Set
| |
| ------- |
| [0729-my-calendar-i](https://github.com/Huy-DNA/Leethub/tree/master/0729-my-calendar-i) |
## Interactive
| |
| ------- |
| [0278-first-bad-version](https://github.com/Huy-DNA/Leethub/tree/master/0278-first-bad-version) |
## Binary Indexed Tree
| |
| ------- |
| [0307-range-sum-query-mutable](https://github.com/Huy-DNA/Leethub/tree/master/0307-range-sum-query-mutable) |
## Data Stream
| |
| ------- |
| [0789-kth-largest-element-in-a-stream](https://github.com/Huy-DNA/Leethub/tree/master/0789-kth-largest-element-in-a-stream) |