https://github.com/flameshine/algorithm-nebula
Nebula of various algorithmic tasks.
https://github.com/flameshine/algorithm-nebula
Last synced: about 2 months ago
JSON representation
Nebula of various algorithmic tasks.
- Host: GitHub
- URL: https://github.com/flameshine/algorithm-nebula
- Owner: flameshine
- Created: 2022-02-12T09:47:41.000Z (over 3 years ago)
- Default Branch: master
- Last Pushed: 2025-05-03T11:13:56.000Z (2 months ago)
- Last Synced: 2025-05-03T11:32:49.598Z (2 months ago)
- Language: Java
- Homepage:
- Size: 990 KB
- Stars: 2
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# algorithm-nebula
Nebula of various algorithmic tasks.
Structure
- The
algorithmspackage contains implementations of the most popular computer science algorithms - The
problemspackage contains solutions to various algorithmic problems - The
structurespackage contains implementations of the most popular data structures
# Array
| |
| ------- |
| [0026-remove-duplicates-from-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/flameshine/algorithm-nebula/tree/master/0027-remove-element) |
| [0055-jump-game](https://github.com/flameshine/algorithm-nebula/tree/master/0055-jump-game) |
| [0056-merge-intervals](https://github.com/flameshine/algorithm-nebula/tree/master/0056-merge-intervals) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0088-merge-sorted-array) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/flameshine/algorithm-nebula/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0169-majority-element](https://github.com/flameshine/algorithm-nebula/tree/master/0169-majority-element) |
| [0189-rotate-array](https://github.com/flameshine/algorithm-nebula/tree/master/0189-rotate-array) |
| [0274-h-index](https://github.com/flameshine/algorithm-nebula/tree/master/0274-h-index) |
| [0380-insert-delete-getrandom-o1](https://github.com/flameshine/algorithm-nebula/tree/master/0380-insert-delete-getrandom-o1) |
# Sorting
| |
| ------- |
| [0056-merge-intervals](https://github.com/flameshine/algorithm-nebula/tree/master/0056-merge-intervals) |
| [0088-merge-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0088-merge-sorted-array) |
| [0169-majority-element](https://github.com/flameshine/algorithm-nebula/tree/master/0169-majority-element) |
| [0274-h-index](https://github.com/flameshine/algorithm-nebula/tree/master/0274-h-index) |
# Two Pointers
| |
| ------- |
| [0019-remove-nth-node-from-end-of-list](https://github.com/flameshine/algorithm-nebula/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/flameshine/algorithm-nebula/tree/master/0027-remove-element) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0088-merge-sorted-array) |
| [0189-rotate-array](https://github.com/flameshine/algorithm-nebula/tree/master/0189-rotate-array) |
# Linked List
| |
| ------- |
| [0019-remove-nth-node-from-end-of-list](https://github.com/flameshine/algorithm-nebula/tree/master/0019-remove-nth-node-from-end-of-list) |
# Hash Table
| |
| ------- |
| [0169-majority-element](https://github.com/flameshine/algorithm-nebula/tree/master/0169-majority-element) |
| [0380-insert-delete-getrandom-o1](https://github.com/flameshine/algorithm-nebula/tree/master/0380-insert-delete-getrandom-o1) |
# Divide and Conquer
| |
| ------- |
| [0169-majority-element](https://github.com/flameshine/algorithm-nebula/tree/master/0169-majority-element) |
# Counting
| |
| ------- |
| [0169-majority-element](https://github.com/flameshine/algorithm-nebula/tree/master/0169-majority-element) |
# Math
| |
| ------- |
| [0189-rotate-array](https://github.com/flameshine/algorithm-nebula/tree/master/0189-rotate-array) |
| [0380-insert-delete-getrandom-o1](https://github.com/flameshine/algorithm-nebula/tree/master/0380-insert-delete-getrandom-o1) |
# Dynamic Programming
| |
| ------- |
| [0055-jump-game](https://github.com/flameshine/algorithm-nebula/tree/master/0055-jump-game) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/flameshine/algorithm-nebula/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
# Greedy
| |
| ------- |
| [0055-jump-game](https://github.com/flameshine/algorithm-nebula/tree/master/0055-jump-game) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
# Counting Sort
| |
| ------- |
| [0274-h-index](https://github.com/flameshine/algorithm-nebula/tree/master/0274-h-index) |
# Design
| |
| ------- |
| [0380-insert-delete-getrandom-o1](https://github.com/flameshine/algorithm-nebula/tree/master/0380-insert-delete-getrandom-o1) |
# Randomized
| |
| ------- |
| [0380-insert-delete-getrandom-o1](https://github.com/flameshine/algorithm-nebula/tree/master/0380-insert-delete-getrandom-o1) |
# LeetCode Topics
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/flameshine/algorithm-nebula/tree/master/0004-median-of-two-sorted-arrays) |
| [0011-container-with-most-water](https://github.com/flameshine/algorithm-nebula/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/flameshine/algorithm-nebula/tree/master/0015-3sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/flameshine/algorithm-nebula/tree/master/0027-remove-element) |
| [0033-search-in-rotated-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0036-valid-sudoku](https://github.com/flameshine/algorithm-nebula/tree/master/0036-valid-sudoku) |
| [0039-combination-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0040-combination-sum-ii) |
| [0042-trapping-rain-water](https://github.com/flameshine/algorithm-nebula/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0045-jump-game-ii) |
| [0046-permutations](https://github.com/flameshine/algorithm-nebula/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0047-permutations-ii) |
| [0049-group-anagrams](https://github.com/flameshine/algorithm-nebula/tree/master/0049-group-anagrams) |
| [0055-jump-game](https://github.com/flameshine/algorithm-nebula/tree/master/0055-jump-game) |
| [0056-merge-intervals](https://github.com/flameshine/algorithm-nebula/tree/master/0056-merge-intervals) |
| [0057-insert-interval](https://github.com/flameshine/algorithm-nebula/tree/master/0057-insert-interval) |
| [0066-plus-one](https://github.com/flameshine/algorithm-nebula/tree/master/0066-plus-one) |
| [0068-text-justification](https://github.com/flameshine/algorithm-nebula/tree/master/0068-text-justification) |
| [0074-search-a-2d-matrix](https://github.com/flameshine/algorithm-nebula/tree/master/0074-search-a-2d-matrix) |
| [0078-subsets](https://github.com/flameshine/algorithm-nebula/tree/master/0078-subsets) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0084-largest-rectangle-in-histogram](https://github.com/flameshine/algorithm-nebula/tree/master/0084-largest-rectangle-in-histogram) |
| [0088-merge-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0088-merge-sorted-array) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/flameshine/algorithm-nebula/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0128-longest-consecutive-sequence](https://github.com/flameshine/algorithm-nebula/tree/master/0128-longest-consecutive-sequence) |
| [0135-candy](https://github.com/flameshine/algorithm-nebula/tree/master/0135-candy) |
| [0136-single-number](https://github.com/flameshine/algorithm-nebula/tree/master/0136-single-number) |
| [0150-evaluate-reverse-polish-notation](https://github.com/flameshine/algorithm-nebula/tree/master/0150-evaluate-reverse-polish-notation) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/flameshine/algorithm-nebula/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/flameshine/algorithm-nebula/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0169-majority-element](https://github.com/flameshine/algorithm-nebula/tree/master/0169-majority-element) |
| [0189-rotate-array](https://github.com/flameshine/algorithm-nebula/tree/master/0189-rotate-array) |
| [0198-house-robber](https://github.com/flameshine/algorithm-nebula/tree/master/0198-house-robber) |
| [0200-number-of-islands](https://github.com/flameshine/algorithm-nebula/tree/master/0200-number-of-islands) |
| [0209-minimum-size-subarray-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0209-minimum-size-subarray-sum) |
| [0215-kth-largest-element-in-an-array](https://github.com/flameshine/algorithm-nebula/tree/master/0215-kth-largest-element-in-an-array) |
| [0216-combination-sum-iii](https://github.com/flameshine/algorithm-nebula/tree/master/0216-combination-sum-iii) |
| [0217-contains-duplicate](https://github.com/flameshine/algorithm-nebula/tree/master/0217-contains-duplicate) |
| [0238-product-of-array-except-self](https://github.com/flameshine/algorithm-nebula/tree/master/0238-product-of-array-except-self) |
| [0239-sliding-window-maximum](https://github.com/flameshine/algorithm-nebula/tree/master/0239-sliding-window-maximum) |
| [0274-h-index](https://github.com/flameshine/algorithm-nebula/tree/master/0274-h-index) |
| [0283-move-zeroes](https://github.com/flameshine/algorithm-nebula/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/flameshine/algorithm-nebula/tree/master/0287-find-the-duplicate-number) |
| [0334-increasing-triplet-subsequence](https://github.com/flameshine/algorithm-nebula/tree/master/0334-increasing-triplet-subsequence) |
| [0347-top-k-frequent-elements](https://github.com/flameshine/algorithm-nebula/tree/master/0347-top-k-frequent-elements) |
| [0350-intersection-of-two-arrays-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0350-intersection-of-two-arrays-ii) |
| [0380-insert-delete-getrandom-o1](https://github.com/flameshine/algorithm-nebula/tree/master/0380-insert-delete-getrandom-o1) |
| [0399-evaluate-division](https://github.com/flameshine/algorithm-nebula/tree/master/0399-evaluate-division) |
| [0435-non-overlapping-intervals](https://github.com/flameshine/algorithm-nebula/tree/master/0435-non-overlapping-intervals) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/flameshine/algorithm-nebula/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0500-keyboard-row](https://github.com/flameshine/algorithm-nebula/tree/master/0500-keyboard-row) |
| [0605-can-place-flowers](https://github.com/flameshine/algorithm-nebula/tree/master/0605-can-place-flowers) |
| [0621-task-scheduler](https://github.com/flameshine/algorithm-nebula/tree/master/0621-task-scheduler) |
| [0643-maximum-average-subarray-i](https://github.com/flameshine/algorithm-nebula/tree/master/0643-maximum-average-subarray-i) |
| [0714-best-time-to-buy-and-sell-stock-with-transaction-fee](https://github.com/flameshine/algorithm-nebula/tree/master/0714-best-time-to-buy-and-sell-stock-with-transaction-fee) |
| [0724-find-pivot-index](https://github.com/flameshine/algorithm-nebula/tree/master/0724-find-pivot-index) |
| [0735-asteroid-collision](https://github.com/flameshine/algorithm-nebula/tree/master/0735-asteroid-collision) |
| [0739-daily-temperatures](https://github.com/flameshine/algorithm-nebula/tree/master/0739-daily-temperatures) |
| [0747-min-cost-climbing-stairs](https://github.com/flameshine/algorithm-nebula/tree/master/0747-min-cost-climbing-stairs) |
| [0792-binary-search](https://github.com/flameshine/algorithm-nebula/tree/master/0792-binary-search) |
| [0870-magic-squares-in-grid](https://github.com/flameshine/algorithm-nebula/tree/master/0870-magic-squares-in-grid) |
| [0883-car-fleet](https://github.com/flameshine/algorithm-nebula/tree/master/0883-car-fleet) |
| [0890-lemonade-change](https://github.com/flameshine/algorithm-nebula/tree/master/0890-lemonade-change) |
| [0907-koko-eating-bananas](https://github.com/flameshine/algorithm-nebula/tree/master/0907-koko-eating-bananas) |
| [1014-k-closest-points-to-origin](https://github.com/flameshine/algorithm-nebula/tree/master/1014-k-closest-points-to-origin) |
| [1036-rotting-oranges](https://github.com/flameshine/algorithm-nebula/tree/master/1036-rotting-oranges) |
| [1046-max-consecutive-ones-iii](https://github.com/flameshine/algorithm-nebula/tree/master/1046-max-consecutive-ones-iii) |
| [1112-find-words-that-can-be-formed-by-characters](https://github.com/flameshine/algorithm-nebula/tree/master/1112-find-words-that-can-be-formed-by-characters) |
| [1127-last-stone-weight](https://github.com/flameshine/algorithm-nebula/tree/master/1127-last-stone-weight) |
| [1256-rank-transform-of-an-array](https://github.com/flameshine/algorithm-nebula/tree/master/1256-rank-transform-of-an-array) |
| [1293-three-consecutive-odds](https://github.com/flameshine/algorithm-nebula/tree/master/1293-three-consecutive-odds) |
| [1319-unique-number-of-occurrences](https://github.com/flameshine/algorithm-nebula/tree/master/1319-unique-number-of-occurrences) |
| [1392-find-the-difference-of-two-arrays](https://github.com/flameshine/algorithm-nebula/tree/master/1392-find-the-difference-of-two-arrays) |
| [1397-search-suggestions-system](https://github.com/flameshine/algorithm-nebula/tree/master/1397-search-suggestions-system) |
| [1496-lucky-numbers-in-a-matrix](https://github.com/flameshine/algorithm-nebula/tree/master/1496-lucky-numbers-in-a-matrix) |
| [1528-kids-with-the-greatest-number-of-candies](https://github.com/flameshine/algorithm-nebula/tree/master/1528-kids-with-the-greatest-number-of-candies) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/flameshine/algorithm-nebula/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1720-crawler-log-folder](https://github.com/flameshine/algorithm-nebula/tree/master/1720-crawler-log-folder) |
| [1798-max-number-of-k-sum-pairs](https://github.com/flameshine/algorithm-nebula/tree/master/1798-max-number-of-k-sum-pairs) |
| [1833-find-the-highest-altitude](https://github.com/flameshine/algorithm-nebula/tree/master/1833-find-the-highest-altitude) |
| [2038-nearest-exit-from-entrance-in-maze](https://github.com/flameshine/algorithm-nebula/tree/master/2038-nearest-exit-from-entrance-in-maze) |
| [2123-the-number-of-weak-characters-in-the-game](https://github.com/flameshine/algorithm-nebula/tree/master/2123-the-number-of-weak-characters-in-the-game) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/flameshine/algorithm-nebula/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
| [2392-successful-pairs-of-spells-and-potions](https://github.com/flameshine/algorithm-nebula/tree/master/2392-successful-pairs-of-spells-and-potions) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/flameshine/algorithm-nebula/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2428-equal-row-and-column-pairs](https://github.com/flameshine/algorithm-nebula/tree/master/2428-equal-row-and-column-pairs) |
| [2553-total-cost-to-hire-k-workers](https://github.com/flameshine/algorithm-nebula/tree/master/2553-total-cost-to-hire-k-workers) |
| [2636-maximum-subsequence-score](https://github.com/flameshine/algorithm-nebula/tree/master/2636-maximum-subsequence-score) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/flameshine/algorithm-nebula/tree/master/0003-longest-substring-without-repeating-characters) |
| [0013-roman-to-integer](https://github.com/flameshine/algorithm-nebula/tree/master/0013-roman-to-integer) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/flameshine/algorithm-nebula/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0036-valid-sudoku](https://github.com/flameshine/algorithm-nebula/tree/master/0036-valid-sudoku) |
| [0049-group-anagrams](https://github.com/flameshine/algorithm-nebula/tree/master/0049-group-anagrams) |
| [0076-minimum-window-substring](https://github.com/flameshine/algorithm-nebula/tree/master/0076-minimum-window-substring) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0128-longest-consecutive-sequence](https://github.com/flameshine/algorithm-nebula/tree/master/0128-longest-consecutive-sequence) |
| [0138-copy-list-with-random-pointer](https://github.com/flameshine/algorithm-nebula/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/flameshine/algorithm-nebula/tree/master/0141-linked-list-cycle) |
| [0146-lru-cache](https://github.com/flameshine/algorithm-nebula/tree/master/0146-lru-cache) |
| [0160-intersection-of-two-linked-lists](https://github.com/flameshine/algorithm-nebula/tree/master/0160-intersection-of-two-linked-lists) |
| [0169-majority-element](https://github.com/flameshine/algorithm-nebula/tree/master/0169-majority-element) |
| [0202-happy-number](https://github.com/flameshine/algorithm-nebula/tree/master/0202-happy-number) |
| [0208-implement-trie-prefix-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0208-implement-trie-prefix-tree) |
| [0217-contains-duplicate](https://github.com/flameshine/algorithm-nebula/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/flameshine/algorithm-nebula/tree/master/0242-valid-anagram) |
| [0290-word-pattern](https://github.com/flameshine/algorithm-nebula/tree/master/0290-word-pattern) |
| [0347-top-k-frequent-elements](https://github.com/flameshine/algorithm-nebula/tree/master/0347-top-k-frequent-elements) |
| [0350-intersection-of-two-arrays-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0350-intersection-of-two-arrays-ii) |
| [0355-design-twitter](https://github.com/flameshine/algorithm-nebula/tree/master/0355-design-twitter) |
| [0380-insert-delete-getrandom-o1](https://github.com/flameshine/algorithm-nebula/tree/master/0380-insert-delete-getrandom-o1) |
| [0424-longest-repeating-character-replacement](https://github.com/flameshine/algorithm-nebula/tree/master/0424-longest-repeating-character-replacement) |
| [0500-keyboard-row](https://github.com/flameshine/algorithm-nebula/tree/master/0500-keyboard-row) |
| [0567-permutation-in-string](https://github.com/flameshine/algorithm-nebula/tree/master/0567-permutation-in-string) |
| [0621-task-scheduler](https://github.com/flameshine/algorithm-nebula/tree/master/0621-task-scheduler) |
| [0778-reorganize-string](https://github.com/flameshine/algorithm-nebula/tree/master/0778-reorganize-string) |
| [0870-magic-squares-in-grid](https://github.com/flameshine/algorithm-nebula/tree/master/0870-magic-squares-in-grid) |
| [1023-time-based-key-value-store](https://github.com/flameshine/algorithm-nebula/tree/master/1023-time-based-key-value-store) |
| [1112-find-words-that-can-be-formed-by-characters](https://github.com/flameshine/algorithm-nebula/tree/master/1112-find-words-that-can-be-formed-by-characters) |
| [1256-rank-transform-of-an-array](https://github.com/flameshine/algorithm-nebula/tree/master/1256-rank-transform-of-an-array) |
| [1319-unique-number-of-occurrences](https://github.com/flameshine/algorithm-nebula/tree/master/1319-unique-number-of-occurrences) |
| [1392-find-the-difference-of-two-arrays](https://github.com/flameshine/algorithm-nebula/tree/master/1392-find-the-difference-of-two-arrays) |
| [1777-determine-if-two-strings-are-close](https://github.com/flameshine/algorithm-nebula/tree/master/1777-determine-if-two-strings-are-close) |
| [1798-max-number-of-k-sum-pairs](https://github.com/flameshine/algorithm-nebula/tree/master/1798-max-number-of-k-sum-pairs) |
| [2413-smallest-number-in-infinite-set](https://github.com/flameshine/algorithm-nebula/tree/master/2413-smallest-number-in-infinite-set) |
| [2428-equal-row-and-column-pairs](https://github.com/flameshine/algorithm-nebula/tree/master/2428-equal-row-and-column-pairs) |
## Two Pointers
| |
| ------- |
| [0011-container-with-most-water](https://github.com/flameshine/algorithm-nebula/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/flameshine/algorithm-nebula/tree/master/0015-3sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/flameshine/algorithm-nebula/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/flameshine/algorithm-nebula/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/flameshine/algorithm-nebula/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0042-trapping-rain-water](https://github.com/flameshine/algorithm-nebula/tree/master/0042-trapping-rain-water) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/flameshine/algorithm-nebula/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/flameshine/algorithm-nebula/tree/master/0141-linked-list-cycle) |
| [0143-reorder-list](https://github.com/flameshine/algorithm-nebula/tree/master/0143-reorder-list) |
| [0151-reverse-words-in-a-string](https://github.com/flameshine/algorithm-nebula/tree/master/0151-reverse-words-in-a-string) |
| [0160-intersection-of-two-linked-lists](https://github.com/flameshine/algorithm-nebula/tree/master/0160-intersection-of-two-linked-lists) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/flameshine/algorithm-nebula/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/flameshine/algorithm-nebula/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/flameshine/algorithm-nebula/tree/master/0202-happy-number) |
| [0283-move-zeroes](https://github.com/flameshine/algorithm-nebula/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/flameshine/algorithm-nebula/tree/master/0287-find-the-duplicate-number) |
| [0295-find-median-from-data-stream](https://github.com/flameshine/algorithm-nebula/tree/master/0295-find-median-from-data-stream) |
| [0345-reverse-vowels-of-a-string](https://github.com/flameshine/algorithm-nebula/tree/master/0345-reverse-vowels-of-a-string) |
| [0350-intersection-of-two-arrays-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0350-intersection-of-two-arrays-ii) |
| [0392-is-subsequence](https://github.com/flameshine/algorithm-nebula/tree/master/0392-is-subsequence) |
| [0443-string-compression](https://github.com/flameshine/algorithm-nebula/tree/master/0443-string-compression) |
| [0567-permutation-in-string](https://github.com/flameshine/algorithm-nebula/tree/master/0567-permutation-in-string) |
| [1454-remove-palindromic-subsequences](https://github.com/flameshine/algorithm-nebula/tree/master/1454-remove-palindromic-subsequences) |
| [1798-max-number-of-k-sum-pairs](https://github.com/flameshine/algorithm-nebula/tree/master/1798-max-number-of-k-sum-pairs) |
| [1894-merge-strings-alternately](https://github.com/flameshine/algorithm-nebula/tree/master/1894-merge-strings-alternately) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/flameshine/algorithm-nebula/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
| [2236-maximum-twin-sum-of-a-linked-list](https://github.com/flameshine/algorithm-nebula/tree/master/2236-maximum-twin-sum-of-a-linked-list) |
| [2392-successful-pairs-of-spells-and-potions](https://github.com/flameshine/algorithm-nebula/tree/master/2392-successful-pairs-of-spells-and-potions) |
| [2553-total-cost-to-hire-k-workers](https://github.com/flameshine/algorithm-nebula/tree/master/2553-total-cost-to-hire-k-workers) |
## Binary Search
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/flameshine/algorithm-nebula/tree/master/0004-median-of-two-sorted-arrays) |
| [0033-search-in-rotated-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0069-sqrtx](https://github.com/flameshine/algorithm-nebula/tree/master/0069-sqrtx) |
| [0074-search-a-2d-matrix](https://github.com/flameshine/algorithm-nebula/tree/master/0074-search-a-2d-matrix) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/flameshine/algorithm-nebula/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/flameshine/algorithm-nebula/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0209-minimum-size-subarray-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0209-minimum-size-subarray-sum) |
| [0287-find-the-duplicate-number](https://github.com/flameshine/algorithm-nebula/tree/master/0287-find-the-duplicate-number) |
| [0350-intersection-of-two-arrays-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0350-intersection-of-two-arrays-ii) |
| [0374-guess-number-higher-or-lower](https://github.com/flameshine/algorithm-nebula/tree/master/0374-guess-number-higher-or-lower) |
| [0792-binary-search](https://github.com/flameshine/algorithm-nebula/tree/master/0792-binary-search) |
| [0907-koko-eating-bananas](https://github.com/flameshine/algorithm-nebula/tree/master/0907-koko-eating-bananas) |
| [1023-time-based-key-value-store](https://github.com/flameshine/algorithm-nebula/tree/master/1023-time-based-key-value-store) |
| [1046-max-consecutive-ones-iii](https://github.com/flameshine/algorithm-nebula/tree/master/1046-max-consecutive-ones-iii) |
| [1397-search-suggestions-system](https://github.com/flameshine/algorithm-nebula/tree/master/1397-search-suggestions-system) |
| [2392-successful-pairs-of-spells-and-potions](https://github.com/flameshine/algorithm-nebula/tree/master/2392-successful-pairs-of-spells-and-potions) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/flameshine/algorithm-nebula/tree/master/2394-count-subarrays-with-score-less-than-k) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/flameshine/algorithm-nebula/tree/master/0015-3sum) |
| [0047-permutations-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0047-permutations-ii) |
| [0049-group-anagrams](https://github.com/flameshine/algorithm-nebula/tree/master/0049-group-anagrams) |
| [0056-merge-intervals](https://github.com/flameshine/algorithm-nebula/tree/master/0056-merge-intervals) |
| [0088-merge-sorted-array](https://github.com/flameshine/algorithm-nebula/tree/master/0088-merge-sorted-array) |
| [0169-majority-element](https://github.com/flameshine/algorithm-nebula/tree/master/0169-majority-element) |
| [0215-kth-largest-element-in-an-array](https://github.com/flameshine/algorithm-nebula/tree/master/0215-kth-largest-element-in-an-array) |
| [0217-contains-duplicate](https://github.com/flameshine/algorithm-nebula/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/flameshine/algorithm-nebula/tree/master/0242-valid-anagram) |
| [0274-h-index](https://github.com/flameshine/algorithm-nebula/tree/master/0274-h-index) |
| [0295-find-median-from-data-stream](https://github.com/flameshine/algorithm-nebula/tree/master/0295-find-median-from-data-stream) |
| [0347-top-k-frequent-elements](https://github.com/flameshine/algorithm-nebula/tree/master/0347-top-k-frequent-elements) |
| [0350-intersection-of-two-arrays-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0350-intersection-of-two-arrays-ii) |
| [0435-non-overlapping-intervals](https://github.com/flameshine/algorithm-nebula/tree/master/0435-non-overlapping-intervals) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/flameshine/algorithm-nebula/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0621-task-scheduler](https://github.com/flameshine/algorithm-nebula/tree/master/0621-task-scheduler) |
| [0778-reorganize-string](https://github.com/flameshine/algorithm-nebula/tree/master/0778-reorganize-string) |
| [0883-car-fleet](https://github.com/flameshine/algorithm-nebula/tree/master/0883-car-fleet) |
| [1014-k-closest-points-to-origin](https://github.com/flameshine/algorithm-nebula/tree/master/1014-k-closest-points-to-origin) |
| [1256-rank-transform-of-an-array](https://github.com/flameshine/algorithm-nebula/tree/master/1256-rank-transform-of-an-array) |
| [1397-search-suggestions-system](https://github.com/flameshine/algorithm-nebula/tree/master/1397-search-suggestions-system) |
| [1777-determine-if-two-strings-are-close](https://github.com/flameshine/algorithm-nebula/tree/master/1777-determine-if-two-strings-are-close) |
| [1798-max-number-of-k-sum-pairs](https://github.com/flameshine/algorithm-nebula/tree/master/1798-max-number-of-k-sum-pairs) |
| [2123-the-number-of-weak-characters-in-the-game](https://github.com/flameshine/algorithm-nebula/tree/master/2123-the-number-of-weak-characters-in-the-game) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/flameshine/algorithm-nebula/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
| [2392-successful-pairs-of-spells-and-potions](https://github.com/flameshine/algorithm-nebula/tree/master/2392-successful-pairs-of-spells-and-potions) |
| [2636-maximum-subsequence-score](https://github.com/flameshine/algorithm-nebula/tree/master/2636-maximum-subsequence-score) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/flameshine/algorithm-nebula/tree/master/0003-longest-substring-without-repeating-characters) |
| [0006-zigzag-conversion](https://github.com/flameshine/algorithm-nebula/tree/master/0006-zigzag-conversion) |
| [0013-roman-to-integer](https://github.com/flameshine/algorithm-nebula/tree/master/0013-roman-to-integer) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/flameshine/algorithm-nebula/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0022-generate-parentheses](https://github.com/flameshine/algorithm-nebula/tree/master/0022-generate-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/flameshine/algorithm-nebula/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0038-count-and-say](https://github.com/flameshine/algorithm-nebula/tree/master/0038-count-and-say) |
| [0049-group-anagrams](https://github.com/flameshine/algorithm-nebula/tree/master/0049-group-anagrams) |
| [0058-length-of-last-word](https://github.com/flameshine/algorithm-nebula/tree/master/0058-length-of-last-word) |
| [0068-text-justification](https://github.com/flameshine/algorithm-nebula/tree/master/0068-text-justification) |
| [0072-edit-distance](https://github.com/flameshine/algorithm-nebula/tree/master/0072-edit-distance) |
| [0076-minimum-window-substring](https://github.com/flameshine/algorithm-nebula/tree/master/0076-minimum-window-substring) |
| [0125-valid-palindrome](https://github.com/flameshine/algorithm-nebula/tree/master/0125-valid-palindrome) |
| [0151-reverse-words-in-a-string](https://github.com/flameshine/algorithm-nebula/tree/master/0151-reverse-words-in-a-string) |
| [0208-implement-trie-prefix-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0208-implement-trie-prefix-tree) |
| [0242-valid-anagram](https://github.com/flameshine/algorithm-nebula/tree/master/0242-valid-anagram) |
| [0290-word-pattern](https://github.com/flameshine/algorithm-nebula/tree/master/0290-word-pattern) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0345-reverse-vowels-of-a-string](https://github.com/flameshine/algorithm-nebula/tree/master/0345-reverse-vowels-of-a-string) |
| [0392-is-subsequence](https://github.com/flameshine/algorithm-nebula/tree/master/0392-is-subsequence) |
| [0394-decode-string](https://github.com/flameshine/algorithm-nebula/tree/master/0394-decode-string) |
| [0399-evaluate-division](https://github.com/flameshine/algorithm-nebula/tree/master/0399-evaluate-division) |
| [0424-longest-repeating-character-replacement](https://github.com/flameshine/algorithm-nebula/tree/master/0424-longest-repeating-character-replacement) |
| [0443-string-compression](https://github.com/flameshine/algorithm-nebula/tree/master/0443-string-compression) |
| [0500-keyboard-row](https://github.com/flameshine/algorithm-nebula/tree/master/0500-keyboard-row) |
| [0567-permutation-in-string](https://github.com/flameshine/algorithm-nebula/tree/master/0567-permutation-in-string) |
| [0649-dota2-senate](https://github.com/flameshine/algorithm-nebula/tree/master/0649-dota2-senate) |
| [0778-reorganize-string](https://github.com/flameshine/algorithm-nebula/tree/master/0778-reorganize-string) |
| [1023-time-based-key-value-store](https://github.com/flameshine/algorithm-nebula/tree/master/1023-time-based-key-value-store) |
| [1026-string-without-aaa-or-bbb](https://github.com/flameshine/algorithm-nebula/tree/master/1026-string-without-aaa-or-bbb) |
| [1112-find-words-that-can-be-formed-by-characters](https://github.com/flameshine/algorithm-nebula/tree/master/1112-find-words-that-can-be-formed-by-characters) |
| [1146-greatest-common-divisor-of-strings](https://github.com/flameshine/algorithm-nebula/tree/master/1146-greatest-common-divisor-of-strings) |
| [1250-longest-common-subsequence](https://github.com/flameshine/algorithm-nebula/tree/master/1250-longest-common-subsequence) |
| [1341-split-a-string-in-balanced-strings](https://github.com/flameshine/algorithm-nebula/tree/master/1341-split-a-string-in-balanced-strings) |
| [1397-search-suggestions-system](https://github.com/flameshine/algorithm-nebula/tree/master/1397-search-suggestions-system) |
| [1454-remove-palindromic-subsequences](https://github.com/flameshine/algorithm-nebula/tree/master/1454-remove-palindromic-subsequences) |
| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/flameshine/algorithm-nebula/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |
| [1720-crawler-log-folder](https://github.com/flameshine/algorithm-nebula/tree/master/1720-crawler-log-folder) |
| [1777-determine-if-two-strings-are-close](https://github.com/flameshine/algorithm-nebula/tree/master/1777-determine-if-two-strings-are-close) |
| [1894-merge-strings-alternately](https://github.com/flameshine/algorithm-nebula/tree/master/1894-merge-strings-alternately) |
| [2304-cells-in-a-range-on-an-excel-sheet](https://github.com/flameshine/algorithm-nebula/tree/master/2304-cells-in-a-range-on-an-excel-sheet) |
| [2470-removing-stars-from-a-string](https://github.com/flameshine/algorithm-nebula/tree/master/2470-removing-stars-from-a-string) |
| [2580-circular-sentence](https://github.com/flameshine/algorithm-nebula/tree/master/2580-circular-sentence) |
## Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/flameshine/algorithm-nebula/tree/master/0042-trapping-rain-water) |
| [0084-largest-rectangle-in-histogram](https://github.com/flameshine/algorithm-nebula/tree/master/0084-largest-rectangle-in-histogram) |
| [0094-binary-tree-inorder-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0094-binary-tree-inorder-traversal) |
| [0143-reorder-list](https://github.com/flameshine/algorithm-nebula/tree/master/0143-reorder-list) |
| [0150-evaluate-reverse-polish-notation](https://github.com/flameshine/algorithm-nebula/tree/master/0150-evaluate-reverse-polish-notation) |
| [0155-min-stack](https://github.com/flameshine/algorithm-nebula/tree/master/0155-min-stack) |
| [0394-decode-string](https://github.com/flameshine/algorithm-nebula/tree/master/0394-decode-string) |
| [0735-asteroid-collision](https://github.com/flameshine/algorithm-nebula/tree/master/0735-asteroid-collision) |
| [0739-daily-temperatures](https://github.com/flameshine/algorithm-nebula/tree/master/0739-daily-temperatures) |
| [0883-car-fleet](https://github.com/flameshine/algorithm-nebula/tree/master/0883-car-fleet) |
| [0937-online-stock-span](https://github.com/flameshine/algorithm-nebula/tree/master/0937-online-stock-span) |
| [1720-crawler-log-folder](https://github.com/flameshine/algorithm-nebula/tree/master/1720-crawler-log-folder) |
| [2123-the-number-of-weak-characters-in-the-game](https://github.com/flameshine/algorithm-nebula/tree/master/2123-the-number-of-weak-characters-in-the-game) |
| [2236-maximum-twin-sum-of-a-linked-list](https://github.com/flameshine/algorithm-nebula/tree/master/2236-maximum-twin-sum-of-a-linked-list) |
| [2470-removing-stars-from-a-string](https://github.com/flameshine/algorithm-nebula/tree/master/2470-removing-stars-from-a-string) |
## Prefix Sum
| |
| ------- |
| [0209-minimum-size-subarray-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0209-minimum-size-subarray-sum) |
| [0238-product-of-array-except-self](https://github.com/flameshine/algorithm-nebula/tree/master/0238-product-of-array-except-self) |
| [0724-find-pivot-index](https://github.com/flameshine/algorithm-nebula/tree/master/0724-find-pivot-index) |
| [1046-max-consecutive-ones-iii](https://github.com/flameshine/algorithm-nebula/tree/master/1046-max-consecutive-ones-iii) |
| [1833-find-the-highest-altitude](https://github.com/flameshine/algorithm-nebula/tree/master/1833-find-the-highest-altitude) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/flameshine/algorithm-nebula/tree/master/2394-count-subarrays-with-score-less-than-k) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/flameshine/algorithm-nebula/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/flameshine/algorithm-nebula/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0021-merge-two-sorted-lists](https://github.com/flameshine/algorithm-nebula/tree/master/0021-merge-two-sorted-lists) |
| [0023-merge-k-sorted-lists](https://github.com/flameshine/algorithm-nebula/tree/master/0023-merge-k-sorted-lists) |
| [0025-reverse-nodes-in-k-group](https://github.com/flameshine/algorithm-nebula/tree/master/0025-reverse-nodes-in-k-group) |
| [0092-reverse-linked-list-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0092-reverse-linked-list-ii) |
| [0138-copy-list-with-random-pointer](https://github.com/flameshine/algorithm-nebula/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/flameshine/algorithm-nebula/tree/master/0141-linked-list-cycle) |
| [0143-reorder-list](https://github.com/flameshine/algorithm-nebula/tree/master/0143-reorder-list) |
| [0146-lru-cache](https://github.com/flameshine/algorithm-nebula/tree/master/0146-lru-cache) |
| [0160-intersection-of-two-linked-lists](https://github.com/flameshine/algorithm-nebula/tree/master/0160-intersection-of-two-linked-lists) |
| [0206-reverse-linked-list](https://github.com/flameshine/algorithm-nebula/tree/master/0206-reverse-linked-list) |
| [0328-odd-even-linked-list](https://github.com/flameshine/algorithm-nebula/tree/master/0328-odd-even-linked-list) |
| [0355-design-twitter](https://github.com/flameshine/algorithm-nebula/tree/master/0355-design-twitter) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/flameshine/algorithm-nebula/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
| [2236-maximum-twin-sum-of-a-linked-list](https://github.com/flameshine/algorithm-nebula/tree/master/2236-maximum-twin-sum-of-a-linked-list) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/flameshine/algorithm-nebula/tree/master/0002-add-two-numbers) |
| [0009-palindrome-number](https://github.com/flameshine/algorithm-nebula/tree/master/0009-palindrome-number) |
| [0013-roman-to-integer](https://github.com/flameshine/algorithm-nebula/tree/master/0013-roman-to-integer) |
| [0050-powx-n](https://github.com/flameshine/algorithm-nebula/tree/master/0050-powx-n) |
| [0062-unique-paths](https://github.com/flameshine/algorithm-nebula/tree/master/0062-unique-paths) |
| [0066-plus-one](https://github.com/flameshine/algorithm-nebula/tree/master/0066-plus-one) |
| [0069-sqrtx](https://github.com/flameshine/algorithm-nebula/tree/master/0069-sqrtx) |
| [0150-evaluate-reverse-polish-notation](https://github.com/flameshine/algorithm-nebula/tree/master/0150-evaluate-reverse-polish-notation) |
| [0189-rotate-array](https://github.com/flameshine/algorithm-nebula/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/flameshine/algorithm-nebula/tree/master/0202-happy-number) |
| [0380-insert-delete-getrandom-o1](https://github.com/flameshine/algorithm-nebula/tree/master/0380-insert-delete-getrandom-o1) |
| [0870-magic-squares-in-grid](https://github.com/flameshine/algorithm-nebula/tree/master/0870-magic-squares-in-grid) |
| [1014-k-closest-points-to-origin](https://github.com/flameshine/algorithm-nebula/tree/master/1014-k-closest-points-to-origin) |
| [1146-greatest-common-divisor-of-strings](https://github.com/flameshine/algorithm-nebula/tree/master/1146-greatest-common-divisor-of-strings) |
| [1236-n-th-tribonacci-number](https://github.com/flameshine/algorithm-nebula/tree/master/1236-n-th-tribonacci-number) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/flameshine/algorithm-nebula/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
| [2850-construct-the-longest-new-string](https://github.com/flameshine/algorithm-nebula/tree/master/2850-construct-the-longest-new-string) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/flameshine/algorithm-nebula/tree/master/0002-add-two-numbers) |
| [0021-merge-two-sorted-lists](https://github.com/flameshine/algorithm-nebula/tree/master/0021-merge-two-sorted-lists) |
| [0025-reverse-nodes-in-k-group](https://github.com/flameshine/algorithm-nebula/tree/master/0025-reverse-nodes-in-k-group) |
| [0050-powx-n](https://github.com/flameshine/algorithm-nebula/tree/master/0050-powx-n) |
| [0143-reorder-list](https://github.com/flameshine/algorithm-nebula/tree/master/0143-reorder-list) |
| [0206-reverse-linked-list](https://github.com/flameshine/algorithm-nebula/tree/master/0206-reverse-linked-list) |
| [0394-decode-string](https://github.com/flameshine/algorithm-nebula/tree/master/0394-decode-string) |
## Matrix
| |
| ------- |
| [0036-valid-sudoku](https://github.com/flameshine/algorithm-nebula/tree/master/0036-valid-sudoku) |
| [0074-search-a-2d-matrix](https://github.com/flameshine/algorithm-nebula/tree/master/0074-search-a-2d-matrix) |
| [0200-number-of-islands](https://github.com/flameshine/algorithm-nebula/tree/master/0200-number-of-islands) |
| [0870-magic-squares-in-grid](https://github.com/flameshine/algorithm-nebula/tree/master/0870-magic-squares-in-grid) |
| [1036-rotting-oranges](https://github.com/flameshine/algorithm-nebula/tree/master/1036-rotting-oranges) |
| [1496-lucky-numbers-in-a-matrix](https://github.com/flameshine/algorithm-nebula/tree/master/1496-lucky-numbers-in-a-matrix) |
| [2038-nearest-exit-from-entrance-in-maze](https://github.com/flameshine/algorithm-nebula/tree/master/2038-nearest-exit-from-entrance-in-maze) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/flameshine/algorithm-nebula/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
| [2428-equal-row-and-column-pairs](https://github.com/flameshine/algorithm-nebula/tree/master/2428-equal-row-and-column-pairs) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/flameshine/algorithm-nebula/tree/master/0128-longest-consecutive-sequence) |
| [0200-number-of-islands](https://github.com/flameshine/algorithm-nebula/tree/master/0200-number-of-islands) |
| [0399-evaluate-division](https://github.com/flameshine/algorithm-nebula/tree/master/0399-evaluate-division) |
| [0547-number-of-provinces](https://github.com/flameshine/algorithm-nebula/tree/master/0547-number-of-provinces) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/flameshine/algorithm-nebula/tree/master/0004-median-of-two-sorted-arrays) |
| [0023-merge-k-sorted-lists](https://github.com/flameshine/algorithm-nebula/tree/master/0023-merge-k-sorted-lists) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0169-majority-element](https://github.com/flameshine/algorithm-nebula/tree/master/0169-majority-element) |
| [0215-kth-largest-element-in-an-array](https://github.com/flameshine/algorithm-nebula/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/flameshine/algorithm-nebula/tree/master/0347-top-k-frequent-elements) |
| [1014-k-closest-points-to-origin](https://github.com/flameshine/algorithm-nebula/tree/master/1014-k-closest-points-to-origin) |
## Heap (Priority Queue)
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/flameshine/algorithm-nebula/tree/master/0023-merge-k-sorted-lists) |
| [0215-kth-largest-element-in-an-array](https://github.com/flameshine/algorithm-nebula/tree/master/0215-kth-largest-element-in-an-array) |
| [0239-sliding-window-maximum](https://github.com/flameshine/algorithm-nebula/tree/master/0239-sliding-window-maximum) |
| [0295-find-median-from-data-stream](https://github.com/flameshine/algorithm-nebula/tree/master/0295-find-median-from-data-stream) |
| [0347-top-k-frequent-elements](https://github.com/flameshine/algorithm-nebula/tree/master/0347-top-k-frequent-elements) |
| [0355-design-twitter](https://github.com/flameshine/algorithm-nebula/tree/master/0355-design-twitter) |
| [0621-task-scheduler](https://github.com/flameshine/algorithm-nebula/tree/master/0621-task-scheduler) |
| [0778-reorganize-string](https://github.com/flameshine/algorithm-nebula/tree/master/0778-reorganize-string) |
| [0789-kth-largest-element-in-a-stream](https://github.com/flameshine/algorithm-nebula/tree/master/0789-kth-largest-element-in-a-stream) |
| [1014-k-closest-points-to-origin](https://github.com/flameshine/algorithm-nebula/tree/master/1014-k-closest-points-to-origin) |
| [1127-last-stone-weight](https://github.com/flameshine/algorithm-nebula/tree/master/1127-last-stone-weight) |
| [1397-search-suggestions-system](https://github.com/flameshine/algorithm-nebula/tree/master/1397-search-suggestions-system) |
| [2413-smallest-number-in-infinite-set](https://github.com/flameshine/algorithm-nebula/tree/master/2413-smallest-number-in-infinite-set) |
| [2553-total-cost-to-hire-k-workers](https://github.com/flameshine/algorithm-nebula/tree/master/2553-total-cost-to-hire-k-workers) |
| [2636-maximum-subsequence-score](https://github.com/flameshine/algorithm-nebula/tree/master/2636-maximum-subsequence-score) |
## Bucket Sort
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/flameshine/algorithm-nebula/tree/master/0347-top-k-frequent-elements) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/flameshine/algorithm-nebula/tree/master/0169-majority-element) |
| [0347-top-k-frequent-elements](https://github.com/flameshine/algorithm-nebula/tree/master/0347-top-k-frequent-elements) |
| [0621-task-scheduler](https://github.com/flameshine/algorithm-nebula/tree/master/0621-task-scheduler) |
| [0778-reorganize-string](https://github.com/flameshine/algorithm-nebula/tree/master/0778-reorganize-string) |
| [1112-find-words-that-can-be-formed-by-characters](https://github.com/flameshine/algorithm-nebula/tree/master/1112-find-words-that-can-be-formed-by-characters) |
| [1341-split-a-string-in-balanced-strings](https://github.com/flameshine/algorithm-nebula/tree/master/1341-split-a-string-in-balanced-strings) |
| [1777-determine-if-two-strings-are-close](https://github.com/flameshine/algorithm-nebula/tree/master/1777-determine-if-two-strings-are-close) |
## Quickselect
| |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/flameshine/algorithm-nebula/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/flameshine/algorithm-nebula/tree/master/0347-top-k-frequent-elements) |
| [1014-k-closest-points-to-origin](https://github.com/flameshine/algorithm-nebula/tree/master/1014-k-closest-points-to-origin) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/flameshine/algorithm-nebula/tree/master/0011-container-with-most-water) |
| [0045-jump-game-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/flameshine/algorithm-nebula/tree/master/0055-jump-game) |
| [0135-candy](https://github.com/flameshine/algorithm-nebula/tree/master/0135-candy) |
| [0334-increasing-triplet-subsequence](https://github.com/flameshine/algorithm-nebula/tree/master/0334-increasing-triplet-subsequence) |
| [0435-non-overlapping-intervals](https://github.com/flameshine/algorithm-nebula/tree/master/0435-non-overlapping-intervals) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/flameshine/algorithm-nebula/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0605-can-place-flowers](https://github.com/flameshine/algorithm-nebula/tree/master/0605-can-place-flowers) |
| [0621-task-scheduler](https://github.com/flameshine/algorithm-nebula/tree/master/0621-task-scheduler) |
| [0649-dota2-senate](https://github.com/flameshine/algorithm-nebula/tree/master/0649-dota2-senate) |
| [0714-best-time-to-buy-and-sell-stock-with-transaction-fee](https://github.com/flameshine/algorithm-nebula/tree/master/0714-best-time-to-buy-and-sell-stock-with-transaction-fee) |
| [0778-reorganize-string](https://github.com/flameshine/algorithm-nebula/tree/master/0778-reorganize-string) |
| [0890-lemonade-change](https://github.com/flameshine/algorithm-nebula/tree/master/0890-lemonade-change) |
| [1026-string-without-aaa-or-bbb](https://github.com/flameshine/algorithm-nebula/tree/master/1026-string-without-aaa-or-bbb) |
| [1341-split-a-string-in-balanced-strings](https://github.com/flameshine/algorithm-nebula/tree/master/1341-split-a-string-in-balanced-strings) |
| [2123-the-number-of-weak-characters-in-the-game](https://github.com/flameshine/algorithm-nebula/tree/master/2123-the-number-of-weak-characters-in-the-game) |
| [2636-maximum-subsequence-score](https://github.com/flameshine/algorithm-nebula/tree/master/2636-maximum-subsequence-score) |
| [2850-construct-the-longest-new-string](https://github.com/flameshine/algorithm-nebula/tree/master/2850-construct-the-longest-new-string) |
## Dynamic Programming
| |
| ------- |
| [0022-generate-parentheses](https://github.com/flameshine/algorithm-nebula/tree/master/0022-generate-parentheses) |
| [0042-trapping-rain-water](https://github.com/flameshine/algorithm-nebula/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/flameshine/algorithm-nebula/tree/master/0055-jump-game) |
| [0062-unique-paths](https://github.com/flameshine/algorithm-nebula/tree/master/0062-unique-paths) |
| [0072-edit-distance](https://github.com/flameshine/algorithm-nebula/tree/master/0072-edit-distance) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/flameshine/algorithm-nebula/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0124-binary-tree-maximum-path-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0124-binary-tree-maximum-path-sum) |
| [0198-house-robber](https://github.com/flameshine/algorithm-nebula/tree/master/0198-house-robber) |
| [0338-counting-bits](https://github.com/flameshine/algorithm-nebula/tree/master/0338-counting-bits) |
| [0392-is-subsequence](https://github.com/flameshine/algorithm-nebula/tree/master/0392-is-subsequence) |
| [0435-non-overlapping-intervals](https://github.com/flameshine/algorithm-nebula/tree/master/0435-non-overlapping-intervals) |
| [0714-best-time-to-buy-and-sell-stock-with-transaction-fee](https://github.com/flameshine/algorithm-nebula/tree/master/0714-best-time-to-buy-and-sell-stock-with-transaction-fee) |
| [0747-min-cost-climbing-stairs](https://github.com/flameshine/algorithm-nebula/tree/master/0747-min-cost-climbing-stairs) |
| [0806-domino-and-tromino-tiling](https://github.com/flameshine/algorithm-nebula/tree/master/0806-domino-and-tromino-tiling) |
| [1236-n-th-tribonacci-number](https://github.com/flameshine/algorithm-nebula/tree/master/1236-n-th-tribonacci-number) |
| [1250-longest-common-subsequence](https://github.com/flameshine/algorithm-nebula/tree/master/1250-longest-common-subsequence) |
| [1474-longest-zigzag-path-in-a-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1474-longest-zigzag-path-in-a-binary-tree) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/flameshine/algorithm-nebula/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [2850-construct-the-longest-new-string](https://github.com/flameshine/algorithm-nebula/tree/master/2850-construct-the-longest-new-string) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/flameshine/algorithm-nebula/tree/master/0042-trapping-rain-water) |
| [0084-largest-rectangle-in-histogram](https://github.com/flameshine/algorithm-nebula/tree/master/0084-largest-rectangle-in-histogram) |
| [0739-daily-temperatures](https://github.com/flameshine/algorithm-nebula/tree/master/0739-daily-temperatures) |
| [0883-car-fleet](https://github.com/flameshine/algorithm-nebula/tree/master/0883-car-fleet) |
| [0937-online-stock-span](https://github.com/flameshine/algorithm-nebula/tree/master/0937-online-stock-span) |
| [2123-the-number-of-weak-characters-in-the-game](https://github.com/flameshine/algorithm-nebula/tree/master/2123-the-number-of-weak-characters-in-the-game) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/flameshine/algorithm-nebula/tree/master/0003-longest-substring-without-repeating-characters) |
| [0076-minimum-window-substring](https://github.com/flameshine/algorithm-nebula/tree/master/0076-minimum-window-substring) |
| [0209-minimum-size-subarray-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0209-minimum-size-subarray-sum) |
| [0239-sliding-window-maximum](https://github.com/flameshine/algorithm-nebula/tree/master/0239-sliding-window-maximum) |
| [0424-longest-repeating-character-replacement](https://github.com/flameshine/algorithm-nebula/tree/master/0424-longest-repeating-character-replacement) |
| [0567-permutation-in-string](https://github.com/flameshine/algorithm-nebula/tree/master/0567-permutation-in-string) |
| [0643-maximum-average-subarray-i](https://github.com/flameshine/algorithm-nebula/tree/master/0643-maximum-average-subarray-i) |
| [1046-max-consecutive-ones-iii](https://github.com/flameshine/algorithm-nebula/tree/master/1046-max-consecutive-ones-iii) |
| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/flameshine/algorithm-nebula/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/flameshine/algorithm-nebula/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/flameshine/algorithm-nebula/tree/master/2394-count-subarrays-with-score-less-than-k) |
## Database
| |
| ------- |
| [0175-combine-two-tables](https://github.com/flameshine/algorithm-nebula/tree/master/0175-combine-two-tables) |
## Queue
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/flameshine/algorithm-nebula/tree/master/0239-sliding-window-maximum) |
| [0649-dota2-senate](https://github.com/flameshine/algorithm-nebula/tree/master/0649-dota2-senate) |
| [0969-number-of-recent-calls](https://github.com/flameshine/algorithm-nebula/tree/master/0969-number-of-recent-calls) |
## Monotonic Queue
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/flameshine/algorithm-nebula/tree/master/0239-sliding-window-maximum) |
## Design
| |
| ------- |
| [0146-lru-cache](https://github.com/flameshine/algorithm-nebula/tree/master/0146-lru-cache) |
| [0155-min-stack](https://github.com/flameshine/algorithm-nebula/tree/master/0155-min-stack) |
| [0208-implement-trie-prefix-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0208-implement-trie-prefix-tree) |
| [0295-find-median-from-data-stream](https://github.com/flameshine/algorithm-nebula/tree/master/0295-find-median-from-data-stream) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0355-design-twitter](https://github.com/flameshine/algorithm-nebula/tree/master/0355-design-twitter) |
| [0380-insert-delete-getrandom-o1](https://github.com/flameshine/algorithm-nebula/tree/master/0380-insert-delete-getrandom-o1) |
| [0789-kth-largest-element-in-a-stream](https://github.com/flameshine/algorithm-nebula/tree/master/0789-kth-largest-element-in-a-stream) |
| [0937-online-stock-span](https://github.com/flameshine/algorithm-nebula/tree/master/0937-online-stock-span) |
| [0969-number-of-recent-calls](https://github.com/flameshine/algorithm-nebula/tree/master/0969-number-of-recent-calls) |
| [1023-time-based-key-value-store](https://github.com/flameshine/algorithm-nebula/tree/master/1023-time-based-key-value-store) |
| [2413-smallest-number-in-infinite-set](https://github.com/flameshine/algorithm-nebula/tree/master/2413-smallest-number-in-infinite-set) |
## Backtracking
| |
| ------- |
| [0017-letter-combinations-of-a-phone-number](https://github.com/flameshine/algorithm-nebula/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0022-generate-parentheses](https://github.com/flameshine/algorithm-nebula/tree/master/0022-generate-parentheses) |
| [0039-combination-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0040-combination-sum-ii) |
| [0046-permutations](https://github.com/flameshine/algorithm-nebula/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/flameshine/algorithm-nebula/tree/master/0047-permutations-ii) |
| [0078-subsets](https://github.com/flameshine/algorithm-nebula/tree/master/0078-subsets) |
| [0216-combination-sum-iii](https://github.com/flameshine/algorithm-nebula/tree/master/0216-combination-sum-iii) |
## Bit Manipulation
| |
| ------- |
| [0078-subsets](https://github.com/flameshine/algorithm-nebula/tree/master/0078-subsets) |
| [0136-single-number](https://github.com/flameshine/algorithm-nebula/tree/master/0136-single-number) |
| [0287-find-the-duplicate-number](https://github.com/flameshine/algorithm-nebula/tree/master/0287-find-the-duplicate-number) |
| [0338-counting-bits](https://github.com/flameshine/algorithm-nebula/tree/master/0338-counting-bits) |
| [1441-minimum-flips-to-make-a-or-b-equal-to-c](https://github.com/flameshine/algorithm-nebula/tree/master/1441-minimum-flips-to-make-a-or-b-equal-to-c) |
## Doubly-Linked List
| |
| ------- |
| [0146-lru-cache](https://github.com/flameshine/algorithm-nebula/tree/master/0146-lru-cache) |
## Merge Sort
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/flameshine/algorithm-nebula/tree/master/0023-merge-k-sorted-lists) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0102-binary-tree-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0110-balanced-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0110-balanced-binary-tree) |
| [0124-binary-tree-maximum-path-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0124-binary-tree-maximum-path-sum) |
| [0199-binary-tree-right-side-view](https://github.com/flameshine/algorithm-nebula/tree/master/0199-binary-tree-right-side-view) |
| [0226-invert-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/flameshine/algorithm-nebula/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0437-path-sum-iii](https://github.com/flameshine/algorithm-nebula/tree/master/0437-path-sum-iii) |
| [0450-delete-node-in-a-bst](https://github.com/flameshine/algorithm-nebula/tree/master/0450-delete-node-in-a-bst) |
| [0543-diameter-of-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0543-diameter-of-binary-tree) |
| [0572-subtree-of-another-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0572-subtree-of-another-tree) |
| [0617-merge-two-binary-trees](https://github.com/flameshine/algorithm-nebula/tree/master/0617-merge-two-binary-trees) |
| [0783-search-in-a-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0784-insert-into-a-binary-search-tree) |
| [0789-kth-largest-element-in-a-stream](https://github.com/flameshine/algorithm-nebula/tree/master/0789-kth-largest-element-in-a-stream) |
| [0904-leaf-similar-trees](https://github.com/flameshine/algorithm-nebula/tree/master/0904-leaf-similar-trees) |
| [1005-univalued-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1005-univalued-binary-tree) |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
| [1116-maximum-level-sum-of-a-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1116-maximum-level-sum-of-a-binary-tree) |
| [1474-longest-zigzag-path-in-a-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1474-longest-zigzag-path-in-a-binary-tree) |
| [1544-count-good-nodes-in-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1544-count-good-nodes-in-binary-tree) |
## Depth-First Search
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0110-balanced-binary-tree) |
| [0124-binary-tree-maximum-path-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0124-binary-tree-maximum-path-sum) |
| [0199-binary-tree-right-side-view](https://github.com/flameshine/algorithm-nebula/tree/master/0199-binary-tree-right-side-view) |
| [0200-number-of-islands](https://github.com/flameshine/algorithm-nebula/tree/master/0200-number-of-islands) |
| [0226-invert-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/flameshine/algorithm-nebula/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0399-evaluate-division](https://github.com/flameshine/algorithm-nebula/tree/master/0399-evaluate-division) |
| [0437-path-sum-iii](https://github.com/flameshine/algorithm-nebula/tree/master/0437-path-sum-iii) |
| [0543-diameter-of-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0543-diameter-of-binary-tree) |
| [0547-number-of-provinces](https://github.com/flameshine/algorithm-nebula/tree/master/0547-number-of-provinces) |
| [0572-subtree-of-another-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0572-subtree-of-another-tree) |
| [0617-merge-two-binary-trees](https://github.com/flameshine/algorithm-nebula/tree/master/0617-merge-two-binary-trees) |
| [0871-keys-and-rooms](https://github.com/flameshine/algorithm-nebula/tree/master/0871-keys-and-rooms) |
| [0904-leaf-similar-trees](https://github.com/flameshine/algorithm-nebula/tree/master/0904-leaf-similar-trees) |
| [1005-univalued-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1005-univalued-binary-tree) |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
| [1116-maximum-level-sum-of-a-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1116-maximum-level-sum-of-a-binary-tree) |
| [1474-longest-zigzag-path-in-a-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1474-longest-zigzag-path-in-a-binary-tree) |
| [1544-count-good-nodes-in-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1544-count-good-nodes-in-binary-tree) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/flameshine/algorithm-nebula/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
## Breadth-First Search
| |
| ------- |
| [0100-same-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0102-binary-tree-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0104-maximum-depth-of-binary-tree) |
| [0199-binary-tree-right-side-view](https://github.com/flameshine/algorithm-nebula/tree/master/0199-binary-tree-right-side-view) |
| [0200-number-of-islands](https://github.com/flameshine/algorithm-nebula/tree/master/0200-number-of-islands) |
| [0226-invert-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0226-invert-binary-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0399-evaluate-division](https://github.com/flameshine/algorithm-nebula/tree/master/0399-evaluate-division) |
| [0547-number-of-provinces](https://github.com/flameshine/algorithm-nebula/tree/master/0547-number-of-provinces) |
| [0617-merge-two-binary-trees](https://github.com/flameshine/algorithm-nebula/tree/master/0617-merge-two-binary-trees) |
| [0871-keys-and-rooms](https://github.com/flameshine/algorithm-nebula/tree/master/0871-keys-and-rooms) |
| [1005-univalued-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1005-univalued-binary-tree) |
| [1036-rotting-oranges](https://github.com/flameshine/algorithm-nebula/tree/master/1036-rotting-oranges) |
| [1116-maximum-level-sum-of-a-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1116-maximum-level-sum-of-a-binary-tree) |
| [1544-count-good-nodes-in-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1544-count-good-nodes-in-binary-tree) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/flameshine/algorithm-nebula/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
| [2038-nearest-exit-from-entrance-in-maze](https://github.com/flameshine/algorithm-nebula/tree/master/2038-nearest-exit-from-entrance-in-maze) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0102-binary-tree-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/flameshine/algorithm-nebula/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0110-balanced-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0110-balanced-binary-tree) |
| [0124-binary-tree-maximum-path-sum](https://github.com/flameshine/algorithm-nebula/tree/master/0124-binary-tree-maximum-path-sum) |
| [0199-binary-tree-right-side-view](https://github.com/flameshine/algorithm-nebula/tree/master/0199-binary-tree-right-side-view) |
| [0226-invert-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/flameshine/algorithm-nebula/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0437-path-sum-iii](https://github.com/flameshine/algorithm-nebula/tree/master/0437-path-sum-iii) |
| [0450-delete-node-in-a-bst](https://github.com/flameshine/algorithm-nebula/tree/master/0450-delete-node-in-a-bst) |
| [0543-diameter-of-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0543-diameter-of-binary-tree) |
| [0572-subtree-of-another-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0572-subtree-of-another-tree) |
| [0617-merge-two-binary-trees](https://github.com/flameshine/algorithm-nebula/tree/master/0617-merge-two-binary-trees) |
| [0783-search-in-a-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0784-insert-into-a-binary-search-tree) |
| [0789-kth-largest-element-in-a-stream](https://github.com/flameshine/algorithm-nebula/tree/master/0789-kth-largest-element-in-a-stream) |
| [0904-leaf-similar-trees](https://github.com/flameshine/algorithm-nebula/tree/master/0904-leaf-similar-trees) |
| [1005-univalued-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1005-univalued-binary-tree) |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
| [1116-maximum-level-sum-of-a-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1116-maximum-level-sum-of-a-binary-tree) |
| [1474-longest-zigzag-path-in-a-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1474-longest-zigzag-path-in-a-binary-tree) |
| [1544-count-good-nodes-in-binary-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1544-count-good-nodes-in-binary-tree) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/flameshine/algorithm-nebula/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0572-subtree-of-another-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0572-subtree-of-another-tree) |
## Hash Function
| |
| ------- |
| [0572-subtree-of-another-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0572-subtree-of-another-tree) |
## Binary Search Tree
| |
| ------- |
| [0098-validate-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0099-recover-binary-search-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/flameshine/algorithm-nebula/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0450-delete-node-in-a-bst](https://github.com/flameshine/algorithm-nebula/tree/master/0450-delete-node-in-a-bst) |
| [0783-search-in-a-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0784-insert-into-a-binary-search-tree) |
| [0789-kth-largest-element-in-a-stream](https://github.com/flameshine/algorithm-nebula/tree/master/0789-kth-largest-element-in-a-stream) |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/flameshine/algorithm-nebula/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
## Data Stream
| |
| ------- |
| [0295-find-median-from-data-stream](https://github.com/flameshine/algorithm-nebula/tree/master/0295-find-median-from-data-stream) |
| [0789-kth-largest-element-in-a-stream](https://github.com/flameshine/algorithm-nebula/tree/master/0789-kth-largest-element-in-a-stream) |
| [0937-online-stock-span](https://github.com/flameshine/algorithm-nebula/tree/master/0937-online-stock-span) |
| [0969-number-of-recent-calls](https://github.com/flameshine/algorithm-nebula/tree/master/0969-number-of-recent-calls) |
## Geometry
| |
| ------- |
| [1014-k-closest-points-to-origin](https://github.com/flameshine/algorithm-nebula/tree/master/1014-k-closest-points-to-origin) |
## Simulation
| |
| ------- |
| [0068-text-justification](https://github.com/flameshine/algorithm-nebula/tree/master/0068-text-justification) |
| [0735-asteroid-collision](https://github.com/flameshine/algorithm-nebula/tree/master/0735-asteroid-collision) |
| [2428-equal-row-and-column-pairs](https://github.com/flameshine/algorithm-nebula/tree/master/2428-equal-row-and-column-pairs) |
| [2470-removing-stars-from-a-string](https://github.com/flameshine/algorithm-nebula/tree/master/2470-removing-stars-from-a-string) |
| [2553-total-cost-to-hire-k-workers](https://github.com/flameshine/algorithm-nebula/tree/master/2553-total-cost-to-hire-k-workers) |
## Graph
| |
| ------- |
| [0399-evaluate-division](https://github.com/flameshine/algorithm-nebula/tree/master/0399-evaluate-division) |
| [0547-number-of-provinces](https://github.com/flameshine/algorithm-nebula/tree/master/0547-number-of-provinces) |
| [0871-keys-and-rooms](https://github.com/flameshine/algorithm-nebula/tree/master/0871-keys-and-rooms) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/flameshine/algorithm-nebula/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
## Interactive
| |
| ------- |
| [0374-guess-number-higher-or-lower](https://github.com/flameshine/algorithm-nebula/tree/master/0374-guess-number-higher-or-lower) |
## Ordered Set
| |
| ------- |
| [2413-smallest-number-in-infinite-set](https://github.com/flameshine/algorithm-nebula/tree/master/2413-smallest-number-in-infinite-set) |
## Shortest Path
| |
| ------- |
| [0399-evaluate-division](https://github.com/flameshine/algorithm-nebula/tree/master/0399-evaluate-division) |
## Memoization
| |
| ------- |
| [1236-n-th-tribonacci-number](https://github.com/flameshine/algorithm-nebula/tree/master/1236-n-th-tribonacci-number) |
## Combinatorics
| |
| ------- |
| [0062-unique-paths](https://github.com/flameshine/algorithm-nebula/tree/master/0062-unique-paths) |
## Trie
| |
| ------- |
| [0208-implement-trie-prefix-tree](https://github.com/flameshine/algorithm-nebula/tree/master/0208-implement-trie-prefix-tree) |
| [1397-search-suggestions-system](https://github.com/flameshine/algorithm-nebula/tree/master/1397-search-suggestions-system) |
## Counting Sort
| |
| ------- |
| [0274-h-index](https://github.com/flameshine/algorithm-nebula/tree/master/0274-h-index) |
## Randomized
| |
| ------- |
| [0380-insert-delete-getrandom-o1](https://github.com/flameshine/algorithm-nebula/tree/master/0380-insert-delete-getrandom-o1) |
## Brainteaser
| |
| ------- |
| [2850-construct-the-longest-new-string](https://github.com/flameshine/algorithm-nebula/tree/master/2850-construct-the-longest-new-string) |