Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/momoko606/leetcode
Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
https://github.com/momoko606/leetcode
Last synced: 27 days ago
JSON representation
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/momoko606/leetcode
- Owner: MOMOKO606
- Created: 2023-10-07T02:18:24.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2024-10-24T17:44:08.000Z (about 2 months ago)
- Last Synced: 2024-10-25T12:04:14.220Z (about 2 months ago)
- Language: Python
- Size: 1.01 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Leetcode
Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
# Array
| |
| ------- |
| [0018-4sum](https://github.com/MOMOKO606/Leetcode/tree/master/0018-4sum) |
| [0041-first-missing-positive](https://github.com/MOMOKO606/Leetcode/tree/master/0041-first-missing-positive) |
| [0042-trapping-rain-water](https://github.com/MOMOKO606/Leetcode/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0045-jump-game-ii) |
| [0046-permutations](https://github.com/MOMOKO606/Leetcode/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0047-permutations-ii) |
| [0048-rotate-image](https://github.com/MOMOKO606/Leetcode/tree/master/0048-rotate-image) |
| [0049-group-anagrams](https://github.com/MOMOKO606/Leetcode/tree/master/0049-group-anagrams) |
| [0051-n-queens](https://github.com/MOMOKO606/Leetcode/tree/master/0051-n-queens) |
| [3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network](https://github.com/MOMOKO606/Leetcode/tree/master/3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network) |
# Hash Table
| |
| ------- |
| [0041-first-missing-positive](https://github.com/MOMOKO606/Leetcode/tree/master/0041-first-missing-positive) |
| [0049-group-anagrams](https://github.com/MOMOKO606/Leetcode/tree/master/0049-group-anagrams) |
# Two Pointers
| |
| ------- |
| [0018-4sum](https://github.com/MOMOKO606/Leetcode/tree/master/0018-4sum) |
| [0042-trapping-rain-water](https://github.com/MOMOKO606/Leetcode/tree/master/0042-trapping-rain-water) |
# Dynamic Programming
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/MOMOKO606/Leetcode/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0045-jump-game-ii) |
# Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/MOMOKO606/Leetcode/tree/master/0042-trapping-rain-water) |
# Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/MOMOKO606/Leetcode/tree/master/0042-trapping-rain-water) |
# Math
| |
| ------- |
| [0043-multiply-strings](https://github.com/MOMOKO606/Leetcode/tree/master/0043-multiply-strings) |
| [0048-rotate-image](https://github.com/MOMOKO606/Leetcode/tree/master/0048-rotate-image) |
| [0050-powx-n](https://github.com/MOMOKO606/Leetcode/tree/master/0050-powx-n) |
| [1070-convert-to-base-2](https://github.com/MOMOKO606/Leetcode/tree/master/1070-convert-to-base-2) |
# String
| |
| ------- |
| [0043-multiply-strings](https://github.com/MOMOKO606/Leetcode/tree/master/0043-multiply-strings) |
| [0049-group-anagrams](https://github.com/MOMOKO606/Leetcode/tree/master/0049-group-anagrams) |
# Simulation
| |
| ------- |
| [0043-multiply-strings](https://github.com/MOMOKO606/Leetcode/tree/master/0043-multiply-strings) |
# Greedy
| |
| ------- |
| [0045-jump-game-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0045-jump-game-ii) |
# Backtracking
| |
| ------- |
| [0046-permutations](https://github.com/MOMOKO606/Leetcode/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0047-permutations-ii) |
| [0051-n-queens](https://github.com/MOMOKO606/Leetcode/tree/master/0051-n-queens) |
| [0052-n-queens-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0052-n-queens-ii) |
# Matrix
| |
| ------- |
| [0048-rotate-image](https://github.com/MOMOKO606/Leetcode/tree/master/0048-rotate-image) |
# Sorting
| |
| ------- |
| [0018-4sum](https://github.com/MOMOKO606/Leetcode/tree/master/0018-4sum) |
| [0049-group-anagrams](https://github.com/MOMOKO606/Leetcode/tree/master/0049-group-anagrams) |
# Recursion
| |
| ------- |
| [0050-powx-n](https://github.com/MOMOKO606/Leetcode/tree/master/0050-powx-n) |
# Tree
| |
| ------- |
| [3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network](https://github.com/MOMOKO606/Leetcode/tree/master/3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network) |
# Depth-First Search
| |
| ------- |
| [3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network](https://github.com/MOMOKO606/Leetcode/tree/master/3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network) |
# LeetCode Topics
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/MOMOKO606/Leetcode/tree/master/0004-median-of-two-sorted-arrays) |
| [0011-container-with-most-water](https://github.com/MOMOKO606/Leetcode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/MOMOKO606/Leetcode/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/MOMOKO606/Leetcode/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/MOMOKO606/Leetcode/tree/master/0018-4sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/MOMOKO606/Leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/MOMOKO606/Leetcode/tree/master/0027-remove-element) |
| [0031-next-permutation](https://github.com/MOMOKO606/Leetcode/tree/master/0031-next-permutation) |
| [0033-search-in-rotated-sorted-array](https://github.com/MOMOKO606/Leetcode/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/MOMOKO606/Leetcode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/MOMOKO606/Leetcode/tree/master/0035-search-insert-position) |
| [0036-valid-sudoku](https://github.com/MOMOKO606/Leetcode/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/MOMOKO606/Leetcode/tree/master/0037-sudoku-solver) |
| [0039-combination-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0040-combination-sum-ii) |
| [0041-first-missing-positive](https://github.com/MOMOKO606/Leetcode/tree/master/0041-first-missing-positive) |
| [0042-trapping-rain-water](https://github.com/MOMOKO606/Leetcode/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0045-jump-game-ii) |
| [0046-permutations](https://github.com/MOMOKO606/Leetcode/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0047-permutations-ii) |
| [0048-rotate-image](https://github.com/MOMOKO606/Leetcode/tree/master/0048-rotate-image) |
| [0049-group-anagrams](https://github.com/MOMOKO606/Leetcode/tree/master/0049-group-anagrams) |
| [0051-n-queens](https://github.com/MOMOKO606/Leetcode/tree/master/0051-n-queens) |
| [0053-maximum-subarray](https://github.com/MOMOKO606/Leetcode/tree/master/0053-maximum-subarray) |
| [0054-spiral-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0054-spiral-matrix) |
| [0055-jump-game](https://github.com/MOMOKO606/Leetcode/tree/master/0055-jump-game) |
| [0056-merge-intervals](https://github.com/MOMOKO606/Leetcode/tree/master/0056-merge-intervals) |
| [0057-insert-interval](https://github.com/MOMOKO606/Leetcode/tree/master/0057-insert-interval) |
| [0059-spiral-matrix-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0059-spiral-matrix-ii) |
| [0063-unique-paths-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0064-minimum-path-sum) |
| [0066-plus-one](https://github.com/MOMOKO606/Leetcode/tree/master/0066-plus-one) |
| [0068-text-justification](https://github.com/MOMOKO606/Leetcode/tree/master/0068-text-justification) |
| [0073-set-matrix-zeroes](https://github.com/MOMOKO606/Leetcode/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0074-search-a-2d-matrix) |
| [0075-sort-colors](https://github.com/MOMOKO606/Leetcode/tree/master/0075-sort-colors) |
| [0078-subsets](https://github.com/MOMOKO606/Leetcode/tree/master/0078-subsets) |
| [0079-word-search](https://github.com/MOMOKO606/Leetcode/tree/master/0079-word-search) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0084-largest-rectangle-in-histogram](https://github.com/MOMOKO606/Leetcode/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/MOMOKO606/Leetcode/tree/master/0085-maximal-rectangle) |
| [0088-merge-sorted-array](https://github.com/MOMOKO606/Leetcode/tree/master/0088-merge-sorted-array) |
| [0090-subsets-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0090-subsets-ii) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0118-pascals-triangle](https://github.com/MOMOKO606/Leetcode/tree/master/0118-pascals-triangle) |
| [0119-pascals-triangle-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0119-pascals-triangle-ii) |
| [0120-triangle](https://github.com/MOMOKO606/Leetcode/tree/master/0120-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/MOMOKO606/Leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |
| [0128-longest-consecutive-sequence](https://github.com/MOMOKO606/Leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0130-surrounded-regions](https://github.com/MOMOKO606/Leetcode/tree/master/0130-surrounded-regions) |
| [0134-gas-station](https://github.com/MOMOKO606/Leetcode/tree/master/0134-gas-station) |
| [0135-candy](https://github.com/MOMOKO606/Leetcode/tree/master/0135-candy) |
| [0136-single-number](https://github.com/MOMOKO606/Leetcode/tree/master/0136-single-number) |
| [0137-single-number-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0137-single-number-ii) |
| [0139-word-break](https://github.com/MOMOKO606/Leetcode/tree/master/0139-word-break) |
| [0140-word-break-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0140-word-break-ii) |
| [0149-max-points-on-a-line](https://github.com/MOMOKO606/Leetcode/tree/master/0149-max-points-on-a-line) |
| [0150-evaluate-reverse-polish-notation](https://github.com/MOMOKO606/Leetcode/tree/master/0150-evaluate-reverse-polish-notation) |
| [0152-maximum-product-subarray](https://github.com/MOMOKO606/Leetcode/tree/master/0152-maximum-product-subarray) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/MOMOKO606/Leetcode/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0154-find-minimum-in-rotated-sorted-array-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0154-find-minimum-in-rotated-sorted-array-ii) |
| [0157-read-n-characters-given-read4](https://github.com/MOMOKO606/Leetcode/tree/master/0157-read-n-characters-given-read4) |
| [0162-find-peak-element](https://github.com/MOMOKO606/Leetcode/tree/master/0162-find-peak-element) |
| [0163-missing-ranges](https://github.com/MOMOKO606/Leetcode/tree/master/0163-missing-ranges) |
| [0164-maximum-gap](https://github.com/MOMOKO606/Leetcode/tree/master/0164-maximum-gap) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/MOMOKO606/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0169-majority-element](https://github.com/MOMOKO606/Leetcode/tree/master/0169-majority-element) |
| [0170-two-sum-iii-data-structure-design](https://github.com/MOMOKO606/Leetcode/tree/master/0170-two-sum-iii-data-structure-design) |
| [0174-dungeon-game](https://github.com/MOMOKO606/Leetcode/tree/master/0174-dungeon-game) |
| [0179-largest-number](https://github.com/MOMOKO606/Leetcode/tree/master/0179-largest-number) |
| [0188-best-time-to-buy-and-sell-stock-iv](https://github.com/MOMOKO606/Leetcode/tree/master/0188-best-time-to-buy-and-sell-stock-iv) |
| [0189-rotate-array](https://github.com/MOMOKO606/Leetcode/tree/master/0189-rotate-array) |
| [0198-house-robber](https://github.com/MOMOKO606/Leetcode/tree/master/0198-house-robber) |
| [0200-number-of-islands](https://github.com/MOMOKO606/Leetcode/tree/master/0200-number-of-islands) |
| [0204-count-primes](https://github.com/MOMOKO606/Leetcode/tree/master/0204-count-primes) |
| [0212-word-search-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0212-word-search-ii) |
| [0213-house-robber-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0213-house-robber-ii) |
| [0215-kth-largest-element-in-an-array](https://github.com/MOMOKO606/Leetcode/tree/master/0215-kth-largest-element-in-an-array) |
| [0216-combination-sum-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0216-combination-sum-iii) |
| [0218-the-skyline-problem](https://github.com/MOMOKO606/Leetcode/tree/master/0218-the-skyline-problem) |
| [0219-contains-duplicate-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0219-contains-duplicate-ii) |
| [0220-contains-duplicate-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0220-contains-duplicate-iii) |
| [0228-summary-ranges](https://github.com/MOMOKO606/Leetcode/tree/master/0228-summary-ranges) |
| [0238-product-of-array-except-self](https://github.com/MOMOKO606/Leetcode/tree/master/0238-product-of-array-except-self) |
| [0239-sliding-window-maximum](https://github.com/MOMOKO606/Leetcode/tree/master/0239-sliding-window-maximum) |
| [0251-flatten-2d-vector](https://github.com/MOMOKO606/Leetcode/tree/master/0251-flatten-2d-vector) |
| [0253-meeting-rooms-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0253-meeting-rooms-ii) |
| [0260-single-number-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0260-single-number-iii) |
| [0268-missing-number](https://github.com/MOMOKO606/Leetcode/tree/master/0268-missing-number) |
| [0269-alien-dictionary](https://github.com/MOMOKO606/Leetcode/tree/master/0269-alien-dictionary) |
| [0274-h-index](https://github.com/MOMOKO606/Leetcode/tree/master/0274-h-index) |
| [0275-h-index-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0275-h-index-ii) |
| [0283-move-zeroes](https://github.com/MOMOKO606/Leetcode/tree/master/0283-move-zeroes) |
| [0284-peeking-iterator](https://github.com/MOMOKO606/Leetcode/tree/master/0284-peeking-iterator) |
| [0287-find-the-duplicate-number](https://github.com/MOMOKO606/Leetcode/tree/master/0287-find-the-duplicate-number) |
| [0300-longest-increasing-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0300-longest-increasing-subsequence) |
| [0304-range-sum-query-2d-immutable](https://github.com/MOMOKO606/Leetcode/tree/master/0304-range-sum-query-2d-immutable) |
| [0307-range-sum-query-mutable](https://github.com/MOMOKO606/Leetcode/tree/master/0307-range-sum-query-mutable) |
| [0309-best-time-to-buy-and-sell-stock-with-cooldown](https://github.com/MOMOKO606/Leetcode/tree/master/0309-best-time-to-buy-and-sell-stock-with-cooldown) |
| [0312-burst-balloons](https://github.com/MOMOKO606/Leetcode/tree/master/0312-burst-balloons) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/MOMOKO606/Leetcode/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0322-coin-change](https://github.com/MOMOKO606/Leetcode/tree/master/0322-coin-change) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0334-increasing-triplet-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0334-increasing-triplet-subsequence) |
| [0336-palindrome-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0336-palindrome-pairs) |
| [0346-moving-average-from-data-stream](https://github.com/MOMOKO606/Leetcode/tree/master/0346-moving-average-from-data-stream) |
| [0350-intersection-of-two-arrays-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0363-max-sum-of-rectangle-no-larger-than-k](https://github.com/MOMOKO606/Leetcode/tree/master/0363-max-sum-of-rectangle-no-larger-than-k) |
| [0368-largest-divisible-subset](https://github.com/MOMOKO606/Leetcode/tree/master/0368-largest-divisible-subset) |
| [0373-find-k-pairs-with-smallest-sums](https://github.com/MOMOKO606/Leetcode/tree/master/0373-find-k-pairs-with-smallest-sums) |
| [0376-wiggle-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0376-wiggle-subsequence) |
| [0377-combination-sum-iv](https://github.com/MOMOKO606/Leetcode/tree/master/0377-combination-sum-iv) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0380-insert-delete-getrandom-o1](https://github.com/MOMOKO606/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |
| [0399-evaluate-division](https://github.com/MOMOKO606/Leetcode/tree/master/0399-evaluate-division) |
| [0403-frog-jump](https://github.com/MOMOKO606/Leetcode/tree/master/0403-frog-jump) |
| [0406-queue-reconstruction-by-height](https://github.com/MOMOKO606/Leetcode/tree/master/0406-queue-reconstruction-by-height) |
| [0410-split-array-largest-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0410-split-array-largest-sum) |
| [0413-arithmetic-slices](https://github.com/MOMOKO606/Leetcode/tree/master/0413-arithmetic-slices) |
| [0416-partition-equal-subset-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0416-partition-equal-subset-sum) |
| [0435-non-overlapping-intervals](https://github.com/MOMOKO606/Leetcode/tree/master/0435-non-overlapping-intervals) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/MOMOKO606/Leetcode/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0455-assign-cookies](https://github.com/MOMOKO606/Leetcode/tree/master/0455-assign-cookies) |
| [0456-132-pattern](https://github.com/MOMOKO606/Leetcode/tree/master/0456-132-pattern) |
| [0463-island-perimeter](https://github.com/MOMOKO606/Leetcode/tree/master/0463-island-perimeter) |
| [0474-ones-and-zeroes](https://github.com/MOMOKO606/Leetcode/tree/master/0474-ones-and-zeroes) |
| [0490-the-maze](https://github.com/MOMOKO606/Leetcode/tree/master/0490-the-maze) |
| [0493-reverse-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0493-reverse-pairs) |
| [0494-target-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0494-target-sum) |
| [0496-next-greater-element-i](https://github.com/MOMOKO606/Leetcode/tree/master/0496-next-greater-element-i) |
| [0502-ipo](https://github.com/MOMOKO606/Leetcode/tree/master/0502-ipo) |
| [0503-next-greater-element-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0503-next-greater-element-ii) |
| [0518-coin-change-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0518-coin-change-ii) |
| [0523-continuous-subarray-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0523-continuous-subarray-sum) |
| [0529-minesweeper](https://github.com/MOMOKO606/Leetcode/tree/master/0529-minesweeper) |
| [0560-subarray-sum-equals-k](https://github.com/MOMOKO606/Leetcode/tree/master/0560-subarray-sum-equals-k) |
| [0605-can-place-flowers](https://github.com/MOMOKO606/Leetcode/tree/master/0605-can-place-flowers) |
| [0621-task-scheduler](https://github.com/MOMOKO606/Leetcode/tree/master/0621-task-scheduler) |
| [0636-exclusive-time-of-functions](https://github.com/MOMOKO606/Leetcode/tree/master/0636-exclusive-time-of-functions) |
| [0643-maximum-average-subarray-i](https://github.com/MOMOKO606/Leetcode/tree/master/0643-maximum-average-subarray-i) |
| [0682-baseball-game](https://github.com/MOMOKO606/Leetcode/tree/master/0682-baseball-game) |
| [0713-subarray-product-less-than-k](https://github.com/MOMOKO606/Leetcode/tree/master/0713-subarray-product-less-than-k) |
| [0772-construct-quad-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0772-construct-quad-tree) |
| [0787-sliding-puzzle](https://github.com/MOMOKO606/Leetcode/tree/master/0787-sliding-puzzle) |
| [0859-design-circular-deque](https://github.com/MOMOKO606/Leetcode/tree/master/0859-design-circular-deque) |
| [0943-sum-of-subarray-minimums](https://github.com/MOMOKO606/Leetcode/tree/master/0943-sum-of-subarray-minimums) |
| [1171-shortest-path-in-binary-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/1171-shortest-path-in-binary-matrix) |
| [1306-minimum-absolute-difference](https://github.com/MOMOKO606/Leetcode/tree/master/1306-minimum-absolute-difference) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/MOMOKO606/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/MOMOKO606/Leetcode/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [1772-create-sorted-array-through-instructions](https://github.com/MOMOKO606/Leetcode/tree/master/1772-create-sorted-array-through-instructions) |
| [2518-the-employee-that-worked-on-the-longest-task](https://github.com/MOMOKO606/Leetcode/tree/master/2518-the-employee-that-worked-on-the-longest-task) |
| [2519-find-the-original-array-of-prefix-xor](https://github.com/MOMOKO606/Leetcode/tree/master/2519-find-the-original-array-of-prefix-xor) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/MOMOKO606/Leetcode/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2631-sort-the-students-by-their-kth-score](https://github.com/MOMOKO606/Leetcode/tree/master/2631-sort-the-students-by-their-kth-score) |
| [2651-count-ways-to-group-overlapping-ranges](https://github.com/MOMOKO606/Leetcode/tree/master/2651-count-ways-to-group-overlapping-ranges) |
| [2661-smallest-missing-non-negative-integer-after-operations](https://github.com/MOMOKO606/Leetcode/tree/master/2661-smallest-missing-non-negative-integer-after-operations) |
| [3187-maximum-profitable-triplets-with-increasing-prices-i](https://github.com/MOMOKO606/Leetcode/tree/master/3187-maximum-profitable-triplets-with-increasing-prices-i) |
| [3204-maximum-profitable-triplets-with-increasing-prices-ii](https://github.com/MOMOKO606/Leetcode/tree/master/3204-maximum-profitable-triplets-with-increasing-prices-ii) |
| [3254-number-of-divisible-triplet-sums](https://github.com/MOMOKO606/Leetcode/tree/master/3254-number-of-divisible-triplet-sums) |
| [3321-type-of-triangle](https://github.com/MOMOKO606/Leetcode/tree/master/3321-type-of-triangle) |
| [3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network](https://github.com/MOMOKO606/Leetcode/tree/master/3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/MOMOKO606/Leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
| [3355-minimum-levels-to-gain-more-points](https://github.com/MOMOKO606/Leetcode/tree/master/3355-minimum-levels-to-gain-more-points) |
| [3363-most-frequent-ids](https://github.com/MOMOKO606/Leetcode/tree/master/3363-most-frequent-ids) |
| [3364-minimum-sum-of-values-by-dividing-array](https://github.com/MOMOKO606/Leetcode/tree/master/3364-minimum-sum-of-values-by-dividing-array) |
| [3376-longest-common-suffix-queries](https://github.com/MOMOKO606/Leetcode/tree/master/3376-longest-common-suffix-queries) |
| [3383-taking-maximum-energy-from-the-mystic-dungeon](https://github.com/MOMOKO606/Leetcode/tree/master/3383-taking-maximum-energy-from-the-mystic-dungeon) |
| [3387-minimum-operations-to-make-median-of-array-equal-to-k](https://github.com/MOMOKO606/Leetcode/tree/master/3387-minimum-operations-to-make-median-of-array-equal-to-k) |
| [3413-find-the-first-player-to-win-k-games-in-a-row](https://github.com/MOMOKO606/Leetcode/tree/master/3413-find-the-first-player-to-win-k-games-in-a-row) |
| [3420-find-occurrences-of-an-element-in-an-array](https://github.com/MOMOKO606/Leetcode/tree/master/3420-find-occurrences-of-an-element-in-an-array) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/MOMOKO606/Leetcode/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/MOMOKO606/Leetcode/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/MOMOKO606/Leetcode/tree/master/0018-4sum) |
| [0049-group-anagrams](https://github.com/MOMOKO606/Leetcode/tree/master/0049-group-anagrams) |
| [0056-merge-intervals](https://github.com/MOMOKO606/Leetcode/tree/master/0056-merge-intervals) |
| [0075-sort-colors](https://github.com/MOMOKO606/Leetcode/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/MOMOKO606/Leetcode/tree/master/0088-merge-sorted-array) |
| [0147-insertion-sort-list](https://github.com/MOMOKO606/Leetcode/tree/master/0147-insertion-sort-list) |
| [0148-sort-list](https://github.com/MOMOKO606/Leetcode/tree/master/0148-sort-list) |
| [0164-maximum-gap](https://github.com/MOMOKO606/Leetcode/tree/master/0164-maximum-gap) |
| [0169-majority-element](https://github.com/MOMOKO606/Leetcode/tree/master/0169-majority-element) |
| [0179-largest-number](https://github.com/MOMOKO606/Leetcode/tree/master/0179-largest-number) |
| [0215-kth-largest-element-in-an-array](https://github.com/MOMOKO606/Leetcode/tree/master/0215-kth-largest-element-in-an-array) |
| [0220-contains-duplicate-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0220-contains-duplicate-iii) |
| [0253-meeting-rooms-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0253-meeting-rooms-ii) |
| [0268-missing-number](https://github.com/MOMOKO606/Leetcode/tree/master/0268-missing-number) |
| [0274-h-index](https://github.com/MOMOKO606/Leetcode/tree/master/0274-h-index) |
| [0295-find-median-from-data-stream](https://github.com/MOMOKO606/Leetcode/tree/master/0295-find-median-from-data-stream) |
| [0350-intersection-of-two-arrays-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0368-largest-divisible-subset](https://github.com/MOMOKO606/Leetcode/tree/master/0368-largest-divisible-subset) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0389-find-the-difference](https://github.com/MOMOKO606/Leetcode/tree/master/0389-find-the-difference) |
| [0406-queue-reconstruction-by-height](https://github.com/MOMOKO606/Leetcode/tree/master/0406-queue-reconstruction-by-height) |
| [0435-non-overlapping-intervals](https://github.com/MOMOKO606/Leetcode/tree/master/0435-non-overlapping-intervals) |
| [0451-sort-characters-by-frequency](https://github.com/MOMOKO606/Leetcode/tree/master/0451-sort-characters-by-frequency) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/MOMOKO606/Leetcode/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0455-assign-cookies](https://github.com/MOMOKO606/Leetcode/tree/master/0455-assign-cookies) |
| [0502-ipo](https://github.com/MOMOKO606/Leetcode/tree/master/0502-ipo) |
| [0588-design-in-memory-file-system](https://github.com/MOMOKO606/Leetcode/tree/master/0588-design-in-memory-file-system) |
| [0621-task-scheduler](https://github.com/MOMOKO606/Leetcode/tree/master/0621-task-scheduler) |
| [0778-reorganize-string](https://github.com/MOMOKO606/Leetcode/tree/master/0778-reorganize-string) |
| [1306-minimum-absolute-difference](https://github.com/MOMOKO606/Leetcode/tree/master/1306-minimum-absolute-difference) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/MOMOKO606/Leetcode/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/MOMOKO606/Leetcode/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2631-sort-the-students-by-their-kth-score](https://github.com/MOMOKO606/Leetcode/tree/master/2631-sort-the-students-by-their-kth-score) |
| [2651-count-ways-to-group-overlapping-ranges](https://github.com/MOMOKO606/Leetcode/tree/master/2651-count-ways-to-group-overlapping-ranges) |
| [3321-type-of-triangle](https://github.com/MOMOKO606/Leetcode/tree/master/3321-type-of-triangle) |
| [3387-minimum-operations-to-make-median-of-array-equal-to-k](https://github.com/MOMOKO606/Leetcode/tree/master/3387-minimum-operations-to-make-median-of-array-equal-to-k) |
## Bucket Sort
| |
| ------- |
| [0164-maximum-gap](https://github.com/MOMOKO606/Leetcode/tree/master/0164-maximum-gap) |
| [0220-contains-duplicate-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0220-contains-duplicate-iii) |
| [0451-sort-characters-by-frequency](https://github.com/MOMOKO606/Leetcode/tree/master/0451-sort-characters-by-frequency) |
## Radix Sort
| |
| ------- |
| [0164-maximum-gap](https://github.com/MOMOKO606/Leetcode/tree/master/0164-maximum-gap) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/MOMOKO606/Leetcode/tree/master/0002-add-two-numbers) |
| [0007-reverse-integer](https://github.com/MOMOKO606/Leetcode/tree/master/0007-reverse-integer) |
| [0009-palindrome-number](https://github.com/MOMOKO606/Leetcode/tree/master/0009-palindrome-number) |
| [0012-integer-to-roman](https://github.com/MOMOKO606/Leetcode/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/MOMOKO606/Leetcode/tree/master/0013-roman-to-integer) |
| [0029-divide-two-integers](https://github.com/MOMOKO606/Leetcode/tree/master/0029-divide-two-integers) |
| [0043-multiply-strings](https://github.com/MOMOKO606/Leetcode/tree/master/0043-multiply-strings) |
| [0048-rotate-image](https://github.com/MOMOKO606/Leetcode/tree/master/0048-rotate-image) |
| [0050-powx-n](https://github.com/MOMOKO606/Leetcode/tree/master/0050-powx-n) |
| [0060-permutation-sequence](https://github.com/MOMOKO606/Leetcode/tree/master/0060-permutation-sequence) |
| [0062-unique-paths](https://github.com/MOMOKO606/Leetcode/tree/master/0062-unique-paths) |
| [0066-plus-one](https://github.com/MOMOKO606/Leetcode/tree/master/0066-plus-one) |
| [0067-add-binary](https://github.com/MOMOKO606/Leetcode/tree/master/0067-add-binary) |
| [0069-sqrtx](https://github.com/MOMOKO606/Leetcode/tree/master/0069-sqrtx) |
| [0070-climbing-stairs](https://github.com/MOMOKO606/Leetcode/tree/master/0070-climbing-stairs) |
| [0089-gray-code](https://github.com/MOMOKO606/Leetcode/tree/master/0089-gray-code) |
| [0096-unique-binary-search-trees](https://github.com/MOMOKO606/Leetcode/tree/master/0096-unique-binary-search-trees) |
| [0149-max-points-on-a-line](https://github.com/MOMOKO606/Leetcode/tree/master/0149-max-points-on-a-line) |
| [0150-evaluate-reverse-polish-notation](https://github.com/MOMOKO606/Leetcode/tree/master/0150-evaluate-reverse-polish-notation) |
| [0166-fraction-to-recurring-decimal](https://github.com/MOMOKO606/Leetcode/tree/master/0166-fraction-to-recurring-decimal) |
| [0168-excel-sheet-column-title](https://github.com/MOMOKO606/Leetcode/tree/master/0168-excel-sheet-column-title) |
| [0171-excel-sheet-column-number](https://github.com/MOMOKO606/Leetcode/tree/master/0171-excel-sheet-column-number) |
| [0172-factorial-trailing-zeroes](https://github.com/MOMOKO606/Leetcode/tree/master/0172-factorial-trailing-zeroes) |
| [0189-rotate-array](https://github.com/MOMOKO606/Leetcode/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/MOMOKO606/Leetcode/tree/master/0202-happy-number) |
| [0204-count-primes](https://github.com/MOMOKO606/Leetcode/tree/master/0204-count-primes) |
| [0223-rectangle-area](https://github.com/MOMOKO606/Leetcode/tree/master/0223-rectangle-area) |
| [0224-basic-calculator](https://github.com/MOMOKO606/Leetcode/tree/master/0224-basic-calculator) |
| [0227-basic-calculator-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0227-basic-calculator-ii) |
| [0231-power-of-two](https://github.com/MOMOKO606/Leetcode/tree/master/0231-power-of-two) |
| [0233-number-of-digit-one](https://github.com/MOMOKO606/Leetcode/tree/master/0233-number-of-digit-one) |
| [0258-add-digits](https://github.com/MOMOKO606/Leetcode/tree/master/0258-add-digits) |
| [0264-ugly-number-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0264-ugly-number-ii) |
| [0268-missing-number](https://github.com/MOMOKO606/Leetcode/tree/master/0268-missing-number) |
| [0279-perfect-squares](https://github.com/MOMOKO606/Leetcode/tree/master/0279-perfect-squares) |
| [0319-bulb-switcher](https://github.com/MOMOKO606/Leetcode/tree/master/0319-bulb-switcher) |
| [0326-power-of-three](https://github.com/MOMOKO606/Leetcode/tree/master/0326-power-of-three) |
| [0342-power-of-four](https://github.com/MOMOKO606/Leetcode/tree/master/0342-power-of-four) |
| [0368-largest-divisible-subset](https://github.com/MOMOKO606/Leetcode/tree/master/0368-largest-divisible-subset) |
| [0380-insert-delete-getrandom-o1](https://github.com/MOMOKO606/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |
| [0382-linked-list-random-node](https://github.com/MOMOKO606/Leetcode/tree/master/0382-linked-list-random-node) |
| [0504-base-7](https://github.com/MOMOKO606/Leetcode/tree/master/0504-base-7) |
| [0523-continuous-subarray-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0523-continuous-subarray-sum) |
| [0668-kth-smallest-number-in-multiplication-table](https://github.com/MOMOKO606/Leetcode/tree/master/0668-kth-smallest-number-in-multiplication-table) |
| [0785-basic-calculator-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0785-basic-calculator-iii) |
| [1013-fibonacci-number](https://github.com/MOMOKO606/Leetcode/tree/master/1013-fibonacci-number) |
| [1057-numbers-with-repeated-digits](https://github.com/MOMOKO606/Leetcode/tree/master/1057-numbers-with-repeated-digits) |
| [1070-convert-to-base-2](https://github.com/MOMOKO606/Leetcode/tree/master/1070-convert-to-base-2) |
| [1585-the-kth-factor-of-n](https://github.com/MOMOKO606/Leetcode/tree/master/1585-the-kth-factor-of-n) |
| [2661-smallest-missing-non-negative-integer-after-operations](https://github.com/MOMOKO606/Leetcode/tree/master/2661-smallest-missing-non-negative-integer-after-operations) |
| [3321-type-of-triangle](https://github.com/MOMOKO606/Leetcode/tree/master/3321-type-of-triangle) |
| [3328-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k](https://github.com/MOMOKO606/Leetcode/tree/master/3328-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k) |
## Dynamic Programming
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/MOMOKO606/Leetcode/tree/master/0005-longest-palindromic-substring) |
| [0010-regular-expression-matching](https://github.com/MOMOKO606/Leetcode/tree/master/0010-regular-expression-matching) |
| [0022-generate-parentheses](https://github.com/MOMOKO606/Leetcode/tree/master/0022-generate-parentheses) |
| [0032-longest-valid-parentheses](https://github.com/MOMOKO606/Leetcode/tree/master/0032-longest-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/MOMOKO606/Leetcode/tree/master/0042-trapping-rain-water) |
| [0044-wildcard-matching](https://github.com/MOMOKO606/Leetcode/tree/master/0044-wildcard-matching) |
| [0045-jump-game-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0045-jump-game-ii) |
| [0053-maximum-subarray](https://github.com/MOMOKO606/Leetcode/tree/master/0053-maximum-subarray) |
| [0055-jump-game](https://github.com/MOMOKO606/Leetcode/tree/master/0055-jump-game) |
| [0062-unique-paths](https://github.com/MOMOKO606/Leetcode/tree/master/0062-unique-paths) |
| [0063-unique-paths-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0064-minimum-path-sum) |
| [0070-climbing-stairs](https://github.com/MOMOKO606/Leetcode/tree/master/0070-climbing-stairs) |
| [0072-edit-distance](https://github.com/MOMOKO606/Leetcode/tree/master/0072-edit-distance) |
| [0085-maximal-rectangle](https://github.com/MOMOKO606/Leetcode/tree/master/0085-maximal-rectangle) |
| [0087-scramble-string](https://github.com/MOMOKO606/Leetcode/tree/master/0087-scramble-string) |
| [0091-decode-ways](https://github.com/MOMOKO606/Leetcode/tree/master/0091-decode-ways) |
| [0095-unique-binary-search-trees-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0095-unique-binary-search-trees-ii) |
| [0096-unique-binary-search-trees](https://github.com/MOMOKO606/Leetcode/tree/master/0096-unique-binary-search-trees) |
| [0097-interleaving-string](https://github.com/MOMOKO606/Leetcode/tree/master/0097-interleaving-string) |
| [0115-distinct-subsequences](https://github.com/MOMOKO606/Leetcode/tree/master/0115-distinct-subsequences) |
| [0118-pascals-triangle](https://github.com/MOMOKO606/Leetcode/tree/master/0118-pascals-triangle) |
| [0119-pascals-triangle-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0119-pascals-triangle-ii) |
| [0120-triangle](https://github.com/MOMOKO606/Leetcode/tree/master/0120-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/MOMOKO606/Leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |
| [0124-binary-tree-maximum-path-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0124-binary-tree-maximum-path-sum) |
| [0131-palindrome-partitioning](https://github.com/MOMOKO606/Leetcode/tree/master/0131-palindrome-partitioning) |
| [0132-palindrome-partitioning-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0132-palindrome-partitioning-ii) |
| [0139-word-break](https://github.com/MOMOKO606/Leetcode/tree/master/0139-word-break) |
| [0140-word-break-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0140-word-break-ii) |
| [0152-maximum-product-subarray](https://github.com/MOMOKO606/Leetcode/tree/master/0152-maximum-product-subarray) |
| [0174-dungeon-game](https://github.com/MOMOKO606/Leetcode/tree/master/0174-dungeon-game) |
| [0188-best-time-to-buy-and-sell-stock-iv](https://github.com/MOMOKO606/Leetcode/tree/master/0188-best-time-to-buy-and-sell-stock-iv) |
| [0198-house-robber](https://github.com/MOMOKO606/Leetcode/tree/master/0198-house-robber) |
| [0213-house-robber-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0213-house-robber-ii) |
| [0233-number-of-digit-one](https://github.com/MOMOKO606/Leetcode/tree/master/0233-number-of-digit-one) |
| [0264-ugly-number-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0264-ugly-number-ii) |
| [0279-perfect-squares](https://github.com/MOMOKO606/Leetcode/tree/master/0279-perfect-squares) |
| [0300-longest-increasing-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0300-longest-increasing-subsequence) |
| [0309-best-time-to-buy-and-sell-stock-with-cooldown](https://github.com/MOMOKO606/Leetcode/tree/master/0309-best-time-to-buy-and-sell-stock-with-cooldown) |
| [0312-burst-balloons](https://github.com/MOMOKO606/Leetcode/tree/master/0312-burst-balloons) |
| [0322-coin-change](https://github.com/MOMOKO606/Leetcode/tree/master/0322-coin-change) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0368-largest-divisible-subset](https://github.com/MOMOKO606/Leetcode/tree/master/0368-largest-divisible-subset) |
| [0376-wiggle-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0376-wiggle-subsequence) |
| [0377-combination-sum-iv](https://github.com/MOMOKO606/Leetcode/tree/master/0377-combination-sum-iv) |
| [0392-is-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0392-is-subsequence) |
| [0403-frog-jump](https://github.com/MOMOKO606/Leetcode/tree/master/0403-frog-jump) |
| [0410-split-array-largest-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0410-split-array-largest-sum) |
| [0413-arithmetic-slices](https://github.com/MOMOKO606/Leetcode/tree/master/0413-arithmetic-slices) |
| [0416-partition-equal-subset-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0416-partition-equal-subset-sum) |
| [0435-non-overlapping-intervals](https://github.com/MOMOKO606/Leetcode/tree/master/0435-non-overlapping-intervals) |
| [0471-encode-string-with-shortest-length](https://github.com/MOMOKO606/Leetcode/tree/master/0471-encode-string-with-shortest-length) |
| [0474-ones-and-zeroes](https://github.com/MOMOKO606/Leetcode/tree/master/0474-ones-and-zeroes) |
| [0494-target-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0494-target-sum) |
| [0516-longest-palindromic-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0516-longest-palindromic-subsequence) |
| [0518-coin-change-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0518-coin-change-ii) |
| [0647-palindromic-substrings](https://github.com/MOMOKO606/Leetcode/tree/master/0647-palindromic-substrings) |
| [0730-count-different-palindromic-subsequences](https://github.com/MOMOKO606/Leetcode/tree/master/0730-count-different-palindromic-subsequences) |
| [0836-race-car](https://github.com/MOMOKO606/Leetcode/tree/master/0836-race-car) |
| [0943-sum-of-subarray-minimums](https://github.com/MOMOKO606/Leetcode/tree/master/0943-sum-of-subarray-minimums) |
| [1013-fibonacci-number](https://github.com/MOMOKO606/Leetcode/tree/master/1013-fibonacci-number) |
| [1057-numbers-with-repeated-digits](https://github.com/MOMOKO606/Leetcode/tree/master/1057-numbers-with-repeated-digits) |
| [2710-minimum-operations-to-reduce-an-integer-to-0](https://github.com/MOMOKO606/Leetcode/tree/master/2710-minimum-operations-to-reduce-an-integer-to-0) |
| [3364-minimum-sum-of-values-by-dividing-array](https://github.com/MOMOKO606/Leetcode/tree/master/3364-minimum-sum-of-values-by-dividing-array) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/MOMOKO606/Leetcode/tree/master/0002-add-two-numbers) |
| [0010-regular-expression-matching](https://github.com/MOMOKO606/Leetcode/tree/master/0010-regular-expression-matching) |
| [0021-merge-two-sorted-lists](https://github.com/MOMOKO606/Leetcode/tree/master/0021-merge-two-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0024-swap-nodes-in-pairs) |
| [0025-reverse-nodes-in-k-group](https://github.com/MOMOKO606/Leetcode/tree/master/0025-reverse-nodes-in-k-group) |
| [0044-wildcard-matching](https://github.com/MOMOKO606/Leetcode/tree/master/0044-wildcard-matching) |
| [0050-powx-n](https://github.com/MOMOKO606/Leetcode/tree/master/0050-powx-n) |
| [0060-permutation-sequence](https://github.com/MOMOKO606/Leetcode/tree/master/0060-permutation-sequence) |
| [0143-reorder-list](https://github.com/MOMOKO606/Leetcode/tree/master/0143-reorder-list) |
| [0206-reverse-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0206-reverse-linked-list) |
| [0224-basic-calculator](https://github.com/MOMOKO606/Leetcode/tree/master/0224-basic-calculator) |
| [0231-power-of-two](https://github.com/MOMOKO606/Leetcode/tree/master/0231-power-of-two) |
| [0233-number-of-digit-one](https://github.com/MOMOKO606/Leetcode/tree/master/0233-number-of-digit-one) |
| [0234-palindrome-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0234-palindrome-linked-list) |
| [0326-power-of-three](https://github.com/MOMOKO606/Leetcode/tree/master/0326-power-of-three) |
| [0342-power-of-four](https://github.com/MOMOKO606/Leetcode/tree/master/0342-power-of-four) |
| [0394-decode-string](https://github.com/MOMOKO606/Leetcode/tree/master/0394-decode-string) |
| [0785-basic-calculator-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0785-basic-calculator-iii) |
| [1013-fibonacci-number](https://github.com/MOMOKO606/Leetcode/tree/master/1013-fibonacci-number) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/MOMOKO606/Leetcode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0005-longest-palindromic-substring](https://github.com/MOMOKO606/Leetcode/tree/master/0005-longest-palindromic-substring) |
| [0006-zigzag-conversion](https://github.com/MOMOKO606/Leetcode/tree/master/0006-zigzag-conversion) |
| [0008-string-to-integer-atoi](https://github.com/MOMOKO606/Leetcode/tree/master/0008-string-to-integer-atoi) |
| [0010-regular-expression-matching](https://github.com/MOMOKO606/Leetcode/tree/master/0010-regular-expression-matching) |
| [0012-integer-to-roman](https://github.com/MOMOKO606/Leetcode/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/MOMOKO606/Leetcode/tree/master/0013-roman-to-integer) |
| [0014-longest-common-prefix](https://github.com/MOMOKO606/Leetcode/tree/master/0014-longest-common-prefix) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/MOMOKO606/Leetcode/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0020-valid-parentheses](https://github.com/MOMOKO606/Leetcode/tree/master/0020-valid-parentheses) |
| [0022-generate-parentheses](https://github.com/MOMOKO606/Leetcode/tree/master/0022-generate-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/MOMOKO606/Leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0030-substring-with-concatenation-of-all-words](https://github.com/MOMOKO606/Leetcode/tree/master/0030-substring-with-concatenation-of-all-words) |
| [0032-longest-valid-parentheses](https://github.com/MOMOKO606/Leetcode/tree/master/0032-longest-valid-parentheses) |
| [0038-count-and-say](https://github.com/MOMOKO606/Leetcode/tree/master/0038-count-and-say) |
| [0043-multiply-strings](https://github.com/MOMOKO606/Leetcode/tree/master/0043-multiply-strings) |
| [0044-wildcard-matching](https://github.com/MOMOKO606/Leetcode/tree/master/0044-wildcard-matching) |
| [0049-group-anagrams](https://github.com/MOMOKO606/Leetcode/tree/master/0049-group-anagrams) |
| [0058-length-of-last-word](https://github.com/MOMOKO606/Leetcode/tree/master/0058-length-of-last-word) |
| [0065-valid-number](https://github.com/MOMOKO606/Leetcode/tree/master/0065-valid-number) |
| [0067-add-binary](https://github.com/MOMOKO606/Leetcode/tree/master/0067-add-binary) |
| [0068-text-justification](https://github.com/MOMOKO606/Leetcode/tree/master/0068-text-justification) |
| [0071-simplify-path](https://github.com/MOMOKO606/Leetcode/tree/master/0071-simplify-path) |
| [0072-edit-distance](https://github.com/MOMOKO606/Leetcode/tree/master/0072-edit-distance) |
| [0076-minimum-window-substring](https://github.com/MOMOKO606/Leetcode/tree/master/0076-minimum-window-substring) |
| [0079-word-search](https://github.com/MOMOKO606/Leetcode/tree/master/0079-word-search) |
| [0087-scramble-string](https://github.com/MOMOKO606/Leetcode/tree/master/0087-scramble-string) |
| [0091-decode-ways](https://github.com/MOMOKO606/Leetcode/tree/master/0091-decode-ways) |
| [0093-restore-ip-addresses](https://github.com/MOMOKO606/Leetcode/tree/master/0093-restore-ip-addresses) |
| [0097-interleaving-string](https://github.com/MOMOKO606/Leetcode/tree/master/0097-interleaving-string) |
| [0115-distinct-subsequences](https://github.com/MOMOKO606/Leetcode/tree/master/0115-distinct-subsequences) |
| [0125-valid-palindrome](https://github.com/MOMOKO606/Leetcode/tree/master/0125-valid-palindrome) |
| [0126-word-ladder-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0126-word-ladder-ii) |
| [0127-word-ladder](https://github.com/MOMOKO606/Leetcode/tree/master/0127-word-ladder) |
| [0131-palindrome-partitioning](https://github.com/MOMOKO606/Leetcode/tree/master/0131-palindrome-partitioning) |
| [0132-palindrome-partitioning-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0132-palindrome-partitioning-ii) |
| [0139-word-break](https://github.com/MOMOKO606/Leetcode/tree/master/0139-word-break) |
| [0140-word-break-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0140-word-break-ii) |
| [0151-reverse-words-in-a-string](https://github.com/MOMOKO606/Leetcode/tree/master/0151-reverse-words-in-a-string) |
| [0159-longest-substring-with-at-most-two-distinct-characters](https://github.com/MOMOKO606/Leetcode/tree/master/0159-longest-substring-with-at-most-two-distinct-characters) |
| [0161-one-edit-distance](https://github.com/MOMOKO606/Leetcode/tree/master/0161-one-edit-distance) |
| [0165-compare-version-numbers](https://github.com/MOMOKO606/Leetcode/tree/master/0165-compare-version-numbers) |
| [0166-fraction-to-recurring-decimal](https://github.com/MOMOKO606/Leetcode/tree/master/0166-fraction-to-recurring-decimal) |
| [0168-excel-sheet-column-title](https://github.com/MOMOKO606/Leetcode/tree/master/0168-excel-sheet-column-title) |
| [0171-excel-sheet-column-number](https://github.com/MOMOKO606/Leetcode/tree/master/0171-excel-sheet-column-number) |
| [0179-largest-number](https://github.com/MOMOKO606/Leetcode/tree/master/0179-largest-number) |
| [0186-reverse-words-in-a-string-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0186-reverse-words-in-a-string-ii) |
| [0187-repeated-dna-sequences](https://github.com/MOMOKO606/Leetcode/tree/master/0187-repeated-dna-sequences) |
| [0205-isomorphic-strings](https://github.com/MOMOKO606/Leetcode/tree/master/0205-isomorphic-strings) |
| [0208-implement-trie-prefix-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0208-implement-trie-prefix-tree) |
| [0211-design-add-and-search-words-data-structure](https://github.com/MOMOKO606/Leetcode/tree/master/0211-design-add-and-search-words-data-structure) |
| [0212-word-search-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0212-word-search-ii) |
| [0214-shortest-palindrome](https://github.com/MOMOKO606/Leetcode/tree/master/0214-shortest-palindrome) |
| [0224-basic-calculator](https://github.com/MOMOKO606/Leetcode/tree/master/0224-basic-calculator) |
| [0227-basic-calculator-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0227-basic-calculator-ii) |
| [0257-binary-tree-paths](https://github.com/MOMOKO606/Leetcode/tree/master/0257-binary-tree-paths) |
| [0269-alien-dictionary](https://github.com/MOMOKO606/Leetcode/tree/master/0269-alien-dictionary) |
| [0290-word-pattern](https://github.com/MOMOKO606/Leetcode/tree/master/0290-word-pattern) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0299-bulls-and-cows](https://github.com/MOMOKO606/Leetcode/tree/master/0299-bulls-and-cows) |
| [0316-remove-duplicate-letters](https://github.com/MOMOKO606/Leetcode/tree/master/0316-remove-duplicate-letters) |
| [0336-palindrome-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0336-palindrome-pairs) |
| [0345-reverse-vowels-of-a-string](https://github.com/MOMOKO606/Leetcode/tree/master/0345-reverse-vowels-of-a-string) |
| [0383-ransom-note](https://github.com/MOMOKO606/Leetcode/tree/master/0383-ransom-note) |
| [0389-find-the-difference](https://github.com/MOMOKO606/Leetcode/tree/master/0389-find-the-difference) |
| [0392-is-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0392-is-subsequence) |
| [0394-decode-string](https://github.com/MOMOKO606/Leetcode/tree/master/0394-decode-string) |
| [0395-longest-substring-with-at-least-k-repeating-characters](https://github.com/MOMOKO606/Leetcode/tree/master/0395-longest-substring-with-at-least-k-repeating-characters) |
| [0399-evaluate-division](https://github.com/MOMOKO606/Leetcode/tree/master/0399-evaluate-division) |
| [0402-remove-k-digits](https://github.com/MOMOKO606/Leetcode/tree/master/0402-remove-k-digits) |
| [0424-longest-repeating-character-replacement](https://github.com/MOMOKO606/Leetcode/tree/master/0424-longest-repeating-character-replacement) |
| [0433-minimum-genetic-mutation](https://github.com/MOMOKO606/Leetcode/tree/master/0433-minimum-genetic-mutation) |
| [0438-find-all-anagrams-in-a-string](https://github.com/MOMOKO606/Leetcode/tree/master/0438-find-all-anagrams-in-a-string) |
| [0443-string-compression](https://github.com/MOMOKO606/Leetcode/tree/master/0443-string-compression) |
| [0449-serialize-and-deserialize-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0449-serialize-and-deserialize-bst) |
| [0451-sort-characters-by-frequency](https://github.com/MOMOKO606/Leetcode/tree/master/0451-sort-characters-by-frequency) |
| [0459-repeated-substring-pattern](https://github.com/MOMOKO606/Leetcode/tree/master/0459-repeated-substring-pattern) |
| [0471-encode-string-with-shortest-length](https://github.com/MOMOKO606/Leetcode/tree/master/0471-encode-string-with-shortest-length) |
| [0474-ones-and-zeroes](https://github.com/MOMOKO606/Leetcode/tree/master/0474-ones-and-zeroes) |
| [0516-longest-palindromic-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0516-longest-palindromic-subsequence) |
| [0541-reverse-string-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0541-reverse-string-ii) |
| [0557-reverse-words-in-a-string-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0557-reverse-words-in-a-string-iii) |
| [0588-design-in-memory-file-system](https://github.com/MOMOKO606/Leetcode/tree/master/0588-design-in-memory-file-system) |
| [0647-palindromic-substrings](https://github.com/MOMOKO606/Leetcode/tree/master/0647-palindromic-substrings) |
| [0649-dota2-senate](https://github.com/MOMOKO606/Leetcode/tree/master/0649-dota2-senate) |
| [0680-valid-palindrome-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0680-valid-palindrome-ii) |
| [0696-count-binary-substrings](https://github.com/MOMOKO606/Leetcode/tree/master/0696-count-binary-substrings) |
| [0730-count-different-palindromic-subsequences](https://github.com/MOMOKO606/Leetcode/tree/master/0730-count-different-palindromic-subsequences) |
| [0778-reorganize-string](https://github.com/MOMOKO606/Leetcode/tree/master/0778-reorganize-string) |
| [0785-basic-calculator-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0785-basic-calculator-iii) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/MOMOKO606/Leetcode/tree/master/1159-smallest-subsequence-of-distinct-characters) |
| [1321-get-equal-substrings-within-budget](https://github.com/MOMOKO606/Leetcode/tree/master/1321-get-equal-substrings-within-budget) |
| [1652-minimum-suffix-flips](https://github.com/MOMOKO606/Leetcode/tree/master/1652-minimum-suffix-flips) |
| [3150-shortest-and-lexicographically-smallest-beautiful-string](https://github.com/MOMOKO606/Leetcode/tree/master/3150-shortest-and-lexicographically-smallest-beautiful-string) |
| [3376-longest-common-suffix-queries](https://github.com/MOMOKO606/Leetcode/tree/master/3376-longest-common-suffix-queries) |
| [3395-minimum-length-of-anagram-concatenation](https://github.com/MOMOKO606/Leetcode/tree/master/3395-minimum-length-of-anagram-concatenation) |
| [3455-minimum-length-of-string-after-operations](https://github.com/MOMOKO606/Leetcode/tree/master/3455-minimum-length-of-string-after-operations) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/MOMOKO606/Leetcode/tree/master/0011-container-with-most-water) |
| [0044-wildcard-matching](https://github.com/MOMOKO606/Leetcode/tree/master/0044-wildcard-matching) |
| [0045-jump-game-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/MOMOKO606/Leetcode/tree/master/0055-jump-game) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0134-gas-station](https://github.com/MOMOKO606/Leetcode/tree/master/0134-gas-station) |
| [0135-candy](https://github.com/MOMOKO606/Leetcode/tree/master/0135-candy) |
| [0179-largest-number](https://github.com/MOMOKO606/Leetcode/tree/master/0179-largest-number) |
| [0253-meeting-rooms-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0253-meeting-rooms-ii) |
| [0316-remove-duplicate-letters](https://github.com/MOMOKO606/Leetcode/tree/master/0316-remove-duplicate-letters) |
| [0334-increasing-triplet-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0334-increasing-triplet-subsequence) |
| [0376-wiggle-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0376-wiggle-subsequence) |
| [0402-remove-k-digits](https://github.com/MOMOKO606/Leetcode/tree/master/0402-remove-k-digits) |
| [0410-split-array-largest-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0410-split-array-largest-sum) |
| [0435-non-overlapping-intervals](https://github.com/MOMOKO606/Leetcode/tree/master/0435-non-overlapping-intervals) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/MOMOKO606/Leetcode/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0455-assign-cookies](https://github.com/MOMOKO606/Leetcode/tree/master/0455-assign-cookies) |
| [0502-ipo](https://github.com/MOMOKO606/Leetcode/tree/master/0502-ipo) |
| [0605-can-place-flowers](https://github.com/MOMOKO606/Leetcode/tree/master/0605-can-place-flowers) |
| [0621-task-scheduler](https://github.com/MOMOKO606/Leetcode/tree/master/0621-task-scheduler) |
| [0649-dota2-senate](https://github.com/MOMOKO606/Leetcode/tree/master/0649-dota2-senate) |
| [0680-valid-palindrome-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0680-valid-palindrome-ii) |
| [0778-reorganize-string](https://github.com/MOMOKO606/Leetcode/tree/master/0778-reorganize-string) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/MOMOKO606/Leetcode/tree/master/1159-smallest-subsequence-of-distinct-characters) |
| [1652-minimum-suffix-flips](https://github.com/MOMOKO606/Leetcode/tree/master/1652-minimum-suffix-flips) |
| [2661-smallest-missing-non-negative-integer-after-operations](https://github.com/MOMOKO606/Leetcode/tree/master/2661-smallest-missing-non-negative-integer-after-operations) |
| [2710-minimum-operations-to-reduce-an-integer-to-0](https://github.com/MOMOKO606/Leetcode/tree/master/2710-minimum-operations-to-reduce-an-integer-to-0) |
| [3328-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k](https://github.com/MOMOKO606/Leetcode/tree/master/3328-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k) |
| [3387-minimum-operations-to-make-median-of-array-equal-to-k](https://github.com/MOMOKO606/Leetcode/tree/master/3387-minimum-operations-to-make-median-of-array-equal-to-k) |
## Enumeration
| |
| ------- |
| [0204-count-primes](https://github.com/MOMOKO606/Leetcode/tree/master/0204-count-primes) |
| [3328-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k](https://github.com/MOMOKO606/Leetcode/tree/master/3328-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/MOMOKO606/Leetcode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0012-integer-to-roman](https://github.com/MOMOKO606/Leetcode/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/MOMOKO606/Leetcode/tree/master/0013-roman-to-integer) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/MOMOKO606/Leetcode/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0030-substring-with-concatenation-of-all-words](https://github.com/MOMOKO606/Leetcode/tree/master/0030-substring-with-concatenation-of-all-words) |
| [0036-valid-sudoku](https://github.com/MOMOKO606/Leetcode/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/MOMOKO606/Leetcode/tree/master/0037-sudoku-solver) |
| [0041-first-missing-positive](https://github.com/MOMOKO606/Leetcode/tree/master/0041-first-missing-positive) |
| [0049-group-anagrams](https://github.com/MOMOKO606/Leetcode/tree/master/0049-group-anagrams) |
| [0073-set-matrix-zeroes](https://github.com/MOMOKO606/Leetcode/tree/master/0073-set-matrix-zeroes) |
| [0076-minimum-window-substring](https://github.com/MOMOKO606/Leetcode/tree/master/0076-minimum-window-substring) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0126-word-ladder-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0126-word-ladder-ii) |
| [0127-word-ladder](https://github.com/MOMOKO606/Leetcode/tree/master/0127-word-ladder) |
| [0128-longest-consecutive-sequence](https://github.com/MOMOKO606/Leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0133-clone-graph](https://github.com/MOMOKO606/Leetcode/tree/master/0133-clone-graph) |
| [0138-copy-list-with-random-pointer](https://github.com/MOMOKO606/Leetcode/tree/master/0138-copy-list-with-random-pointer) |
| [0139-word-break](https://github.com/MOMOKO606/Leetcode/tree/master/0139-word-break) |
| [0140-word-break-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0140-word-break-ii) |
| [0141-linked-list-cycle](https://github.com/MOMOKO606/Leetcode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0142-linked-list-cycle-ii) |
| [0146-lru-cache](https://github.com/MOMOKO606/Leetcode/tree/master/0146-lru-cache) |
| [0149-max-points-on-a-line](https://github.com/MOMOKO606/Leetcode/tree/master/0149-max-points-on-a-line) |
| [0159-longest-substring-with-at-most-two-distinct-characters](https://github.com/MOMOKO606/Leetcode/tree/master/0159-longest-substring-with-at-most-two-distinct-characters) |
| [0160-intersection-of-two-linked-lists](https://github.com/MOMOKO606/Leetcode/tree/master/0160-intersection-of-two-linked-lists) |
| [0166-fraction-to-recurring-decimal](https://github.com/MOMOKO606/Leetcode/tree/master/0166-fraction-to-recurring-decimal) |
| [0169-majority-element](https://github.com/MOMOKO606/Leetcode/tree/master/0169-majority-element) |
| [0170-two-sum-iii-data-structure-design](https://github.com/MOMOKO606/Leetcode/tree/master/0170-two-sum-iii-data-structure-design) |
| [0187-repeated-dna-sequences](https://github.com/MOMOKO606/Leetcode/tree/master/0187-repeated-dna-sequences) |
| [0202-happy-number](https://github.com/MOMOKO606/Leetcode/tree/master/0202-happy-number) |
| [0205-isomorphic-strings](https://github.com/MOMOKO606/Leetcode/tree/master/0205-isomorphic-strings) |
| [0208-implement-trie-prefix-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0208-implement-trie-prefix-tree) |
| [0219-contains-duplicate-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0219-contains-duplicate-ii) |
| [0264-ugly-number-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0264-ugly-number-ii) |
| [0268-missing-number](https://github.com/MOMOKO606/Leetcode/tree/master/0268-missing-number) |
| [0290-word-pattern](https://github.com/MOMOKO606/Leetcode/tree/master/0290-word-pattern) |
| [0299-bulls-and-cows](https://github.com/MOMOKO606/Leetcode/tree/master/0299-bulls-and-cows) |
| [0336-palindrome-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0336-palindrome-pairs) |
| [0350-intersection-of-two-arrays-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0359-logger-rate-limiter](https://github.com/MOMOKO606/Leetcode/tree/master/0359-logger-rate-limiter) |
| [0380-insert-delete-getrandom-o1](https://github.com/MOMOKO606/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |
| [0383-ransom-note](https://github.com/MOMOKO606/Leetcode/tree/master/0383-ransom-note) |
| [0389-find-the-difference](https://github.com/MOMOKO606/Leetcode/tree/master/0389-find-the-difference) |
| [0395-longest-substring-with-at-least-k-repeating-characters](https://github.com/MOMOKO606/Leetcode/tree/master/0395-longest-substring-with-at-least-k-repeating-characters) |
| [0424-longest-repeating-character-replacement](https://github.com/MOMOKO606/Leetcode/tree/master/0424-longest-repeating-character-replacement) |
| [0433-minimum-genetic-mutation](https://github.com/MOMOKO606/Leetcode/tree/master/0433-minimum-genetic-mutation) |
| [0438-find-all-anagrams-in-a-string](https://github.com/MOMOKO606/Leetcode/tree/master/0438-find-all-anagrams-in-a-string) |
| [0451-sort-characters-by-frequency](https://github.com/MOMOKO606/Leetcode/tree/master/0451-sort-characters-by-frequency) |
| [0496-next-greater-element-i](https://github.com/MOMOKO606/Leetcode/tree/master/0496-next-greater-element-i) |
| [0523-continuous-subarray-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0523-continuous-subarray-sum) |
| [0560-subarray-sum-equals-k](https://github.com/MOMOKO606/Leetcode/tree/master/0560-subarray-sum-equals-k) |
| [0588-design-in-memory-file-system](https://github.com/MOMOKO606/Leetcode/tree/master/0588-design-in-memory-file-system) |
| [0621-task-scheduler](https://github.com/MOMOKO606/Leetcode/tree/master/0621-task-scheduler) |
| [0778-reorganize-string](https://github.com/MOMOKO606/Leetcode/tree/master/0778-reorganize-string) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/MOMOKO606/Leetcode/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2661-smallest-missing-non-negative-integer-after-operations](https://github.com/MOMOKO606/Leetcode/tree/master/2661-smallest-missing-non-negative-integer-after-operations) |
| [3254-number-of-divisible-triplet-sums](https://github.com/MOMOKO606/Leetcode/tree/master/3254-number-of-divisible-triplet-sums) |
| [3363-most-frequent-ids](https://github.com/MOMOKO606/Leetcode/tree/master/3363-most-frequent-ids) |
| [3395-minimum-length-of-anagram-concatenation](https://github.com/MOMOKO606/Leetcode/tree/master/3395-minimum-length-of-anagram-concatenation) |
| [3420-find-occurrences-of-an-element-in-an-array](https://github.com/MOMOKO606/Leetcode/tree/master/3420-find-occurrences-of-an-element-in-an-array) |
| [3455-minimum-length-of-string-after-operations](https://github.com/MOMOKO606/Leetcode/tree/master/3455-minimum-length-of-string-after-operations) |
## Heap (Priority Queue)
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/MOMOKO606/Leetcode/tree/master/0023-merge-k-sorted-lists) |
| [0215-kth-largest-element-in-an-array](https://github.com/MOMOKO606/Leetcode/tree/master/0215-kth-largest-element-in-an-array) |
| [0218-the-skyline-problem](https://github.com/MOMOKO606/Leetcode/tree/master/0218-the-skyline-problem) |
| [0239-sliding-window-maximum](https://github.com/MOMOKO606/Leetcode/tree/master/0239-sliding-window-maximum) |
| [0253-meeting-rooms-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0253-meeting-rooms-ii) |
| [0264-ugly-number-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0264-ugly-number-ii) |
| [0295-find-median-from-data-stream](https://github.com/MOMOKO606/Leetcode/tree/master/0295-find-median-from-data-stream) |
| [0373-find-k-pairs-with-smallest-sums](https://github.com/MOMOKO606/Leetcode/tree/master/0373-find-k-pairs-with-smallest-sums) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0451-sort-characters-by-frequency](https://github.com/MOMOKO606/Leetcode/tree/master/0451-sort-characters-by-frequency) |
| [0502-ipo](https://github.com/MOMOKO606/Leetcode/tree/master/0502-ipo) |
| [0621-task-scheduler](https://github.com/MOMOKO606/Leetcode/tree/master/0621-task-scheduler) |
| [0778-reorganize-string](https://github.com/MOMOKO606/Leetcode/tree/master/0778-reorganize-string) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/MOMOKO606/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [3363-most-frequent-ids](https://github.com/MOMOKO606/Leetcode/tree/master/3363-most-frequent-ids) |
## Ordered Set
| |
| ------- |
| [0218-the-skyline-problem](https://github.com/MOMOKO606/Leetcode/tree/master/0218-the-skyline-problem) |
| [0220-contains-duplicate-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0220-contains-duplicate-iii) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/MOMOKO606/Leetcode/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0363-max-sum-of-rectangle-no-larger-than-k](https://github.com/MOMOKO606/Leetcode/tree/master/0363-max-sum-of-rectangle-no-larger-than-k) |
| [0456-132-pattern](https://github.com/MOMOKO606/Leetcode/tree/master/0456-132-pattern) |
| [0493-reverse-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0493-reverse-pairs) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/MOMOKO606/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [1772-create-sorted-array-through-instructions](https://github.com/MOMOKO606/Leetcode/tree/master/1772-create-sorted-array-through-instructions) |
| [3363-most-frequent-ids](https://github.com/MOMOKO606/Leetcode/tree/master/3363-most-frequent-ids) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/MOMOKO606/Leetcode/tree/master/0014-longest-common-prefix) |
| [0139-word-break](https://github.com/MOMOKO606/Leetcode/tree/master/0139-word-break) |
| [0140-word-break-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0140-word-break-ii) |
| [0208-implement-trie-prefix-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0208-implement-trie-prefix-tree) |
| [0211-design-add-and-search-words-data-structure](https://github.com/MOMOKO606/Leetcode/tree/master/0211-design-add-and-search-words-data-structure) |
| [0212-word-search-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0212-word-search-ii) |
| [0336-palindrome-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0336-palindrome-pairs) |
| [0588-design-in-memory-file-system](https://github.com/MOMOKO606/Leetcode/tree/master/0588-design-in-memory-file-system) |
| [3376-longest-common-suffix-queries](https://github.com/MOMOKO606/Leetcode/tree/master/3376-longest-common-suffix-queries) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/MOMOKO606/Leetcode/tree/master/0004-median-of-two-sorted-arrays) |
| [0023-merge-k-sorted-lists](https://github.com/MOMOKO606/Leetcode/tree/master/0023-merge-k-sorted-lists) |
| [0053-maximum-subarray](https://github.com/MOMOKO606/Leetcode/tree/master/0053-maximum-subarray) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0148-sort-list](https://github.com/MOMOKO606/Leetcode/tree/master/0148-sort-list) |
| [0169-majority-element](https://github.com/MOMOKO606/Leetcode/tree/master/0169-majority-element) |
| [0190-reverse-bits](https://github.com/MOMOKO606/Leetcode/tree/master/0190-reverse-bits) |
| [0191-number-of-1-bits](https://github.com/MOMOKO606/Leetcode/tree/master/0191-number-of-1-bits) |
| [0215-kth-largest-element-in-an-array](https://github.com/MOMOKO606/Leetcode/tree/master/0215-kth-largest-element-in-an-array) |
| [0218-the-skyline-problem](https://github.com/MOMOKO606/Leetcode/tree/master/0218-the-skyline-problem) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/MOMOKO606/Leetcode/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0395-longest-substring-with-at-least-k-repeating-characters](https://github.com/MOMOKO606/Leetcode/tree/master/0395-longest-substring-with-at-least-k-repeating-characters) |
| [0493-reverse-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0493-reverse-pairs) |
| [0772-construct-quad-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0772-construct-quad-tree) |
| [1772-create-sorted-array-through-instructions](https://github.com/MOMOKO606/Leetcode/tree/master/1772-create-sorted-array-through-instructions) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |
| [0095-unique-binary-search-trees-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0095-unique-binary-search-trees-ii) |
| [0096-unique-binary-search-trees](https://github.com/MOMOKO606/Leetcode/tree/master/0096-unique-binary-search-trees) |
| [0098-validate-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0107-binary-tree-level-order-traversal-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0107-binary-tree-level-order-traversal-ii) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0110-balanced-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0110-balanced-binary-tree) |
| [0111-minimum-depth-of-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0111-minimum-depth-of-binary-tree) |
| [0112-path-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0113-path-sum-ii) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/MOMOKO606/Leetcode/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0124-binary-tree-maximum-path-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/MOMOKO606/Leetcode/tree/master/0129-sum-root-to-leaf-numbers) |
| [0144-binary-tree-preorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0145-binary-tree-postorder-traversal) |
| [0156-binary-tree-upside-down](https://github.com/MOMOKO606/Leetcode/tree/master/0156-binary-tree-upside-down) |
| [0173-binary-search-tree-iterator](https://github.com/MOMOKO606/Leetcode/tree/master/0173-binary-search-tree-iterator) |
| [0222-count-complete-tree-nodes](https://github.com/MOMOKO606/Leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0226-invert-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/MOMOKO606/Leetcode/tree/master/0257-binary-tree-paths) |
| [0270-closest-binary-search-tree-value](https://github.com/MOMOKO606/Leetcode/tree/master/0270-closest-binary-search-tree-value) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0404-sum-of-left-leaves](https://github.com/MOMOKO606/Leetcode/tree/master/0404-sum-of-left-leaves) |
| [0437-path-sum-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0437-path-sum-iii) |
| [0449-serialize-and-deserialize-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0449-serialize-and-deserialize-bst) |
| [0450-delete-node-in-a-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0450-delete-node-in-a-bst) |
| [0501-find-mode-in-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0501-find-mode-in-binary-search-tree) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/MOMOKO606/Leetcode/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0530-minimum-absolute-difference-in-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0530-minimum-absolute-difference-in-bst) |
| [0538-convert-bst-to-greater-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0538-convert-bst-to-greater-tree) |
| [0543-diameter-of-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0543-diameter-of-binary-tree) |
| [0637-average-of-levels-in-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0637-average-of-levels-in-binary-tree) |
| [0687-longest-univalue-path](https://github.com/MOMOKO606/Leetcode/tree/master/0687-longest-univalue-path) |
| [0764-n-ary-tree-level-order-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0764-n-ary-tree-level-order-traversal) |
| [0772-construct-quad-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0772-construct-quad-tree) |
| [0775-n-ary-tree-preorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0775-n-ary-tree-preorder-traversal) |
| [3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network](https://github.com/MOMOKO606/Leetcode/tree/master/3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network) |
## Matrix
| |
| ------- |
| [0036-valid-sudoku](https://github.com/MOMOKO606/Leetcode/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/MOMOKO606/Leetcode/tree/master/0037-sudoku-solver) |
| [0048-rotate-image](https://github.com/MOMOKO606/Leetcode/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0054-spiral-matrix) |
| [0059-spiral-matrix-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0059-spiral-matrix-ii) |
| [0063-unique-paths-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0064-minimum-path-sum) |
| [0073-set-matrix-zeroes](https://github.com/MOMOKO606/Leetcode/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0074-search-a-2d-matrix) |
| [0079-word-search](https://github.com/MOMOKO606/Leetcode/tree/master/0079-word-search) |
| [0085-maximal-rectangle](https://github.com/MOMOKO606/Leetcode/tree/master/0085-maximal-rectangle) |
| [0130-surrounded-regions](https://github.com/MOMOKO606/Leetcode/tree/master/0130-surrounded-regions) |
| [0174-dungeon-game](https://github.com/MOMOKO606/Leetcode/tree/master/0174-dungeon-game) |
| [0200-number-of-islands](https://github.com/MOMOKO606/Leetcode/tree/master/0200-number-of-islands) |
| [0212-word-search-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0212-word-search-ii) |
| [0304-range-sum-query-2d-immutable](https://github.com/MOMOKO606/Leetcode/tree/master/0304-range-sum-query-2d-immutable) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0363-max-sum-of-rectangle-no-larger-than-k](https://github.com/MOMOKO606/Leetcode/tree/master/0363-max-sum-of-rectangle-no-larger-than-k) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0463-island-perimeter](https://github.com/MOMOKO606/Leetcode/tree/master/0463-island-perimeter) |
| [0490-the-maze](https://github.com/MOMOKO606/Leetcode/tree/master/0490-the-maze) |
| [0529-minesweeper](https://github.com/MOMOKO606/Leetcode/tree/master/0529-minesweeper) |
| [0772-construct-quad-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0772-construct-quad-tree) |
| [0787-sliding-puzzle](https://github.com/MOMOKO606/Leetcode/tree/master/0787-sliding-puzzle) |
| [1171-shortest-path-in-binary-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/1171-shortest-path-in-binary-matrix) |
| [2631-sort-the-students-by-their-kth-score](https://github.com/MOMOKO606/Leetcode/tree/master/2631-sort-the-students-by-their-kth-score) |
## Depth-First Search
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0110-balanced-binary-tree) |
| [0111-minimum-depth-of-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0111-minimum-depth-of-binary-tree) |
| [0112-path-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0113-path-sum-ii) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/MOMOKO606/Leetcode/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0124-binary-tree-maximum-path-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/MOMOKO606/Leetcode/tree/master/0129-sum-root-to-leaf-numbers) |
| [0130-surrounded-regions](https://github.com/MOMOKO606/Leetcode/tree/master/0130-surrounded-regions) |
| [0133-clone-graph](https://github.com/MOMOKO606/Leetcode/tree/master/0133-clone-graph) |
| [0144-binary-tree-preorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0145-binary-tree-postorder-traversal) |
| [0156-binary-tree-upside-down](https://github.com/MOMOKO606/Leetcode/tree/master/0156-binary-tree-upside-down) |
| [0200-number-of-islands](https://github.com/MOMOKO606/Leetcode/tree/master/0200-number-of-islands) |
| [0207-course-schedule](https://github.com/MOMOKO606/Leetcode/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0210-course-schedule-ii) |
| [0211-design-add-and-search-words-data-structure](https://github.com/MOMOKO606/Leetcode/tree/master/0211-design-add-and-search-words-data-structure) |
| [0226-invert-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/MOMOKO606/Leetcode/tree/master/0257-binary-tree-paths) |
| [0269-alien-dictionary](https://github.com/MOMOKO606/Leetcode/tree/master/0269-alien-dictionary) |
| [0270-closest-binary-search-tree-value](https://github.com/MOMOKO606/Leetcode/tree/master/0270-closest-binary-search-tree-value) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0310-minimum-height-trees](https://github.com/MOMOKO606/Leetcode/tree/master/0310-minimum-height-trees) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0332-reconstruct-itinerary](https://github.com/MOMOKO606/Leetcode/tree/master/0332-reconstruct-itinerary) |
| [0399-evaluate-division](https://github.com/MOMOKO606/Leetcode/tree/master/0399-evaluate-division) |
| [0404-sum-of-left-leaves](https://github.com/MOMOKO606/Leetcode/tree/master/0404-sum-of-left-leaves) |
| [0437-path-sum-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0437-path-sum-iii) |
| [0449-serialize-and-deserialize-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0449-serialize-and-deserialize-bst) |
| [0463-island-perimeter](https://github.com/MOMOKO606/Leetcode/tree/master/0463-island-perimeter) |
| [0490-the-maze](https://github.com/MOMOKO606/Leetcode/tree/master/0490-the-maze) |
| [0501-find-mode-in-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0501-find-mode-in-binary-search-tree) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/MOMOKO606/Leetcode/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0529-minesweeper](https://github.com/MOMOKO606/Leetcode/tree/master/0529-minesweeper) |
| [0530-minimum-absolute-difference-in-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0530-minimum-absolute-difference-in-bst) |
| [0538-convert-bst-to-greater-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0538-convert-bst-to-greater-tree) |
| [0543-diameter-of-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0543-diameter-of-binary-tree) |
| [0547-number-of-provinces](https://github.com/MOMOKO606/Leetcode/tree/master/0547-number-of-provinces) |
| [0637-average-of-levels-in-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0637-average-of-levels-in-binary-tree) |
| [0684-redundant-connection](https://github.com/MOMOKO606/Leetcode/tree/master/0684-redundant-connection) |
| [0687-longest-univalue-path](https://github.com/MOMOKO606/Leetcode/tree/master/0687-longest-univalue-path) |
| [0775-n-ary-tree-preorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0775-n-ary-tree-preorder-traversal) |
| [1368-web-crawler-multithreaded](https://github.com/MOMOKO606/Leetcode/tree/master/1368-web-crawler-multithreaded) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/MOMOKO606/Leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |
| [3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network](https://github.com/MOMOKO606/Leetcode/tree/master/3326-count-pairs-of-connectable-servers-in-a-weighted-tree-network) |
## Breadth-First Search
| |
| ------- |
| [0100-same-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0107-binary-tree-level-order-traversal-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0107-binary-tree-level-order-traversal-ii) |
| [0111-minimum-depth-of-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0111-minimum-depth-of-binary-tree) |
| [0112-path-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0112-path-sum) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/MOMOKO606/Leetcode/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0126-word-ladder-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0126-word-ladder-ii) |
| [0127-word-ladder](https://github.com/MOMOKO606/Leetcode/tree/master/0127-word-ladder) |
| [0130-surrounded-regions](https://github.com/MOMOKO606/Leetcode/tree/master/0130-surrounded-regions) |
| [0133-clone-graph](https://github.com/MOMOKO606/Leetcode/tree/master/0133-clone-graph) |
| [0200-number-of-islands](https://github.com/MOMOKO606/Leetcode/tree/master/0200-number-of-islands) |
| [0207-course-schedule](https://github.com/MOMOKO606/Leetcode/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0210-course-schedule-ii) |
| [0226-invert-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0226-invert-binary-tree) |
| [0269-alien-dictionary](https://github.com/MOMOKO606/Leetcode/tree/master/0269-alien-dictionary) |
| [0279-perfect-squares](https://github.com/MOMOKO606/Leetcode/tree/master/0279-perfect-squares) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0310-minimum-height-trees](https://github.com/MOMOKO606/Leetcode/tree/master/0310-minimum-height-trees) |
| [0322-coin-change](https://github.com/MOMOKO606/Leetcode/tree/master/0322-coin-change) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0399-evaluate-division](https://github.com/MOMOKO606/Leetcode/tree/master/0399-evaluate-division) |
| [0404-sum-of-left-leaves](https://github.com/MOMOKO606/Leetcode/tree/master/0404-sum-of-left-leaves) |
| [0433-minimum-genetic-mutation](https://github.com/MOMOKO606/Leetcode/tree/master/0433-minimum-genetic-mutation) |
| [0449-serialize-and-deserialize-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0449-serialize-and-deserialize-bst) |
| [0463-island-perimeter](https://github.com/MOMOKO606/Leetcode/tree/master/0463-island-perimeter) |
| [0490-the-maze](https://github.com/MOMOKO606/Leetcode/tree/master/0490-the-maze) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/MOMOKO606/Leetcode/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0529-minesweeper](https://github.com/MOMOKO606/Leetcode/tree/master/0529-minesweeper) |
| [0530-minimum-absolute-difference-in-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0530-minimum-absolute-difference-in-bst) |
| [0547-number-of-provinces](https://github.com/MOMOKO606/Leetcode/tree/master/0547-number-of-provinces) |
| [0637-average-of-levels-in-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0637-average-of-levels-in-binary-tree) |
| [0684-redundant-connection](https://github.com/MOMOKO606/Leetcode/tree/master/0684-redundant-connection) |
| [0764-n-ary-tree-level-order-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0764-n-ary-tree-level-order-traversal) |
| [0787-sliding-puzzle](https://github.com/MOMOKO606/Leetcode/tree/master/0787-sliding-puzzle) |
| [1171-shortest-path-in-binary-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/1171-shortest-path-in-binary-matrix) |
| [1368-web-crawler-multithreaded](https://github.com/MOMOKO606/Leetcode/tree/master/1368-web-crawler-multithreaded) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/MOMOKO606/Leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |
## Graph
| |
| ------- |
| [0133-clone-graph](https://github.com/MOMOKO606/Leetcode/tree/master/0133-clone-graph) |
| [0207-course-schedule](https://github.com/MOMOKO606/Leetcode/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0210-course-schedule-ii) |
| [0269-alien-dictionary](https://github.com/MOMOKO606/Leetcode/tree/master/0269-alien-dictionary) |
| [0310-minimum-height-trees](https://github.com/MOMOKO606/Leetcode/tree/master/0310-minimum-height-trees) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0332-reconstruct-itinerary](https://github.com/MOMOKO606/Leetcode/tree/master/0332-reconstruct-itinerary) |
| [0399-evaluate-division](https://github.com/MOMOKO606/Leetcode/tree/master/0399-evaluate-division) |
| [0547-number-of-provinces](https://github.com/MOMOKO606/Leetcode/tree/master/0547-number-of-provinces) |
| [0684-redundant-connection](https://github.com/MOMOKO606/Leetcode/tree/master/0684-redundant-connection) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/MOMOKO606/Leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/MOMOKO606/Leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
## Topological Sort
| |
| ------- |
| [0207-course-schedule](https://github.com/MOMOKO606/Leetcode/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0210-course-schedule-ii) |
| [0269-alien-dictionary](https://github.com/MOMOKO606/Leetcode/tree/master/0269-alien-dictionary) |
| [0310-minimum-height-trees](https://github.com/MOMOKO606/Leetcode/tree/master/0310-minimum-height-trees) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/MOMOKO606/Leetcode/tree/master/0169-majority-element) |
| [0299-bulls-and-cows](https://github.com/MOMOKO606/Leetcode/tree/master/0299-bulls-and-cows) |
| [0383-ransom-note](https://github.com/MOMOKO606/Leetcode/tree/master/0383-ransom-note) |
| [0451-sort-characters-by-frequency](https://github.com/MOMOKO606/Leetcode/tree/master/0451-sort-characters-by-frequency) |
| [0621-task-scheduler](https://github.com/MOMOKO606/Leetcode/tree/master/0621-task-scheduler) |
| [0778-reorganize-string](https://github.com/MOMOKO606/Leetcode/tree/master/0778-reorganize-string) |
| [3395-minimum-length-of-anagram-concatenation](https://github.com/MOMOKO606/Leetcode/tree/master/3395-minimum-length-of-anagram-concatenation) |
| [3455-minimum-length-of-string-after-operations](https://github.com/MOMOKO606/Leetcode/tree/master/3455-minimum-length-of-string-after-operations) |
## Bit Manipulation
| |
| ------- |
| [0029-divide-two-integers](https://github.com/MOMOKO606/Leetcode/tree/master/0029-divide-two-integers) |
| [0067-add-binary](https://github.com/MOMOKO606/Leetcode/tree/master/0067-add-binary) |
| [0078-subsets](https://github.com/MOMOKO606/Leetcode/tree/master/0078-subsets) |
| [0089-gray-code](https://github.com/MOMOKO606/Leetcode/tree/master/0089-gray-code) |
| [0090-subsets-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0090-subsets-ii) |
| [0136-single-number](https://github.com/MOMOKO606/Leetcode/tree/master/0136-single-number) |
| [0137-single-number-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0137-single-number-ii) |
| [0187-repeated-dna-sequences](https://github.com/MOMOKO606/Leetcode/tree/master/0187-repeated-dna-sequences) |
| [0190-reverse-bits](https://github.com/MOMOKO606/Leetcode/tree/master/0190-reverse-bits) |
| [0191-number-of-1-bits](https://github.com/MOMOKO606/Leetcode/tree/master/0191-number-of-1-bits) |
| [0222-count-complete-tree-nodes](https://github.com/MOMOKO606/Leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0231-power-of-two](https://github.com/MOMOKO606/Leetcode/tree/master/0231-power-of-two) |
| [0260-single-number-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0260-single-number-iii) |
| [0268-missing-number](https://github.com/MOMOKO606/Leetcode/tree/master/0268-missing-number) |
| [0287-find-the-duplicate-number](https://github.com/MOMOKO606/Leetcode/tree/master/0287-find-the-duplicate-number) |
| [0342-power-of-four](https://github.com/MOMOKO606/Leetcode/tree/master/0342-power-of-four) |
| [0389-find-the-difference](https://github.com/MOMOKO606/Leetcode/tree/master/0389-find-the-difference) |
| [2519-find-the-original-array-of-prefix-xor](https://github.com/MOMOKO606/Leetcode/tree/master/2519-find-the-original-array-of-prefix-xor) |
| [2710-minimum-operations-to-reduce-an-integer-to-0](https://github.com/MOMOKO606/Leetcode/tree/master/2710-minimum-operations-to-reduce-an-integer-to-0) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/MOMOKO606/Leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
| [3364-minimum-sum-of-values-by-dividing-array](https://github.com/MOMOKO606/Leetcode/tree/master/3364-minimum-sum-of-values-by-dividing-array) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/MOMOKO606/Leetcode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0030-substring-with-concatenation-of-all-words](https://github.com/MOMOKO606/Leetcode/tree/master/0030-substring-with-concatenation-of-all-words) |
| [0076-minimum-window-substring](https://github.com/MOMOKO606/Leetcode/tree/master/0076-minimum-window-substring) |
| [0159-longest-substring-with-at-most-two-distinct-characters](https://github.com/MOMOKO606/Leetcode/tree/master/0159-longest-substring-with-at-most-two-distinct-characters) |
| [0187-repeated-dna-sequences](https://github.com/MOMOKO606/Leetcode/tree/master/0187-repeated-dna-sequences) |
| [0219-contains-duplicate-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0219-contains-duplicate-ii) |
| [0220-contains-duplicate-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0220-contains-duplicate-iii) |
| [0239-sliding-window-maximum](https://github.com/MOMOKO606/Leetcode/tree/master/0239-sliding-window-maximum) |
| [0395-longest-substring-with-at-least-k-repeating-characters](https://github.com/MOMOKO606/Leetcode/tree/master/0395-longest-substring-with-at-least-k-repeating-characters) |
| [0413-arithmetic-slices](https://github.com/MOMOKO606/Leetcode/tree/master/0413-arithmetic-slices) |
| [0424-longest-repeating-character-replacement](https://github.com/MOMOKO606/Leetcode/tree/master/0424-longest-repeating-character-replacement) |
| [0438-find-all-anagrams-in-a-string](https://github.com/MOMOKO606/Leetcode/tree/master/0438-find-all-anagrams-in-a-string) |
| [0643-maximum-average-subarray-i](https://github.com/MOMOKO606/Leetcode/tree/master/0643-maximum-average-subarray-i) |
| [0713-subarray-product-less-than-k](https://github.com/MOMOKO606/Leetcode/tree/master/0713-subarray-product-less-than-k) |
| [1321-get-equal-substrings-within-budget](https://github.com/MOMOKO606/Leetcode/tree/master/1321-get-equal-substrings-within-budget) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/MOMOKO606/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [3150-shortest-and-lexicographically-smallest-beautiful-string](https://github.com/MOMOKO606/Leetcode/tree/master/3150-shortest-and-lexicographically-smallest-beautiful-string) |
## Rolling Hash
| |
| ------- |
| [0187-repeated-dna-sequences](https://github.com/MOMOKO606/Leetcode/tree/master/0187-repeated-dna-sequences) |
| [0214-shortest-palindrome](https://github.com/MOMOKO606/Leetcode/tree/master/0214-shortest-palindrome) |
## Hash Function
| |
| ------- |
| [0187-repeated-dna-sequences](https://github.com/MOMOKO606/Leetcode/tree/master/0187-repeated-dna-sequences) |
| [0214-shortest-palindrome](https://github.com/MOMOKO606/Leetcode/tree/master/0214-shortest-palindrome) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/MOMOKO606/Leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0130-surrounded-regions](https://github.com/MOMOKO606/Leetcode/tree/master/0130-surrounded-regions) |
| [0200-number-of-islands](https://github.com/MOMOKO606/Leetcode/tree/master/0200-number-of-islands) |
| [0399-evaluate-division](https://github.com/MOMOKO606/Leetcode/tree/master/0399-evaluate-division) |
| [0547-number-of-provinces](https://github.com/MOMOKO606/Leetcode/tree/master/0547-number-of-provinces) |
| [0684-redundant-connection](https://github.com/MOMOKO606/Leetcode/tree/master/0684-redundant-connection) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/MOMOKO606/Leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/MOMOKO606/Leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
## Backtracking
| |
| ------- |
| [0017-letter-combinations-of-a-phone-number](https://github.com/MOMOKO606/Leetcode/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0022-generate-parentheses](https://github.com/MOMOKO606/Leetcode/tree/master/0022-generate-parentheses) |
| [0037-sudoku-solver](https://github.com/MOMOKO606/Leetcode/tree/master/0037-sudoku-solver) |
| [0039-combination-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0040-combination-sum-ii) |
| [0046-permutations](https://github.com/MOMOKO606/Leetcode/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0047-permutations-ii) |
| [0051-n-queens](https://github.com/MOMOKO606/Leetcode/tree/master/0051-n-queens) |
| [0052-n-queens-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0052-n-queens-ii) |
| [0077-combinations](https://github.com/MOMOKO606/Leetcode/tree/master/0077-combinations) |
| [0078-subsets](https://github.com/MOMOKO606/Leetcode/tree/master/0078-subsets) |
| [0079-word-search](https://github.com/MOMOKO606/Leetcode/tree/master/0079-word-search) |
| [0089-gray-code](https://github.com/MOMOKO606/Leetcode/tree/master/0089-gray-code) |
| [0090-subsets-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0090-subsets-ii) |
| [0093-restore-ip-addresses](https://github.com/MOMOKO606/Leetcode/tree/master/0093-restore-ip-addresses) |
| [0095-unique-binary-search-trees-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0095-unique-binary-search-trees-ii) |
| [0113-path-sum-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0113-path-sum-ii) |
| [0126-word-ladder-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0126-word-ladder-ii) |
| [0131-palindrome-partitioning](https://github.com/MOMOKO606/Leetcode/tree/master/0131-palindrome-partitioning) |
| [0140-word-break-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0140-word-break-ii) |
| [0212-word-search-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0212-word-search-ii) |
| [0216-combination-sum-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0216-combination-sum-iii) |
| [0257-binary-tree-paths](https://github.com/MOMOKO606/Leetcode/tree/master/0257-binary-tree-paths) |
| [0494-target-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0494-target-sum) |
## Simulation
| |
| ------- |
| [0043-multiply-strings](https://github.com/MOMOKO606/Leetcode/tree/master/0043-multiply-strings) |
| [0054-spiral-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0054-spiral-matrix) |
| [0059-spiral-matrix-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0059-spiral-matrix-ii) |
| [0067-add-binary](https://github.com/MOMOKO606/Leetcode/tree/master/0067-add-binary) |
| [0068-text-justification](https://github.com/MOMOKO606/Leetcode/tree/master/0068-text-justification) |
| [0157-read-n-characters-given-read4](https://github.com/MOMOKO606/Leetcode/tree/master/0157-read-n-characters-given-read4) |
| [0258-add-digits](https://github.com/MOMOKO606/Leetcode/tree/master/0258-add-digits) |
| [0682-baseball-game](https://github.com/MOMOKO606/Leetcode/tree/master/0682-baseball-game) |
| [3413-find-the-first-player-to-win-k-games-in-a-row](https://github.com/MOMOKO606/Leetcode/tree/master/3413-find-the-first-player-to-win-k-games-in-a-row) |
## Binary Search
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/MOMOKO606/Leetcode/tree/master/0004-median-of-two-sorted-arrays) |
| [0033-search-in-rotated-sorted-array](https://github.com/MOMOKO606/Leetcode/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/MOMOKO606/Leetcode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/MOMOKO606/Leetcode/tree/master/0035-search-insert-position) |
| [0069-sqrtx](https://github.com/MOMOKO606/Leetcode/tree/master/0069-sqrtx) |
| [0074-search-a-2d-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0074-search-a-2d-matrix) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/MOMOKO606/Leetcode/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0154-find-minimum-in-rotated-sorted-array-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0154-find-minimum-in-rotated-sorted-array-ii) |
| [0162-find-peak-element](https://github.com/MOMOKO606/Leetcode/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/MOMOKO606/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0222-count-complete-tree-nodes](https://github.com/MOMOKO606/Leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0268-missing-number](https://github.com/MOMOKO606/Leetcode/tree/master/0268-missing-number) |
| [0270-closest-binary-search-tree-value](https://github.com/MOMOKO606/Leetcode/tree/master/0270-closest-binary-search-tree-value) |
| [0275-h-index-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0275-h-index-ii) |
| [0278-first-bad-version](https://github.com/MOMOKO606/Leetcode/tree/master/0278-first-bad-version) |
| [0287-find-the-duplicate-number](https://github.com/MOMOKO606/Leetcode/tree/master/0287-find-the-duplicate-number) |
| [0300-longest-increasing-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0300-longest-increasing-subsequence) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/MOMOKO606/Leetcode/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0350-intersection-of-two-arrays-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0363-max-sum-of-rectangle-no-larger-than-k](https://github.com/MOMOKO606/Leetcode/tree/master/0363-max-sum-of-rectangle-no-larger-than-k) |
| [0374-guess-number-higher-or-lower](https://github.com/MOMOKO606/Leetcode/tree/master/0374-guess-number-higher-or-lower) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0410-split-array-largest-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0410-split-array-largest-sum) |
| [0456-132-pattern](https://github.com/MOMOKO606/Leetcode/tree/master/0456-132-pattern) |
| [0493-reverse-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0493-reverse-pairs) |
| [0668-kth-smallest-number-in-multiplication-table](https://github.com/MOMOKO606/Leetcode/tree/master/0668-kth-smallest-number-in-multiplication-table) |
| [0713-subarray-product-less-than-k](https://github.com/MOMOKO606/Leetcode/tree/master/0713-subarray-product-less-than-k) |
| [1321-get-equal-substrings-within-budget](https://github.com/MOMOKO606/Leetcode/tree/master/1321-get-equal-substrings-within-budget) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/MOMOKO606/Leetcode/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [1772-create-sorted-array-through-instructions](https://github.com/MOMOKO606/Leetcode/tree/master/1772-create-sorted-array-through-instructions) |
| [3364-minimum-sum-of-values-by-dividing-array](https://github.com/MOMOKO606/Leetcode/tree/master/3364-minimum-sum-of-values-by-dividing-array) |
## Segment Tree
| |
| ------- |
| [0218-the-skyline-problem](https://github.com/MOMOKO606/Leetcode/tree/master/0218-the-skyline-problem) |
| [0307-range-sum-query-mutable](https://github.com/MOMOKO606/Leetcode/tree/master/0307-range-sum-query-mutable) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/MOMOKO606/Leetcode/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0406-queue-reconstruction-by-height](https://github.com/MOMOKO606/Leetcode/tree/master/0406-queue-reconstruction-by-height) |
| [0493-reverse-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0493-reverse-pairs) |
| [1772-create-sorted-array-through-instructions](https://github.com/MOMOKO606/Leetcode/tree/master/1772-create-sorted-array-through-instructions) |
| [3187-maximum-profitable-triplets-with-increasing-prices-i](https://github.com/MOMOKO606/Leetcode/tree/master/3187-maximum-profitable-triplets-with-increasing-prices-i) |
| [3204-maximum-profitable-triplets-with-increasing-prices-ii](https://github.com/MOMOKO606/Leetcode/tree/master/3204-maximum-profitable-triplets-with-increasing-prices-ii) |
| [3364-minimum-sum-of-values-by-dividing-array](https://github.com/MOMOKO606/Leetcode/tree/master/3364-minimum-sum-of-values-by-dividing-array) |
## Queue
| |
| ------- |
| [0225-implement-stack-using-queues](https://github.com/MOMOKO606/Leetcode/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/MOMOKO606/Leetcode/tree/master/0232-implement-queue-using-stacks) |
| [0239-sliding-window-maximum](https://github.com/MOMOKO606/Leetcode/tree/master/0239-sliding-window-maximum) |
| [0346-moving-average-from-data-stream](https://github.com/MOMOKO606/Leetcode/tree/master/0346-moving-average-from-data-stream) |
| [0649-dota2-senate](https://github.com/MOMOKO606/Leetcode/tree/master/0649-dota2-senate) |
| [0859-design-circular-deque](https://github.com/MOMOKO606/Leetcode/tree/master/0859-design-circular-deque) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/MOMOKO606/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [3364-minimum-sum-of-values-by-dividing-array](https://github.com/MOMOKO606/Leetcode/tree/master/3364-minimum-sum-of-values-by-dividing-array) |
## Two Pointers
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/MOMOKO606/Leetcode/tree/master/0005-longest-palindromic-substring) |
| [0011-container-with-most-water](https://github.com/MOMOKO606/Leetcode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/MOMOKO606/Leetcode/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/MOMOKO606/Leetcode/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/MOMOKO606/Leetcode/tree/master/0018-4sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/MOMOKO606/Leetcode/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/MOMOKO606/Leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/MOMOKO606/Leetcode/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/MOMOKO606/Leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0031-next-permutation](https://github.com/MOMOKO606/Leetcode/tree/master/0031-next-permutation) |
| [0042-trapping-rain-water](https://github.com/MOMOKO606/Leetcode/tree/master/0042-trapping-rain-water) |
| [0061-rotate-list](https://github.com/MOMOKO606/Leetcode/tree/master/0061-rotate-list) |
| [0075-sort-colors](https://github.com/MOMOKO606/Leetcode/tree/master/0075-sort-colors) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0086-partition-list](https://github.com/MOMOKO606/Leetcode/tree/master/0086-partition-list) |
| [0088-merge-sorted-array](https://github.com/MOMOKO606/Leetcode/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/MOMOKO606/Leetcode/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/MOMOKO606/Leetcode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0142-linked-list-cycle-ii) |
| [0143-reorder-list](https://github.com/MOMOKO606/Leetcode/tree/master/0143-reorder-list) |
| [0148-sort-list](https://github.com/MOMOKO606/Leetcode/tree/master/0148-sort-list) |
| [0151-reverse-words-in-a-string](https://github.com/MOMOKO606/Leetcode/tree/master/0151-reverse-words-in-a-string) |
| [0160-intersection-of-two-linked-lists](https://github.com/MOMOKO606/Leetcode/tree/master/0160-intersection-of-two-linked-lists) |
| [0161-one-edit-distance](https://github.com/MOMOKO606/Leetcode/tree/master/0161-one-edit-distance) |
| [0165-compare-version-numbers](https://github.com/MOMOKO606/Leetcode/tree/master/0165-compare-version-numbers) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/MOMOKO606/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0170-two-sum-iii-data-structure-design](https://github.com/MOMOKO606/Leetcode/tree/master/0170-two-sum-iii-data-structure-design) |
| [0186-reverse-words-in-a-string-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0186-reverse-words-in-a-string-ii) |
| [0189-rotate-array](https://github.com/MOMOKO606/Leetcode/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/MOMOKO606/Leetcode/tree/master/0202-happy-number) |
| [0234-palindrome-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0234-palindrome-linked-list) |
| [0251-flatten-2d-vector](https://github.com/MOMOKO606/Leetcode/tree/master/0251-flatten-2d-vector) |
| [0253-meeting-rooms-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0253-meeting-rooms-ii) |
| [0283-move-zeroes](https://github.com/MOMOKO606/Leetcode/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/MOMOKO606/Leetcode/tree/master/0287-find-the-duplicate-number) |
| [0295-find-median-from-data-stream](https://github.com/MOMOKO606/Leetcode/tree/master/0295-find-median-from-data-stream) |
| [0345-reverse-vowels-of-a-string](https://github.com/MOMOKO606/Leetcode/tree/master/0345-reverse-vowels-of-a-string) |
| [0350-intersection-of-two-arrays-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0392-is-subsequence](https://github.com/MOMOKO606/Leetcode/tree/master/0392-is-subsequence) |
| [0443-string-compression](https://github.com/MOMOKO606/Leetcode/tree/master/0443-string-compression) |
| [0455-assign-cookies](https://github.com/MOMOKO606/Leetcode/tree/master/0455-assign-cookies) |
| [0541-reverse-string-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0541-reverse-string-ii) |
| [0557-reverse-words-in-a-string-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0557-reverse-words-in-a-string-iii) |
| [0647-palindromic-substrings](https://github.com/MOMOKO606/Leetcode/tree/master/0647-palindromic-substrings) |
| [0680-valid-palindrome-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0680-valid-palindrome-ii) |
| [0696-count-binary-substrings](https://github.com/MOMOKO606/Leetcode/tree/master/0696-count-binary-substrings) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/MOMOKO606/Leetcode/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/MOMOKO606/Leetcode/tree/master/2581-divide-players-into-teams-of-equal-skill) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/MOMOKO606/Leetcode/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/MOMOKO606/Leetcode/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0021-merge-two-sorted-lists](https://github.com/MOMOKO606/Leetcode/tree/master/0021-merge-two-sorted-lists) |
| [0023-merge-k-sorted-lists](https://github.com/MOMOKO606/Leetcode/tree/master/0023-merge-k-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0024-swap-nodes-in-pairs) |
| [0025-reverse-nodes-in-k-group](https://github.com/MOMOKO606/Leetcode/tree/master/0025-reverse-nodes-in-k-group) |
| [0061-rotate-list](https://github.com/MOMOKO606/Leetcode/tree/master/0061-rotate-list) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/MOMOKO606/Leetcode/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0086-partition-list](https://github.com/MOMOKO606/Leetcode/tree/master/0086-partition-list) |
| [0092-reverse-linked-list-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0092-reverse-linked-list-ii) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/MOMOKO606/Leetcode/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0138-copy-list-with-random-pointer](https://github.com/MOMOKO606/Leetcode/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/MOMOKO606/Leetcode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0142-linked-list-cycle-ii) |
| [0143-reorder-list](https://github.com/MOMOKO606/Leetcode/tree/master/0143-reorder-list) |
| [0146-lru-cache](https://github.com/MOMOKO606/Leetcode/tree/master/0146-lru-cache) |
| [0147-insertion-sort-list](https://github.com/MOMOKO606/Leetcode/tree/master/0147-insertion-sort-list) |
| [0148-sort-list](https://github.com/MOMOKO606/Leetcode/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/MOMOKO606/Leetcode/tree/master/0160-intersection-of-two-linked-lists) |
| [0206-reverse-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0234-palindrome-linked-list) |
| [0237-delete-node-in-a-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0237-delete-node-in-a-linked-list) |
| [0328-odd-even-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0328-odd-even-linked-list) |
| [0382-linked-list-random-node](https://github.com/MOMOKO606/Leetcode/tree/master/0382-linked-list-random-node) |
| [0859-design-circular-deque](https://github.com/MOMOKO606/Leetcode/tree/master/0859-design-circular-deque) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/MOMOKO606/Leetcode/tree/master/0020-valid-parentheses) |
| [0032-longest-valid-parentheses](https://github.com/MOMOKO606/Leetcode/tree/master/0032-longest-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/MOMOKO606/Leetcode/tree/master/0042-trapping-rain-water) |
| [0071-simplify-path](https://github.com/MOMOKO606/Leetcode/tree/master/0071-simplify-path) |
| [0084-largest-rectangle-in-histogram](https://github.com/MOMOKO606/Leetcode/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/MOMOKO606/Leetcode/tree/master/0085-maximal-rectangle) |
| [0094-binary-tree-inorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0143-reorder-list](https://github.com/MOMOKO606/Leetcode/tree/master/0143-reorder-list) |
| [0144-binary-tree-preorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0145-binary-tree-postorder-traversal) |
| [0150-evaluate-reverse-polish-notation](https://github.com/MOMOKO606/Leetcode/tree/master/0150-evaluate-reverse-polish-notation) |
| [0155-min-stack](https://github.com/MOMOKO606/Leetcode/tree/master/0155-min-stack) |
| [0173-binary-search-tree-iterator](https://github.com/MOMOKO606/Leetcode/tree/master/0173-binary-search-tree-iterator) |
| [0224-basic-calculator](https://github.com/MOMOKO606/Leetcode/tree/master/0224-basic-calculator) |
| [0225-implement-stack-using-queues](https://github.com/MOMOKO606/Leetcode/tree/master/0225-implement-stack-using-queues) |
| [0227-basic-calculator-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0227-basic-calculator-ii) |
| [0232-implement-queue-using-stacks](https://github.com/MOMOKO606/Leetcode/tree/master/0232-implement-queue-using-stacks) |
| [0234-palindrome-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0234-palindrome-linked-list) |
| [0316-remove-duplicate-letters](https://github.com/MOMOKO606/Leetcode/tree/master/0316-remove-duplicate-letters) |
| [0394-decode-string](https://github.com/MOMOKO606/Leetcode/tree/master/0394-decode-string) |
| [0402-remove-k-digits](https://github.com/MOMOKO606/Leetcode/tree/master/0402-remove-k-digits) |
| [0456-132-pattern](https://github.com/MOMOKO606/Leetcode/tree/master/0456-132-pattern) |
| [0496-next-greater-element-i](https://github.com/MOMOKO606/Leetcode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0503-next-greater-element-ii) |
| [0636-exclusive-time-of-functions](https://github.com/MOMOKO606/Leetcode/tree/master/0636-exclusive-time-of-functions) |
| [0682-baseball-game](https://github.com/MOMOKO606/Leetcode/tree/master/0682-baseball-game) |
| [0775-n-ary-tree-preorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0775-n-ary-tree-preorder-traversal) |
| [0785-basic-calculator-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0785-basic-calculator-iii) |
| [0943-sum-of-subarray-minimums](https://github.com/MOMOKO606/Leetcode/tree/master/0943-sum-of-subarray-minimums) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/MOMOKO606/Leetcode/tree/master/1159-smallest-subsequence-of-distinct-characters) |
## Merge Sort
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/MOMOKO606/Leetcode/tree/master/0023-merge-k-sorted-lists) |
| [0148-sort-list](https://github.com/MOMOKO606/Leetcode/tree/master/0148-sort-list) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/MOMOKO606/Leetcode/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0493-reverse-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0493-reverse-pairs) |
| [1772-create-sorted-array-through-instructions](https://github.com/MOMOKO606/Leetcode/tree/master/1772-create-sorted-array-through-instructions) |
## Number Theory
| |
| ------- |
| [0204-count-primes](https://github.com/MOMOKO606/Leetcode/tree/master/0204-count-primes) |
| [0258-add-digits](https://github.com/MOMOKO606/Leetcode/tree/master/0258-add-digits) |
| [1585-the-kth-factor-of-n](https://github.com/MOMOKO606/Leetcode/tree/master/1585-the-kth-factor-of-n) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/MOMOKO606/Leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0214-shortest-palindrome](https://github.com/MOMOKO606/Leetcode/tree/master/0214-shortest-palindrome) |
| [0459-repeated-substring-pattern](https://github.com/MOMOKO606/Leetcode/tree/master/0459-repeated-substring-pattern) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/MOMOKO606/Leetcode/tree/master/0042-trapping-rain-water) |
| [0084-largest-rectangle-in-histogram](https://github.com/MOMOKO606/Leetcode/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/MOMOKO606/Leetcode/tree/master/0085-maximal-rectangle) |
| [0316-remove-duplicate-letters](https://github.com/MOMOKO606/Leetcode/tree/master/0316-remove-duplicate-letters) |
| [0402-remove-k-digits](https://github.com/MOMOKO606/Leetcode/tree/master/0402-remove-k-digits) |
| [0456-132-pattern](https://github.com/MOMOKO606/Leetcode/tree/master/0456-132-pattern) |
| [0496-next-greater-element-i](https://github.com/MOMOKO606/Leetcode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0503-next-greater-element-ii) |
| [0943-sum-of-subarray-minimums](https://github.com/MOMOKO606/Leetcode/tree/master/0943-sum-of-subarray-minimums) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/MOMOKO606/Leetcode/tree/master/1159-smallest-subsequence-of-distinct-characters) |
## Binary Search Tree
| |
| ------- |
| [0095-unique-binary-search-trees-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0095-unique-binary-search-trees-ii) |
| [0096-unique-binary-search-trees](https://github.com/MOMOKO606/Leetcode/tree/master/0096-unique-binary-search-trees) |
| [0098-validate-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0099-recover-binary-search-tree) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0173-binary-search-tree-iterator](https://github.com/MOMOKO606/Leetcode/tree/master/0173-binary-search-tree-iterator) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0270-closest-binary-search-tree-value](https://github.com/MOMOKO606/Leetcode/tree/master/0270-closest-binary-search-tree-value) |
| [0449-serialize-and-deserialize-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0449-serialize-and-deserialize-bst) |
| [0450-delete-node-in-a-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0450-delete-node-in-a-bst) |
| [0501-find-mode-in-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0501-find-mode-in-binary-search-tree) |
| [0530-minimum-absolute-difference-in-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0530-minimum-absolute-difference-in-bst) |
| [0538-convert-bst-to-greater-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0538-convert-bst-to-greater-tree) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |
| [0095-unique-binary-search-trees-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0095-unique-binary-search-trees-ii) |
| [0096-unique-binary-search-trees](https://github.com/MOMOKO606/Leetcode/tree/master/0096-unique-binary-search-trees) |
| [0098-validate-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0107-binary-tree-level-order-traversal-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0107-binary-tree-level-order-traversal-ii) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0110-balanced-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0110-balanced-binary-tree) |
| [0111-minimum-depth-of-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0111-minimum-depth-of-binary-tree) |
| [0112-path-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0113-path-sum-ii) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/MOMOKO606/Leetcode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/MOMOKO606/Leetcode/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0124-binary-tree-maximum-path-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/MOMOKO606/Leetcode/tree/master/0129-sum-root-to-leaf-numbers) |
| [0144-binary-tree-preorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/MOMOKO606/Leetcode/tree/master/0145-binary-tree-postorder-traversal) |
| [0156-binary-tree-upside-down](https://github.com/MOMOKO606/Leetcode/tree/master/0156-binary-tree-upside-down) |
| [0173-binary-search-tree-iterator](https://github.com/MOMOKO606/Leetcode/tree/master/0173-binary-search-tree-iterator) |
| [0222-count-complete-tree-nodes](https://github.com/MOMOKO606/Leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0226-invert-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/MOMOKO606/Leetcode/tree/master/0257-binary-tree-paths) |
| [0270-closest-binary-search-tree-value](https://github.com/MOMOKO606/Leetcode/tree/master/0270-closest-binary-search-tree-value) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0404-sum-of-left-leaves](https://github.com/MOMOKO606/Leetcode/tree/master/0404-sum-of-left-leaves) |
| [0437-path-sum-iii](https://github.com/MOMOKO606/Leetcode/tree/master/0437-path-sum-iii) |
| [0449-serialize-and-deserialize-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0449-serialize-and-deserialize-bst) |
| [0450-delete-node-in-a-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0450-delete-node-in-a-bst) |
| [0501-find-mode-in-binary-search-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0501-find-mode-in-binary-search-tree) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/MOMOKO606/Leetcode/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0530-minimum-absolute-difference-in-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0530-minimum-absolute-difference-in-bst) |
| [0538-convert-bst-to-greater-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0538-convert-bst-to-greater-tree) |
| [0543-diameter-of-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0543-diameter-of-binary-tree) |
| [0637-average-of-levels-in-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0637-average-of-levels-in-binary-tree) |
| [0687-longest-univalue-path](https://github.com/MOMOKO606/Leetcode/tree/master/0687-longest-univalue-path) |
## Design
| |
| ------- |
| [0146-lru-cache](https://github.com/MOMOKO606/Leetcode/tree/master/0146-lru-cache) |
| [0155-min-stack](https://github.com/MOMOKO606/Leetcode/tree/master/0155-min-stack) |
| [0170-two-sum-iii-data-structure-design](https://github.com/MOMOKO606/Leetcode/tree/master/0170-two-sum-iii-data-structure-design) |
| [0173-binary-search-tree-iterator](https://github.com/MOMOKO606/Leetcode/tree/master/0173-binary-search-tree-iterator) |
| [0208-implement-trie-prefix-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0208-implement-trie-prefix-tree) |
| [0211-design-add-and-search-words-data-structure](https://github.com/MOMOKO606/Leetcode/tree/master/0211-design-add-and-search-words-data-structure) |
| [0225-implement-stack-using-queues](https://github.com/MOMOKO606/Leetcode/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/MOMOKO606/Leetcode/tree/master/0232-implement-queue-using-stacks) |
| [0251-flatten-2d-vector](https://github.com/MOMOKO606/Leetcode/tree/master/0251-flatten-2d-vector) |
| [0284-peeking-iterator](https://github.com/MOMOKO606/Leetcode/tree/master/0284-peeking-iterator) |
| [0295-find-median-from-data-stream](https://github.com/MOMOKO606/Leetcode/tree/master/0295-find-median-from-data-stream) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/MOMOKO606/Leetcode/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0304-range-sum-query-2d-immutable](https://github.com/MOMOKO606/Leetcode/tree/master/0304-range-sum-query-2d-immutable) |
| [0307-range-sum-query-mutable](https://github.com/MOMOKO606/Leetcode/tree/master/0307-range-sum-query-mutable) |
| [0346-moving-average-from-data-stream](https://github.com/MOMOKO606/Leetcode/tree/master/0346-moving-average-from-data-stream) |
| [0359-logger-rate-limiter](https://github.com/MOMOKO606/Leetcode/tree/master/0359-logger-rate-limiter) |
| [0380-insert-delete-getrandom-o1](https://github.com/MOMOKO606/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |
| [0449-serialize-and-deserialize-bst](https://github.com/MOMOKO606/Leetcode/tree/master/0449-serialize-and-deserialize-bst) |
| [0588-design-in-memory-file-system](https://github.com/MOMOKO606/Leetcode/tree/master/0588-design-in-memory-file-system) |
| [0859-design-circular-deque](https://github.com/MOMOKO606/Leetcode/tree/master/0859-design-circular-deque) |
## Iterator
| |
| ------- |
| [0173-binary-search-tree-iterator](https://github.com/MOMOKO606/Leetcode/tree/master/0173-binary-search-tree-iterator) |
| [0251-flatten-2d-vector](https://github.com/MOMOKO606/Leetcode/tree/master/0251-flatten-2d-vector) |
| [0284-peeking-iterator](https://github.com/MOMOKO606/Leetcode/tree/master/0284-peeking-iterator) |
## Combinatorics
| |
| ------- |
| [0062-unique-paths](https://github.com/MOMOKO606/Leetcode/tree/master/0062-unique-paths) |
## Brainteaser
| |
| ------- |
| [0319-bulb-switcher](https://github.com/MOMOKO606/Leetcode/tree/master/0319-bulb-switcher) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/MOMOKO606/Leetcode/tree/master/0070-climbing-stairs) |
| [0139-word-break](https://github.com/MOMOKO606/Leetcode/tree/master/0139-word-break) |
| [0140-word-break-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0140-word-break-ii) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/MOMOKO606/Leetcode/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [1013-fibonacci-number](https://github.com/MOMOKO606/Leetcode/tree/master/1013-fibonacci-number) |
## Eulerian Circuit
| |
| ------- |
| [0332-reconstruct-itinerary](https://github.com/MOMOKO606/Leetcode/tree/master/0332-reconstruct-itinerary) |
## Data Stream
| |
| ------- |
| [0170-two-sum-iii-data-structure-design](https://github.com/MOMOKO606/Leetcode/tree/master/0170-two-sum-iii-data-structure-design) |
| [0295-find-median-from-data-stream](https://github.com/MOMOKO606/Leetcode/tree/master/0295-find-median-from-data-stream) |
| [0346-moving-average-from-data-stream](https://github.com/MOMOKO606/Leetcode/tree/master/0346-moving-average-from-data-stream) |
| [0359-logger-rate-limiter](https://github.com/MOMOKO606/Leetcode/tree/master/0359-logger-rate-limiter) |
## Concurrency
| |
| ------- |
| [1368-web-crawler-multithreaded](https://github.com/MOMOKO606/Leetcode/tree/master/1368-web-crawler-multithreaded) |
## Reservoir Sampling
| |
| ------- |
| [0382-linked-list-random-node](https://github.com/MOMOKO606/Leetcode/tree/master/0382-linked-list-random-node) |
## Randomized
| |
| ------- |
| [0380-insert-delete-getrandom-o1](https://github.com/MOMOKO606/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |
| [0382-linked-list-random-node](https://github.com/MOMOKO606/Leetcode/tree/master/0382-linked-list-random-node) |
## Binary Indexed Tree
| |
| ------- |
| [0218-the-skyline-problem](https://github.com/MOMOKO606/Leetcode/tree/master/0218-the-skyline-problem) |
| [0307-range-sum-query-mutable](https://github.com/MOMOKO606/Leetcode/tree/master/0307-range-sum-query-mutable) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/MOMOKO606/Leetcode/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0406-queue-reconstruction-by-height](https://github.com/MOMOKO606/Leetcode/tree/master/0406-queue-reconstruction-by-height) |
| [0493-reverse-pairs](https://github.com/MOMOKO606/Leetcode/tree/master/0493-reverse-pairs) |
| [1772-create-sorted-array-through-instructions](https://github.com/MOMOKO606/Leetcode/tree/master/1772-create-sorted-array-through-instructions) |
| [3187-maximum-profitable-triplets-with-increasing-prices-i](https://github.com/MOMOKO606/Leetcode/tree/master/3187-maximum-profitable-triplets-with-increasing-prices-i) |
| [3204-maximum-profitable-triplets-with-increasing-prices-ii](https://github.com/MOMOKO606/Leetcode/tree/master/3204-maximum-profitable-triplets-with-increasing-prices-ii) |
## Prefix Sum
| |
| ------- |
| [0238-product-of-array-except-self](https://github.com/MOMOKO606/Leetcode/tree/master/0238-product-of-array-except-self) |
| [0253-meeting-rooms-ii](https://github.com/MOMOKO606/Leetcode/tree/master/0253-meeting-rooms-ii) |
| [0304-range-sum-query-2d-immutable](https://github.com/MOMOKO606/Leetcode/tree/master/0304-range-sum-query-2d-immutable) |
| [0363-max-sum-of-rectangle-no-larger-than-k](https://github.com/MOMOKO606/Leetcode/tree/master/0363-max-sum-of-rectangle-no-larger-than-k) |
| [0410-split-array-largest-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0410-split-array-largest-sum) |
| [0523-continuous-subarray-sum](https://github.com/MOMOKO606/Leetcode/tree/master/0523-continuous-subarray-sum) |
| [0560-subarray-sum-equals-k](https://github.com/MOMOKO606/Leetcode/tree/master/0560-subarray-sum-equals-k) |
| [0713-subarray-product-less-than-k](https://github.com/MOMOKO606/Leetcode/tree/master/0713-subarray-product-less-than-k) |
| [1321-get-equal-substrings-within-budget](https://github.com/MOMOKO606/Leetcode/tree/master/1321-get-equal-substrings-within-budget) |
| [3355-minimum-levels-to-gain-more-points](https://github.com/MOMOKO606/Leetcode/tree/master/3355-minimum-levels-to-gain-more-points) |
| [3383-taking-maximum-energy-from-the-mystic-dungeon](https://github.com/MOMOKO606/Leetcode/tree/master/3383-taking-maximum-energy-from-the-mystic-dungeon) |
## Doubly-Linked List
| |
| ------- |
| [0146-lru-cache](https://github.com/MOMOKO606/Leetcode/tree/master/0146-lru-cache) |
## Geometry
| |
| ------- |
| [0149-max-points-on-a-line](https://github.com/MOMOKO606/Leetcode/tree/master/0149-max-points-on-a-line) |
| [0223-rectangle-area](https://github.com/MOMOKO606/Leetcode/tree/master/0223-rectangle-area) |
## Interactive
| |
| ------- |
| [0157-read-n-characters-given-read4](https://github.com/MOMOKO606/Leetcode/tree/master/0157-read-n-characters-given-read4) |
| [0278-first-bad-version](https://github.com/MOMOKO606/Leetcode/tree/master/0278-first-bad-version) |
| [0374-guess-number-higher-or-lower](https://github.com/MOMOKO606/Leetcode/tree/master/0374-guess-number-higher-or-lower) |
## Quickselect
| |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/MOMOKO606/Leetcode/tree/master/0215-kth-largest-element-in-an-array) |
## Monotonic Queue
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/MOMOKO606/Leetcode/tree/master/0239-sliding-window-maximum) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/MOMOKO606/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
## Counting Sort
| |
| ------- |
| [0274-h-index](https://github.com/MOMOKO606/Leetcode/tree/master/0274-h-index) |
## Line Sweep
| |
| ------- |
| [0218-the-skyline-problem](https://github.com/MOMOKO606/Leetcode/tree/master/0218-the-skyline-problem) |
## Shortest Path
| |
| ------- |
| [0399-evaluate-division](https://github.com/MOMOKO606/Leetcode/tree/master/0399-evaluate-division) |