https://github.com/dpkrn/leetcode
Collection of LeetCode questions to ace the coding interview!
https://github.com/dpkrn/leetcode
Last synced: 9 months ago
JSON representation
Collection of LeetCode questions to ace the coding interview!
- Host: GitHub
- URL: https://github.com/dpkrn/leetcode
- Owner: DpkRn
- Created: 2023-12-18T17:46:10.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2025-01-25T18:32:53.000Z (12 months ago)
- Last Synced: 2025-04-22T21:06:05.213Z (9 months ago)
- Language: C++
- Homepage:
- Size: 1.57 MB
- Stars: 2
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Problems Optimised Solution
Gmail: d.wizard.techno@gmail.com
Linkdin: https://www.linkedin.com/in/deepak-kumar-b3181a236/
Instagram: https://www.instagram.com/uffh_rn/
LeetCode: https://leetcode.com/uffh_rn/
Collection of LeetCode questions to ace the coding interview!
Request: if you think any of the problem still can be optimise then please.. try to contribute :)
# LeetCode Topics
## Depth-First Search
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/DpkRn/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/DpkRn/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0386-lexicographical-numbers](https://github.com/DpkRn/LeetCode/tree/master/0386-lexicographical-numbers) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/DpkRn/LeetCode/tree/master/0776-n-ary-tree-postorder-traversal) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/DpkRn/LeetCode/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1207-delete-nodes-and-return-forest](https://github.com/DpkRn/LeetCode/tree/master/1207-delete-nodes-and-return-forest) |
| [1300-critical-connections-in-a-network](https://github.com/DpkRn/LeetCode/tree/master/1300-critical-connections-in-a-network) |
| [1396-count-servers-that-communicate](https://github.com/DpkRn/LeetCode/tree/master/1396-count-servers-that-communicate) |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/DpkRn/LeetCode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [1484-linked-list-in-binary-tree](https://github.com/DpkRn/LeetCode/tree/master/1484-linked-list-in-binary-tree) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/DpkRn/LeetCode/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [2035-count-sub-islands](https://github.com/DpkRn/LeetCode/tree/master/2035-count-sub-islands) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/DpkRn/LeetCode/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
## Breadth-First Search
| |
| ------- |
| [0407-trapping-rain-water-ii](https://github.com/DpkRn/LeetCode/tree/master/0407-trapping-rain-water-ii) |
| [0787-sliding-puzzle](https://github.com/DpkRn/LeetCode/tree/master/0787-sliding-puzzle) |
| [1396-count-servers-that-communicate](https://github.com/DpkRn/LeetCode/tree/master/1396-count-servers-that-communicate) |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/DpkRn/LeetCode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [1484-linked-list-in-binary-tree](https://github.com/DpkRn/LeetCode/tree/master/1484-linked-list-in-binary-tree) |
| [1876-map-of-highest-peak](https://github.com/DpkRn/LeetCode/tree/master/1876-map-of-highest-peak) |
| [2035-count-sub-islands](https://github.com/DpkRn/LeetCode/tree/master/2035-count-sub-islands) |
| [2171-second-minimum-time-to-reach-destination](https://github.com/DpkRn/LeetCode/tree/master/2171-second-minimum-time-to-reach-destination) |
## Graph
| |
| ------- |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/DpkRn/LeetCode/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1300-critical-connections-in-a-network](https://github.com/DpkRn/LeetCode/tree/master/1300-critical-connections-in-a-network) |
| [1325-path-with-maximum-probability](https://github.com/DpkRn/LeetCode/tree/master/1325-path-with-maximum-probability) |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/DpkRn/LeetCode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/DpkRn/LeetCode/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [1701-remove-max-number-of-edges-to-keep-graph-fully-traversable](https://github.com/DpkRn/LeetCode/tree/master/1701-remove-max-number-of-edges-to-keep-graph-fully-traversable) |
| [2171-second-minimum-time-to-reach-destination](https://github.com/DpkRn/LeetCode/tree/master/2171-second-minimum-time-to-reach-destination) |
| [2472-build-a-matrix-with-conditions](https://github.com/DpkRn/LeetCode/tree/master/2472-build-a-matrix-with-conditions) |
| [2803-modify-graph-edge-weights](https://github.com/DpkRn/LeetCode/tree/master/2803-modify-graph-edge-weights) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/DpkRn/LeetCode/tree/master/3235-minimum-cost-to-convert-string-i) |
## Topological Sort
| |
| ------- |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/DpkRn/LeetCode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [2472-build-a-matrix-with-conditions](https://github.com/DpkRn/LeetCode/tree/master/2472-build-a-matrix-with-conditions) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/DpkRn/LeetCode/tree/master/0128-longest-consecutive-sequence) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/DpkRn/LeetCode/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1396-count-servers-that-communicate](https://github.com/DpkRn/LeetCode/tree/master/1396-count-servers-that-communicate) |
| [1701-remove-max-number-of-edges-to-keep-graph-fully-traversable](https://github.com/DpkRn/LeetCode/tree/master/1701-remove-max-number-of-edges-to-keep-graph-fully-traversable) |
| [2035-count-sub-islands](https://github.com/DpkRn/LeetCode/tree/master/2035-count-sub-islands) |
| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/DpkRn/LeetCode/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/DpkRn/LeetCode/tree/master/0001-two-sum) |
| [0031-next-permutation](https://github.com/DpkRn/LeetCode/tree/master/0031-next-permutation) |
| [0042-trapping-rain-water](https://github.com/DpkRn/LeetCode/tree/master/0042-trapping-rain-water) |
| [0051-n-queens](https://github.com/DpkRn/LeetCode/tree/master/0051-n-queens) |
| [0053-maximum-subarray](https://github.com/DpkRn/LeetCode/tree/master/0053-maximum-subarray) |
| [0054-spiral-matrix](https://github.com/DpkRn/LeetCode/tree/master/0054-spiral-matrix) |
| [0075-sort-colors](https://github.com/DpkRn/LeetCode/tree/master/0075-sort-colors) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/DpkRn/LeetCode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0128-longest-consecutive-sequence](https://github.com/DpkRn/LeetCode/tree/master/0128-longest-consecutive-sequence) |
| [0179-largest-number](https://github.com/DpkRn/LeetCode/tree/master/0179-largest-number) |
| [0239-sliding-window-maximum](https://github.com/DpkRn/LeetCode/tree/master/0239-sliding-window-maximum) |
| [0268-missing-number](https://github.com/DpkRn/LeetCode/tree/master/0268-missing-number) |
| [0283-move-zeroes](https://github.com/DpkRn/LeetCode/tree/master/0283-move-zeroes) |
| [0303-range-sum-query-immutable](https://github.com/DpkRn/LeetCode/tree/master/0303-range-sum-query-immutable) |
| [0307-range-sum-query-mutable](https://github.com/DpkRn/LeetCode/tree/master/0307-range-sum-query-mutable) |
| [0350-intersection-of-two-arrays-ii](https://github.com/DpkRn/LeetCode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0407-trapping-rain-water-ii](https://github.com/DpkRn/LeetCode/tree/master/0407-trapping-rain-water-ii) |
| [0453-minimum-moves-to-equal-array-elements](https://github.com/DpkRn/LeetCode/tree/master/0453-minimum-moves-to-equal-array-elements) |
| [0456-132-pattern](https://github.com/DpkRn/LeetCode/tree/master/0456-132-pattern) |
| [0462-minimum-moves-to-equal-array-elements-ii](https://github.com/DpkRn/LeetCode/tree/master/0462-minimum-moves-to-equal-array-elements-ii) |
| [0485-max-consecutive-ones](https://github.com/DpkRn/LeetCode/tree/master/0485-max-consecutive-ones) |
| [0493-reverse-pairs](https://github.com/DpkRn/LeetCode/tree/master/0493-reverse-pairs) |
| [0496-next-greater-element-i](https://github.com/DpkRn/LeetCode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/DpkRn/LeetCode/tree/master/0503-next-greater-element-ii) |
| [0539-minimum-time-difference](https://github.com/DpkRn/LeetCode/tree/master/0539-minimum-time-difference) |
| [0605-can-place-flowers](https://github.com/DpkRn/LeetCode/tree/master/0605-can-place-flowers) |
| [0624-maximum-distance-in-arrays](https://github.com/DpkRn/LeetCode/tree/master/0624-maximum-distance-in-arrays) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/DpkRn/LeetCode/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0729-my-calendar-i](https://github.com/DpkRn/LeetCode/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/DpkRn/LeetCode/tree/master/0731-my-calendar-ii) |
| [0735-asteroid-collision](https://github.com/DpkRn/LeetCode/tree/master/0735-asteroid-collision) |
| [0787-sliding-puzzle](https://github.com/DpkRn/LeetCode/tree/master/0787-sliding-puzzle) |
| [0859-design-circular-deque](https://github.com/DpkRn/LeetCode/tree/master/0859-design-circular-deque) |
| [0890-lemonade-change](https://github.com/DpkRn/LeetCode/tree/master/0890-lemonade-change) |
| [0948-sort-an-array](https://github.com/DpkRn/LeetCode/tree/master/0948-sort-an-array) |
| [0952-word-subsets](https://github.com/DpkRn/LeetCode/tree/master/0952-word-subsets) |
| [0966-binary-subarrays-with-sum](https://github.com/DpkRn/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [1002-maximum-width-ramp](https://github.com/DpkRn/LeetCode/tree/master/1002-maximum-width-ramp) |
| [1044-find-common-characters](https://github.com/DpkRn/LeetCode/tree/master/1044-find-common-characters) |
| [1046-max-consecutive-ones-iii](https://github.com/DpkRn/LeetCode/tree/master/1046-max-consecutive-ones-iii) |
| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/DpkRn/LeetCode/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |
| [1196-filling-bookcase-shelves](https://github.com/DpkRn/LeetCode/tree/master/1196-filling-bookcase-shelves) |
| [1207-delete-nodes-and-return-forest](https://github.com/DpkRn/LeetCode/tree/master/1207-delete-nodes-and-return-forest) |
| [1240-stone-game-ii](https://github.com/DpkRn/LeetCode/tree/master/1240-stone-game-ii) |
| [1256-rank-transform-of-an-array](https://github.com/DpkRn/LeetCode/tree/master/1256-rank-transform-of-an-array) |
| [1293-three-consecutive-odds](https://github.com/DpkRn/LeetCode/tree/master/1293-three-consecutive-odds) |
| [1325-path-with-maximum-probability](https://github.com/DpkRn/LeetCode/tree/master/1325-path-with-maximum-probability) |
| [1333-sort-the-jumbled-numbers](https://github.com/DpkRn/LeetCode/tree/master/1333-sort-the-jumbled-numbers) |
| [1370-count-number-of-nice-subarrays](https://github.com/DpkRn/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |
| [1396-count-servers-that-communicate](https://github.com/DpkRn/LeetCode/tree/master/1396-count-servers-that-communicate) |
| [1435-xor-queries-of-a-subarray](https://github.com/DpkRn/LeetCode/tree/master/1435-xor-queries-of-a-subarray) |
| [1496-lucky-numbers-in-a-matrix](https://github.com/DpkRn/LeetCode/tree/master/1496-lucky-numbers-in-a-matrix) |
| [1511-count-number-of-teams](https://github.com/DpkRn/LeetCode/tree/master/1511-count-number-of-teams) |
| [1524-string-matching-in-an-array](https://github.com/DpkRn/LeetCode/tree/master/1524-string-matching-in-an-array) |
| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/DpkRn/LeetCode/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/DpkRn/LeetCode/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/DpkRn/LeetCode/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/DpkRn/LeetCode/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1694-make-sum-divisible-by-p](https://github.com/DpkRn/LeetCode/tree/master/1694-make-sum-divisible-by-p) |
| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/DpkRn/LeetCode/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |
| [1720-crawler-log-folder](https://github.com/DpkRn/LeetCode/tree/master/1720-crawler-log-folder) |
| [1741-sort-array-by-increasing-frequency](https://github.com/DpkRn/LeetCode/tree/master/1741-sort-array-by-increasing-frequency) |
| [1755-defuse-the-bomb](https://github.com/DpkRn/LeetCode/tree/master/1755-defuse-the-bomb) |
| [1786-count-the-number-of-consistent-strings](https://github.com/DpkRn/LeetCode/tree/master/1786-count-the-number-of-consistent-strings) |
| [1803-average-waiting-time](https://github.com/DpkRn/LeetCode/tree/master/1803-average-waiting-time) |
| [1876-map-of-highest-peak](https://github.com/DpkRn/LeetCode/tree/master/1876-map-of-highest-peak) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/DpkRn/LeetCode/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/DpkRn/LeetCode/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [1917-maximum-average-pass-ratio](https://github.com/DpkRn/LeetCode/tree/master/1917-maximum-average-pass-ratio) |
| [1923-sentence-similarity-iii](https://github.com/DpkRn/LeetCode/tree/master/1923-sentence-similarity-iii) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/DpkRn/LeetCode/tree/master/1951-find-the-winner-of-the-circular-game) |
| [1972-rotating-the-box](https://github.com/DpkRn/LeetCode/tree/master/1972-rotating-the-box) |
| [1995-finding-pairs-with-a-certain-sum](https://github.com/DpkRn/LeetCode/tree/master/1995-finding-pairs-with-a-certain-sum) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/DpkRn/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2035-count-sub-islands](https://github.com/DpkRn/LeetCode/tree/master/2035-count-sub-islands) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/DpkRn/LeetCode/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2067-maximum-number-of-points-with-cost](https://github.com/DpkRn/LeetCode/tree/master/2067-maximum-number-of-points-with-cost) |
| [2089-maximum-matrix-sum](https://github.com/DpkRn/LeetCode/tree/master/2089-maximum-matrix-sum) |
| [2113-find-the-kth-largest-integer-in-the-array](https://github.com/DpkRn/LeetCode/tree/master/2113-find-the-kth-largest-integer-in-the-array) |
| [2132-convert-1d-array-into-2d-array](https://github.com/DpkRn/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |
| [2163-kth-distinct-string-in-an-array](https://github.com/DpkRn/LeetCode/tree/master/2163-kth-distinct-string-in-an-array) |
| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/DpkRn/LeetCode/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/DpkRn/LeetCode/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
| [2292-counting-words-with-a-given-prefix](https://github.com/DpkRn/LeetCode/tree/master/2292-counting-words-with-a-given-prefix) |
| [2301-count-array-pairs-divisible-by-k](https://github.com/DpkRn/LeetCode/tree/master/2301-count-array-pairs-divisible-by-k) |
| [2306-create-binary-tree-from-descriptions](https://github.com/DpkRn/LeetCode/tree/master/2306-create-binary-tree-from-descriptions) |
| [2358-number-of-ways-to-split-array](https://github.com/DpkRn/LeetCode/tree/master/2358-number-of-ways-to-split-array) |
| [2472-build-a-matrix-with-conditions](https://github.com/DpkRn/LeetCode/tree/master/2472-build-a-matrix-with-conditions) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/DpkRn/LeetCode/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/DpkRn/LeetCode/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [2502-sort-the-people](https://github.com/DpkRn/LeetCode/tree/master/2502-sort-the-people) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/DpkRn/LeetCode/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [2533-bitwise-xor-of-all-pairings](https://github.com/DpkRn/LeetCode/tree/master/2533-bitwise-xor-of-all-pairings) |
| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/DpkRn/LeetCode/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/DpkRn/LeetCode/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2691-count-vowel-strings-in-ranges](https://github.com/DpkRn/LeetCode/tree/master/2691-count-vowel-strings-in-ranges) |
| [2692-take-gifts-from-the-richest-pile](https://github.com/DpkRn/LeetCode/tree/master/2692-take-gifts-from-the-richest-pile) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/DpkRn/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2727-number-of-senior-citizens](https://github.com/DpkRn/LeetCode/tree/master/2727-number-of-senior-citizens) |
| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/DpkRn/LeetCode/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |
| [2792-neighboring-bitwise-xor](https://github.com/DpkRn/LeetCode/tree/master/2792-neighboring-bitwise-xor) |
| [2846-robot-collisions](https://github.com/DpkRn/LeetCode/tree/master/2846-robot-collisions) |
| [2868-continuous-subarrays](https://github.com/DpkRn/LeetCode/tree/master/2868-continuous-subarrays) |
| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/DpkRn/LeetCode/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |
| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/DpkRn/LeetCode/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/DpkRn/LeetCode/tree/master/3235-minimum-cost-to-convert-string-i) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/DpkRn/LeetCode/tree/master/3309-count-prefix-and-suffix-pairs-i) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/DpkRn/LeetCode/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/DpkRn/LeetCode/tree/master/3522-find-the-power-of-k-size-subarrays-i) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/DpkRn/LeetCode/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/DpkRn/LeetCode/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/DpkRn/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0128-longest-consecutive-sequence](https://github.com/DpkRn/LeetCode/tree/master/0128-longest-consecutive-sequence) |
| [0138-copy-list-with-random-pointer](https://github.com/DpkRn/LeetCode/tree/master/0138-copy-list-with-random-pointer) |
| [0202-happy-number](https://github.com/DpkRn/LeetCode/tree/master/0202-happy-number) |
| [0264-ugly-number-ii](https://github.com/DpkRn/LeetCode/tree/master/0264-ugly-number-ii) |
| [0268-missing-number](https://github.com/DpkRn/LeetCode/tree/master/0268-missing-number) |
| [0350-intersection-of-two-arrays-ii](https://github.com/DpkRn/LeetCode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0424-longest-repeating-character-replacement](https://github.com/DpkRn/LeetCode/tree/master/0424-longest-repeating-character-replacement) |
| [0432-all-oone-data-structure](https://github.com/DpkRn/LeetCode/tree/master/0432-all-oone-data-structure) |
| [0496-next-greater-element-i](https://github.com/DpkRn/LeetCode/tree/master/0496-next-greater-element-i) |
| [0567-permutation-in-string](https://github.com/DpkRn/LeetCode/tree/master/0567-permutation-in-string) |
| [0726-number-of-atoms](https://github.com/DpkRn/LeetCode/tree/master/0726-number-of-atoms) |
| [0807-custom-sort-string](https://github.com/DpkRn/LeetCode/tree/master/0807-custom-sort-string) |
| [0952-word-subsets](https://github.com/DpkRn/LeetCode/tree/master/0952-word-subsets) |
| [0966-binary-subarrays-with-sum](https://github.com/DpkRn/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/DpkRn/LeetCode/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1044-find-common-characters](https://github.com/DpkRn/LeetCode/tree/master/1044-find-common-characters) |
| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/DpkRn/LeetCode/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |
| [1207-delete-nodes-and-return-forest](https://github.com/DpkRn/LeetCode/tree/master/1207-delete-nodes-and-return-forest) |
| [1256-rank-transform-of-an-array](https://github.com/DpkRn/LeetCode/tree/master/1256-rank-transform-of-an-array) |
| [1370-count-number-of-nice-subarrays](https://github.com/DpkRn/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/DpkRn/LeetCode/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/DpkRn/LeetCode/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/DpkRn/LeetCode/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1694-make-sum-divisible-by-p](https://github.com/DpkRn/LeetCode/tree/master/1694-make-sum-divisible-by-p) |
| [1741-sort-array-by-increasing-frequency](https://github.com/DpkRn/LeetCode/tree/master/1741-sort-array-by-increasing-frequency) |
| [1786-count-the-number-of-consistent-strings](https://github.com/DpkRn/LeetCode/tree/master/1786-count-the-number-of-consistent-strings) |
| [1995-finding-pairs-with-a-certain-sum](https://github.com/DpkRn/LeetCode/tree/master/1995-finding-pairs-with-a-certain-sum) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/DpkRn/LeetCode/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/DpkRn/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2163-kth-distinct-string-in-an-array](https://github.com/DpkRn/LeetCode/tree/master/2163-kth-distinct-string-in-an-array) |
| [2306-create-binary-tree-from-descriptions](https://github.com/DpkRn/LeetCode/tree/master/2306-create-binary-tree-from-descriptions) |
| [2502-sort-the-people](https://github.com/DpkRn/LeetCode/tree/master/2502-sort-the-people) |
| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/DpkRn/LeetCode/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/DpkRn/LeetCode/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2599-take-k-of-each-character-from-left-and-right](https://github.com/DpkRn/LeetCode/tree/master/2599-take-k-of-each-character-from-left-and-right) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/DpkRn/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/DpkRn/LeetCode/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/DpkRn/LeetCode/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/DpkRn/LeetCode/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3455-minimum-length-of-string-after-operations](https://github.com/DpkRn/LeetCode/tree/master/3455-minimum-length-of-string-after-operations) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/DpkRn/LeetCode/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
## Two Pointers
| |
| ------- |
| [0031-next-permutation](https://github.com/DpkRn/LeetCode/tree/master/0031-next-permutation) |
| [0042-trapping-rain-water](https://github.com/DpkRn/LeetCode/tree/master/0042-trapping-rain-water) |
| [0075-sort-colors](https://github.com/DpkRn/LeetCode/tree/master/0075-sort-colors) |
| [0202-happy-number](https://github.com/DpkRn/LeetCode/tree/master/0202-happy-number) |
| [0283-move-zeroes](https://github.com/DpkRn/LeetCode/tree/master/0283-move-zeroes) |
| [0350-intersection-of-two-arrays-ii](https://github.com/DpkRn/LeetCode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0556-next-greater-element-iii](https://github.com/DpkRn/LeetCode/tree/master/0556-next-greater-element-iii) |
| [0567-permutation-in-string](https://github.com/DpkRn/LeetCode/tree/master/0567-permutation-in-string) |
| [0696-count-binary-substrings](https://github.com/DpkRn/LeetCode/tree/master/0696-count-binary-substrings) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/DpkRn/LeetCode/tree/master/0719-find-k-th-smallest-pair-distance) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/DpkRn/LeetCode/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1923-sentence-similarity-iii](https://github.com/DpkRn/LeetCode/tree/master/1923-sentence-similarity-iii) |
| [1972-rotating-the-box](https://github.com/DpkRn/LeetCode/tree/master/1972-rotating-the-box) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/DpkRn/LeetCode/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/DpkRn/LeetCode/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/DpkRn/LeetCode/tree/master/2581-divide-players-into-teams-of-equal-skill) |
## Binary Search
| |
| ------- |
| [0268-missing-number](https://github.com/DpkRn/LeetCode/tree/master/0268-missing-number) |
| [0350-intersection-of-two-arrays-ii](https://github.com/DpkRn/LeetCode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0456-132-pattern](https://github.com/DpkRn/LeetCode/tree/master/0456-132-pattern) |
| [0493-reverse-pairs](https://github.com/DpkRn/LeetCode/tree/master/0493-reverse-pairs) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/DpkRn/LeetCode/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0729-my-calendar-i](https://github.com/DpkRn/LeetCode/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/DpkRn/LeetCode/tree/master/0731-my-calendar-ii) |
| [1046-max-consecutive-ones-iii](https://github.com/DpkRn/LeetCode/tree/master/1046-max-consecutive-ones-iii) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/DpkRn/LeetCode/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/DpkRn/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/DpkRn/LeetCode/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |
| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/DpkRn/LeetCode/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/DpkRn/LeetCode/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
## Sorting
| |
| ------- |
| [0075-sort-colors](https://github.com/DpkRn/LeetCode/tree/master/0075-sort-colors) |
| [0179-largest-number](https://github.com/DpkRn/LeetCode/tree/master/0179-largest-number) |
| [0268-missing-number](https://github.com/DpkRn/LeetCode/tree/master/0268-missing-number) |
| [0350-intersection-of-two-arrays-ii](https://github.com/DpkRn/LeetCode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0462-minimum-moves-to-equal-array-elements-ii](https://github.com/DpkRn/LeetCode/tree/master/0462-minimum-moves-to-equal-array-elements-ii) |
| [0539-minimum-time-difference](https://github.com/DpkRn/LeetCode/tree/master/0539-minimum-time-difference) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/DpkRn/LeetCode/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0726-number-of-atoms](https://github.com/DpkRn/LeetCode/tree/master/0726-number-of-atoms) |
| [0807-custom-sort-string](https://github.com/DpkRn/LeetCode/tree/master/0807-custom-sort-string) |
| [0948-sort-an-array](https://github.com/DpkRn/LeetCode/tree/master/0948-sort-an-array) |
| [1256-rank-transform-of-an-array](https://github.com/DpkRn/LeetCode/tree/master/1256-rank-transform-of-an-array) |
| [1333-sort-the-jumbled-numbers](https://github.com/DpkRn/LeetCode/tree/master/1333-sort-the-jumbled-numbers) |
| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/DpkRn/LeetCode/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/DpkRn/LeetCode/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/DpkRn/LeetCode/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
| [1741-sort-array-by-increasing-frequency](https://github.com/DpkRn/LeetCode/tree/master/1741-sort-array-by-increasing-frequency) |
| [1970-sorting-the-sentence](https://github.com/DpkRn/LeetCode/tree/master/1970-sorting-the-sentence) |
| [2113-find-the-kth-largest-integer-in-the-array](https://github.com/DpkRn/LeetCode/tree/master/2113-find-the-kth-largest-integer-in-the-array) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/DpkRn/LeetCode/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2502-sort-the-people](https://github.com/DpkRn/LeetCode/tree/master/2502-sort-the-people) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/DpkRn/LeetCode/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/DpkRn/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2846-robot-collisions](https://github.com/DpkRn/LeetCode/tree/master/2846-robot-collisions) |
| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/DpkRn/LeetCode/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |
| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/DpkRn/LeetCode/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/DpkRn/LeetCode/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Greedy
| |
| ------- |
| [0179-largest-number](https://github.com/DpkRn/LeetCode/tree/master/0179-largest-number) |
| [0402-remove-k-digits](https://github.com/DpkRn/LeetCode/tree/master/0402-remove-k-digits) |
| [0605-can-place-flowers](https://github.com/DpkRn/LeetCode/tree/master/0605-can-place-flowers) |
| [0624-maximum-distance-in-arrays](https://github.com/DpkRn/LeetCode/tree/master/0624-maximum-distance-in-arrays) |
| [0890-lemonade-change](https://github.com/DpkRn/LeetCode/tree/master/0890-lemonade-change) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/DpkRn/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/DpkRn/LeetCode/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/DpkRn/LeetCode/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |
| [1818-maximum-score-from-removing-substrings](https://github.com/DpkRn/LeetCode/tree/master/1818-maximum-score-from-removing-substrings) |
| [1917-maximum-average-pass-ratio](https://github.com/DpkRn/LeetCode/tree/master/1917-maximum-average-pass-ratio) |
| [2089-maximum-matrix-sum](https://github.com/DpkRn/LeetCode/tree/master/2089-maximum-matrix-sum) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/DpkRn/LeetCode/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/DpkRn/LeetCode/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2509-minimize-xor](https://github.com/DpkRn/LeetCode/tree/master/2509-minimize-xor) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/DpkRn/LeetCode/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Linked List
| |
| ------- |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/DpkRn/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0138-copy-list-with-random-pointer](https://github.com/DpkRn/LeetCode/tree/master/0138-copy-list-with-random-pointer) |
| [0432-all-oone-data-structure](https://github.com/DpkRn/LeetCode/tree/master/0432-all-oone-data-structure) |
| [0725-split-linked-list-in-parts](https://github.com/DpkRn/LeetCode/tree/master/0725-split-linked-list-in-parts) |
| [0859-design-circular-deque](https://github.com/DpkRn/LeetCode/tree/master/0859-design-circular-deque) |
| [1484-linked-list-in-binary-tree](https://github.com/DpkRn/LeetCode/tree/master/1484-linked-list-in-binary-tree) |
| [2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points](https://github.com/DpkRn/LeetCode/tree/master/2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/DpkRn/LeetCode/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/DpkRn/LeetCode/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
## Database
| |
| ------- |
| [0175-combine-two-tables](https://github.com/DpkRn/LeetCode/tree/master/0175-combine-two-tables) |
| [0181-employees-earning-more-than-their-managers](https://github.com/DpkRn/LeetCode/tree/master/0181-employees-earning-more-than-their-managers) |
| [0182-duplicate-emails](https://github.com/DpkRn/LeetCode/tree/master/0182-duplicate-emails) |
| [0183-customers-who-never-order](https://github.com/DpkRn/LeetCode/tree/master/0183-customers-who-never-order) |
| [0584-find-customer-referee](https://github.com/DpkRn/LeetCode/tree/master/0584-find-customer-referee) |
| [1153-product-sales-analysis-i](https://github.com/DpkRn/LeetCode/tree/master/1153-product-sales-analysis-i) |
| [1258-article-views-i](https://github.com/DpkRn/LeetCode/tree/master/1258-article-views-i) |
| [1509-replace-employee-id-with-the-unique-identifier](https://github.com/DpkRn/LeetCode/tree/master/1509-replace-employee-id-with-the-unique-identifier) |
| [1827-invalid-tweets](https://github.com/DpkRn/LeetCode/tree/master/1827-invalid-tweets) |
| [1908-recyclable-and-low-fat-products](https://github.com/DpkRn/LeetCode/tree/master/1908-recyclable-and-low-fat-products) |
## Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/DpkRn/LeetCode/tree/master/0042-trapping-rain-water) |
| [0094-binary-tree-inorder-traversal](https://github.com/DpkRn/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/DpkRn/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0394-decode-string](https://github.com/DpkRn/LeetCode/tree/master/0394-decode-string) |
| [0402-remove-k-digits](https://github.com/DpkRn/LeetCode/tree/master/0402-remove-k-digits) |
| [0456-132-pattern](https://github.com/DpkRn/LeetCode/tree/master/0456-132-pattern) |
| [0496-next-greater-element-i](https://github.com/DpkRn/LeetCode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/DpkRn/LeetCode/tree/master/0503-next-greater-element-ii) |
| [0726-number-of-atoms](https://github.com/DpkRn/LeetCode/tree/master/0726-number-of-atoms) |
| [0735-asteroid-collision](https://github.com/DpkRn/LeetCode/tree/master/0735-asteroid-collision) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/DpkRn/LeetCode/tree/master/0776-n-ary-tree-postorder-traversal) |
| [0886-score-of-parentheses](https://github.com/DpkRn/LeetCode/tree/master/0886-score-of-parentheses) |
| [0916-decoded-string-at-index](https://github.com/DpkRn/LeetCode/tree/master/0916-decoded-string-at-index) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/DpkRn/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1002-maximum-width-ramp](https://github.com/DpkRn/LeetCode/tree/master/1002-maximum-width-ramp) |
| [1298-reverse-substrings-between-each-pair-of-parentheses](https://github.com/DpkRn/LeetCode/tree/master/1298-reverse-substrings-between-each-pair-of-parentheses) |
| [1720-crawler-log-folder](https://github.com/DpkRn/LeetCode/tree/master/1720-crawler-log-folder) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/DpkRn/LeetCode/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [1818-maximum-score-from-removing-substrings](https://github.com/DpkRn/LeetCode/tree/master/1818-maximum-score-from-removing-substrings) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/DpkRn/LeetCode/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2800-minimum-string-length-after-removing-substrings](https://github.com/DpkRn/LeetCode/tree/master/2800-minimum-string-length-after-removing-substrings) |
| [2846-robot-collisions](https://github.com/DpkRn/LeetCode/tree/master/2846-robot-collisions) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/DpkRn/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/DpkRn/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/DpkRn/LeetCode/tree/master/0776-n-ary-tree-postorder-traversal) |
| [0789-kth-largest-element-in-a-stream](https://github.com/DpkRn/LeetCode/tree/master/0789-kth-largest-element-in-a-stream) |
| [1207-delete-nodes-and-return-forest](https://github.com/DpkRn/LeetCode/tree/master/1207-delete-nodes-and-return-forest) |
| [1484-linked-list-in-binary-tree](https://github.com/DpkRn/LeetCode/tree/master/1484-linked-list-in-binary-tree) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/DpkRn/LeetCode/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/DpkRn/LeetCode/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2306-create-binary-tree-from-descriptions](https://github.com/DpkRn/LeetCode/tree/master/2306-create-binary-tree-from-descriptions) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/DpkRn/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/DpkRn/LeetCode/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0789-kth-largest-element-in-a-stream](https://github.com/DpkRn/LeetCode/tree/master/0789-kth-largest-element-in-a-stream) |
| [1207-delete-nodes-and-return-forest](https://github.com/DpkRn/LeetCode/tree/master/1207-delete-nodes-and-return-forest) |
| [1484-linked-list-in-binary-tree](https://github.com/DpkRn/LeetCode/tree/master/1484-linked-list-in-binary-tree) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/DpkRn/LeetCode/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/DpkRn/LeetCode/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2306-create-binary-tree-from-descriptions](https://github.com/DpkRn/LeetCode/tree/master/2306-create-binary-tree-from-descriptions) |
## Math
| |
| ------- |
| [0202-happy-number](https://github.com/DpkRn/LeetCode/tree/master/0202-happy-number) |
| [0264-ugly-number-ii](https://github.com/DpkRn/LeetCode/tree/master/0264-ugly-number-ii) |
| [0268-missing-number](https://github.com/DpkRn/LeetCode/tree/master/0268-missing-number) |
| [0273-integer-to-english-words](https://github.com/DpkRn/LeetCode/tree/master/0273-integer-to-english-words) |
| [0453-minimum-moves-to-equal-array-elements](https://github.com/DpkRn/LeetCode/tree/master/0453-minimum-moves-to-equal-array-elements) |
| [0462-minimum-moves-to-equal-array-elements-ii](https://github.com/DpkRn/LeetCode/tree/master/0462-minimum-moves-to-equal-array-elements-ii) |
| [0539-minimum-time-difference](https://github.com/DpkRn/LeetCode/tree/master/0539-minimum-time-difference) |
| [0556-next-greater-element-iii](https://github.com/DpkRn/LeetCode/tree/master/0556-next-greater-element-iii) |
| [0564-find-the-closest-palindrome](https://github.com/DpkRn/LeetCode/tree/master/0564-find-the-closest-palindrome) |
| [0592-fraction-addition-and-subtraction](https://github.com/DpkRn/LeetCode/tree/master/0592-fraction-addition-and-subtraction) |
| [0650-2-keys-keyboard](https://github.com/DpkRn/LeetCode/tree/master/0650-2-keys-keyboard) |
| [1240-stone-game-ii](https://github.com/DpkRn/LeetCode/tree/master/1240-stone-game-ii) |
| [1370-count-number-of-nice-subarrays](https://github.com/DpkRn/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |
| [1642-water-bottles](https://github.com/DpkRn/LeetCode/tree/master/1642-water-bottles) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/DpkRn/LeetCode/tree/master/1951-find-the-winner-of-the-circular-game) |
| [2301-count-array-pairs-divisible-by-k](https://github.com/DpkRn/LeetCode/tree/master/2301-count-array-pairs-divisible-by-k) |
| [2645-pass-the-pillow](https://github.com/DpkRn/LeetCode/tree/master/2645-pass-the-pillow) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/DpkRn/LeetCode/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/DpkRn/LeetCode/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Simulation
| |
| ------- |
| [0054-spiral-matrix](https://github.com/DpkRn/LeetCode/tree/master/0054-spiral-matrix) |
| [0592-fraction-addition-and-subtraction](https://github.com/DpkRn/LeetCode/tree/master/0592-fraction-addition-and-subtraction) |
| [0735-asteroid-collision](https://github.com/DpkRn/LeetCode/tree/master/0735-asteroid-collision) |
| [1642-water-bottles](https://github.com/DpkRn/LeetCode/tree/master/1642-water-bottles) |
| [1803-average-waiting-time](https://github.com/DpkRn/LeetCode/tree/master/1803-average-waiting-time) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/DpkRn/LeetCode/tree/master/1951-find-the-winner-of-the-circular-game) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/DpkRn/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2076-sum-of-digits-of-string-after-convert](https://github.com/DpkRn/LeetCode/tree/master/2076-sum-of-digits-of-string-after-convert) |
| [2132-convert-1d-array-into-2d-array](https://github.com/DpkRn/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |
| [2645-pass-the-pillow](https://github.com/DpkRn/LeetCode/tree/master/2645-pass-the-pillow) |
| [2692-take-gifts-from-the-richest-pile](https://github.com/DpkRn/LeetCode/tree/master/2692-take-gifts-from-the-richest-pile) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/DpkRn/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2800-minimum-string-length-after-removing-substrings](https://github.com/DpkRn/LeetCode/tree/master/2800-minimum-string-length-after-removing-substrings) |
| [2846-robot-collisions](https://github.com/DpkRn/LeetCode/tree/master/2846-robot-collisions) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/DpkRn/LeetCode/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Recursion
| |
| ------- |
| [0273-integer-to-english-words](https://github.com/DpkRn/LeetCode/tree/master/0273-integer-to-english-words) |
| [0394-decode-string](https://github.com/DpkRn/LeetCode/tree/master/0394-decode-string) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/DpkRn/LeetCode/tree/master/1951-find-the-winner-of-the-circular-game) |
## Queue
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/DpkRn/LeetCode/tree/master/0239-sliding-window-maximum) |
| [0859-design-circular-deque](https://github.com/DpkRn/LeetCode/tree/master/0859-design-circular-deque) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/DpkRn/LeetCode/tree/master/1951-find-the-winner-of-the-circular-game) |
| [2868-continuous-subarrays](https://github.com/DpkRn/LeetCode/tree/master/2868-continuous-subarrays) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/DpkRn/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0014-longest-common-prefix](https://github.com/DpkRn/LeetCode/tree/master/0014-longest-common-prefix) |
| [0179-largest-number](https://github.com/DpkRn/LeetCode/tree/master/0179-largest-number) |
| [0214-shortest-palindrome](https://github.com/DpkRn/LeetCode/tree/master/0214-shortest-palindrome) |
| [0273-integer-to-english-words](https://github.com/DpkRn/LeetCode/tree/master/0273-integer-to-english-words) |
| [0394-decode-string](https://github.com/DpkRn/LeetCode/tree/master/0394-decode-string) |
| [0402-remove-k-digits](https://github.com/DpkRn/LeetCode/tree/master/0402-remove-k-digits) |
| [0424-longest-repeating-character-replacement](https://github.com/DpkRn/LeetCode/tree/master/0424-longest-repeating-character-replacement) |
| [0539-minimum-time-difference](https://github.com/DpkRn/LeetCode/tree/master/0539-minimum-time-difference) |
| [0556-next-greater-element-iii](https://github.com/DpkRn/LeetCode/tree/master/0556-next-greater-element-iii) |
| [0564-find-the-closest-palindrome](https://github.com/DpkRn/LeetCode/tree/master/0564-find-the-closest-palindrome) |
| [0567-permutation-in-string](https://github.com/DpkRn/LeetCode/tree/master/0567-permutation-in-string) |
| [0592-fraction-addition-and-subtraction](https://github.com/DpkRn/LeetCode/tree/master/0592-fraction-addition-and-subtraction) |
| [0664-strange-printer](https://github.com/DpkRn/LeetCode/tree/master/0664-strange-printer) |
| [0696-count-binary-substrings](https://github.com/DpkRn/LeetCode/tree/master/0696-count-binary-substrings) |
| [0726-number-of-atoms](https://github.com/DpkRn/LeetCode/tree/master/0726-number-of-atoms) |
| [0807-custom-sort-string](https://github.com/DpkRn/LeetCode/tree/master/0807-custom-sort-string) |
| [0886-score-of-parentheses](https://github.com/DpkRn/LeetCode/tree/master/0886-score-of-parentheses) |
| [0916-decoded-string-at-index](https://github.com/DpkRn/LeetCode/tree/master/0916-decoded-string-at-index) |
| [0952-word-subsets](https://github.com/DpkRn/LeetCode/tree/master/0952-word-subsets) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/DpkRn/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1044-find-common-characters](https://github.com/DpkRn/LeetCode/tree/master/1044-find-common-characters) |
| [1298-reverse-substrings-between-each-pair-of-parentheses](https://github.com/DpkRn/LeetCode/tree/master/1298-reverse-substrings-between-each-pair-of-parentheses) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/DpkRn/LeetCode/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1508-longest-happy-prefix](https://github.com/DpkRn/LeetCode/tree/master/1508-longest-happy-prefix) |
| [1524-string-matching-in-an-array](https://github.com/DpkRn/LeetCode/tree/master/1524-string-matching-in-an-array) |
| [1537-maximum-score-after-splitting-a-string](https://github.com/DpkRn/LeetCode/tree/master/1537-maximum-score-after-splitting-a-string) |
| [1720-crawler-log-folder](https://github.com/DpkRn/LeetCode/tree/master/1720-crawler-log-folder) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/DpkRn/LeetCode/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [1786-count-the-number-of-consistent-strings](https://github.com/DpkRn/LeetCode/tree/master/1786-count-the-number-of-consistent-strings) |
| [1818-maximum-score-from-removing-substrings](https://github.com/DpkRn/LeetCode/tree/master/1818-maximum-score-from-removing-substrings) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/DpkRn/LeetCode/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [1923-sentence-similarity-iii](https://github.com/DpkRn/LeetCode/tree/master/1923-sentence-similarity-iii) |
| [1970-sorting-the-sentence](https://github.com/DpkRn/LeetCode/tree/master/1970-sorting-the-sentence) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/DpkRn/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2076-sum-of-digits-of-string-after-convert](https://github.com/DpkRn/LeetCode/tree/master/2076-sum-of-digits-of-string-after-convert) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/DpkRn/LeetCode/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2113-find-the-kth-largest-integer-in-the-array](https://github.com/DpkRn/LeetCode/tree/master/2113-find-the-kth-largest-integer-in-the-array) |
| [2163-kth-distinct-string-in-an-array](https://github.com/DpkRn/LeetCode/tree/master/2163-kth-distinct-string-in-an-array) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/DpkRn/LeetCode/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2292-counting-words-with-a-given-prefix](https://github.com/DpkRn/LeetCode/tree/master/2292-counting-words-with-a-given-prefix) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/DpkRn/LeetCode/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [2502-sort-the-people](https://github.com/DpkRn/LeetCode/tree/master/2502-sort-the-people) |
| [2599-take-k-of-each-character-from-left-and-right](https://github.com/DpkRn/LeetCode/tree/master/2599-take-k-of-each-character-from-left-and-right) |
| [2691-count-vowel-strings-in-ranges](https://github.com/DpkRn/LeetCode/tree/master/2691-count-vowel-strings-in-ranges) |
| [2727-number-of-senior-citizens](https://github.com/DpkRn/LeetCode/tree/master/2727-number-of-senior-citizens) |
| [2800-minimum-string-length-after-removing-substrings](https://github.com/DpkRn/LeetCode/tree/master/2800-minimum-string-length-after-removing-substrings) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/DpkRn/LeetCode/tree/master/3235-minimum-cost-to-convert-string-i) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/DpkRn/LeetCode/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/DpkRn/LeetCode/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/DpkRn/LeetCode/tree/master/3309-count-prefix-and-suffix-pairs-i) |
| [3455-minimum-length-of-string-after-operations](https://github.com/DpkRn/LeetCode/tree/master/3455-minimum-length-of-string-after-operations) |
## Backtracking
| |
| ------- |
| [0051-n-queens](https://github.com/DpkRn/LeetCode/tree/master/0051-n-queens) |
## Biconnected Component
| |
| ------- |
| [1300-critical-connections-in-a-network](https://github.com/DpkRn/LeetCode/tree/master/1300-critical-connections-in-a-network) |
## Matrix
| |
| ------- |
| [0054-spiral-matrix](https://github.com/DpkRn/LeetCode/tree/master/0054-spiral-matrix) |
| [0407-trapping-rain-water-ii](https://github.com/DpkRn/LeetCode/tree/master/0407-trapping-rain-water-ii) |
| [0787-sliding-puzzle](https://github.com/DpkRn/LeetCode/tree/master/0787-sliding-puzzle) |
| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/DpkRn/LeetCode/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |
| [1396-count-servers-that-communicate](https://github.com/DpkRn/LeetCode/tree/master/1396-count-servers-that-communicate) |
| [1496-lucky-numbers-in-a-matrix](https://github.com/DpkRn/LeetCode/tree/master/1496-lucky-numbers-in-a-matrix) |
| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/DpkRn/LeetCode/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |
| [1876-map-of-highest-peak](https://github.com/DpkRn/LeetCode/tree/master/1876-map-of-highest-peak) |
| [1972-rotating-the-box](https://github.com/DpkRn/LeetCode/tree/master/1972-rotating-the-box) |
| [2035-count-sub-islands](https://github.com/DpkRn/LeetCode/tree/master/2035-count-sub-islands) |
| [2089-maximum-matrix-sum](https://github.com/DpkRn/LeetCode/tree/master/2089-maximum-matrix-sum) |
| [2132-convert-1d-array-into-2d-array](https://github.com/DpkRn/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |
| [2472-build-a-matrix-with-conditions](https://github.com/DpkRn/LeetCode/tree/master/2472-build-a-matrix-with-conditions) |
## Divide and Conquer
| |
| ------- |
| [0053-maximum-subarray](https://github.com/DpkRn/LeetCode/tree/master/0053-maximum-subarray) |
| [0493-reverse-pairs](https://github.com/DpkRn/LeetCode/tree/master/0493-reverse-pairs) |
| [0948-sort-an-array](https://github.com/DpkRn/LeetCode/tree/master/0948-sort-an-array) |
| [2113-find-the-kth-largest-integer-in-the-array](https://github.com/DpkRn/LeetCode/tree/master/2113-find-the-kth-largest-integer-in-the-array) |
## Heap (Priority Queue)
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/DpkRn/LeetCode/tree/master/0239-sliding-window-maximum) |
| [0264-ugly-number-ii](https://github.com/DpkRn/LeetCode/tree/master/0264-ugly-number-ii) |
| [0407-trapping-rain-water-ii](https://github.com/DpkRn/LeetCode/tree/master/0407-trapping-rain-water-ii) |
| [0789-kth-largest-element-in-a-stream](https://github.com/DpkRn/LeetCode/tree/master/0789-kth-largest-element-in-a-stream) |
| [0948-sort-an-array](https://github.com/DpkRn/LeetCode/tree/master/0948-sort-an-array) |
| [1325-path-with-maximum-probability](https://github.com/DpkRn/LeetCode/tree/master/1325-path-with-maximum-probability) |
| [1917-maximum-average-pass-ratio](https://github.com/DpkRn/LeetCode/tree/master/1917-maximum-average-pass-ratio) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/DpkRn/LeetCode/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2113-find-the-kth-largest-integer-in-the-array](https://github.com/DpkRn/LeetCode/tree/master/2113-find-the-kth-largest-integer-in-the-array) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/DpkRn/LeetCode/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2692-take-gifts-from-the-richest-pile](https://github.com/DpkRn/LeetCode/tree/master/2692-take-gifts-from-the-richest-pile) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/DpkRn/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2803-modify-graph-edge-weights](https://github.com/DpkRn/LeetCode/tree/master/2803-modify-graph-edge-weights) |
| [2868-continuous-subarrays](https://github.com/DpkRn/LeetCode/tree/master/2868-continuous-subarrays) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/DpkRn/LeetCode/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Merge Sort
| |
| ------- |
| [0493-reverse-pairs](https://github.com/DpkRn/LeetCode/tree/master/0493-reverse-pairs) |
| [0948-sort-an-array](https://github.com/DpkRn/LeetCode/tree/master/0948-sort-an-array) |
## Bucket Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/DpkRn/LeetCode/tree/master/0948-sort-an-array) |
## Radix Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/DpkRn/LeetCode/tree/master/0948-sort-an-array) |
## Counting Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/DpkRn/LeetCode/tree/master/0948-sort-an-array) |
| [1396-count-servers-that-communicate](https://github.com/DpkRn/LeetCode/tree/master/1396-count-servers-that-communicate) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/DpkRn/LeetCode/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1786-count-the-number-of-consistent-strings](https://github.com/DpkRn/LeetCode/tree/master/1786-count-the-number-of-consistent-strings) |
| [2163-kth-distinct-string-in-an-array](https://github.com/DpkRn/LeetCode/tree/master/2163-kth-distinct-string-in-an-array) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/DpkRn/LeetCode/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/DpkRn/LeetCode/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/DpkRn/LeetCode/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3455-minimum-length-of-string-after-operations](https://github.com/DpkRn/LeetCode/tree/master/3455-minimum-length-of-string-after-operations) |
## Design
| |
| ------- |
| [0303-range-sum-query-immutable](https://github.com/DpkRn/LeetCode/tree/master/0303-range-sum-query-immutable) |
| [0307-range-sum-query-mutable](https://github.com/DpkRn/LeetCode/tree/master/0307-range-sum-query-mutable) |
| [0432-all-oone-data-structure](https://github.com/DpkRn/LeetCode/tree/master/0432-all-oone-data-structure) |
| [0729-my-calendar-i](https://github.com/DpkRn/LeetCode/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/DpkRn/LeetCode/tree/master/0731-my-calendar-ii) |
| [0789-kth-largest-element-in-a-stream](https://github.com/DpkRn/LeetCode/tree/master/0789-kth-largest-element-in-a-stream) |
| [0859-design-circular-deque](https://github.com/DpkRn/LeetCode/tree/master/0859-design-circular-deque) |
| [1995-finding-pairs-with-a-certain-sum](https://github.com/DpkRn/LeetCode/tree/master/1995-finding-pairs-with-a-certain-sum) |
## Prefix Sum
| |
| ------- |
| [0303-range-sum-query-immutable](https://github.com/DpkRn/LeetCode/tree/master/0303-range-sum-query-immutable) |
| [0731-my-calendar-ii](https://github.com/DpkRn/LeetCode/tree/master/0731-my-calendar-ii) |
| [0966-binary-subarrays-with-sum](https://github.com/DpkRn/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [1046-max-consecutive-ones-iii](https://github.com/DpkRn/LeetCode/tree/master/1046-max-consecutive-ones-iii) |
| [1240-stone-game-ii](https://github.com/DpkRn/LeetCode/tree/master/1240-stone-game-ii) |
| [1370-count-number-of-nice-subarrays](https://github.com/DpkRn/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |
| [1435-xor-queries-of-a-subarray](https://github.com/DpkRn/LeetCode/tree/master/1435-xor-queries-of-a-subarray) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/DpkRn/LeetCode/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1537-maximum-score-after-splitting-a-string](https://github.com/DpkRn/LeetCode/tree/master/1537-maximum-score-after-splitting-a-string) |
| [1694-make-sum-divisible-by-p](https://github.com/DpkRn/LeetCode/tree/master/1694-make-sum-divisible-by-p) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/DpkRn/LeetCode/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/DpkRn/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/DpkRn/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2358-number-of-ways-to-split-array](https://github.com/DpkRn/LeetCode/tree/master/2358-number-of-ways-to-split-array) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/DpkRn/LeetCode/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2691-count-vowel-strings-in-ranges](https://github.com/DpkRn/LeetCode/tree/master/2691-count-vowel-strings-in-ranges) |
## Binary Indexed Tree
| |
| ------- |
| [0307-range-sum-query-mutable](https://github.com/DpkRn/LeetCode/tree/master/0307-range-sum-query-mutable) |
| [0493-reverse-pairs](https://github.com/DpkRn/LeetCode/tree/master/0493-reverse-pairs) |
| [1511-count-number-of-teams](https://github.com/DpkRn/LeetCode/tree/master/1511-count-number-of-teams) |
## Segment Tree
| |
| ------- |
| [0307-range-sum-query-mutable](https://github.com/DpkRn/LeetCode/tree/master/0307-range-sum-query-mutable) |
| [0493-reverse-pairs](https://github.com/DpkRn/LeetCode/tree/master/0493-reverse-pairs) |
| [0729-my-calendar-i](https://github.com/DpkRn/LeetCode/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/DpkRn/LeetCode/tree/master/0731-my-calendar-ii) |
## Ordered Set
| |
| ------- |
| [0456-132-pattern](https://github.com/DpkRn/LeetCode/tree/master/0456-132-pattern) |
| [0493-reverse-pairs](https://github.com/DpkRn/LeetCode/tree/master/0493-reverse-pairs) |
| [0729-my-calendar-i](https://github.com/DpkRn/LeetCode/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/DpkRn/LeetCode/tree/master/0731-my-calendar-ii) |
| [2868-continuous-subarrays](https://github.com/DpkRn/LeetCode/tree/master/2868-continuous-subarrays) |
## Dynamic Programming
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/DpkRn/LeetCode/tree/master/0042-trapping-rain-water) |
| [0053-maximum-subarray](https://github.com/DpkRn/LeetCode/tree/master/0053-maximum-subarray) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/DpkRn/LeetCode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0264-ugly-number-ii](https://github.com/DpkRn/LeetCode/tree/master/0264-ugly-number-ii) |
| [0650-2-keys-keyboard](https://github.com/DpkRn/LeetCode/tree/master/0650-2-keys-keyboard) |
| [0664-strange-printer](https://github.com/DpkRn/LeetCode/tree/master/0664-strange-printer) |
| [1196-filling-bookcase-shelves](https://github.com/DpkRn/LeetCode/tree/master/1196-filling-bookcase-shelves) |
| [1240-stone-game-ii](https://github.com/DpkRn/LeetCode/tree/master/1240-stone-game-ii) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/DpkRn/LeetCode/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [1511-count-number-of-teams](https://github.com/DpkRn/LeetCode/tree/master/1511-count-number-of-teams) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/DpkRn/LeetCode/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [2067-maximum-number-of-points-with-cost](https://github.com/DpkRn/LeetCode/tree/master/2067-maximum-number-of-points-with-cost) |
## Shortest Path
| |
| ------- |
| [1325-path-with-maximum-probability](https://github.com/DpkRn/LeetCode/tree/master/1325-path-with-maximum-probability) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/DpkRn/LeetCode/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [2171-second-minimum-time-to-reach-destination](https://github.com/DpkRn/LeetCode/tree/master/2171-second-minimum-time-to-reach-destination) |
| [2803-modify-graph-edge-weights](https://github.com/DpkRn/LeetCode/tree/master/2803-modify-graph-edge-weights) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/DpkRn/LeetCode/tree/master/3235-minimum-cost-to-convert-string-i) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/DpkRn/LeetCode/tree/master/0014-longest-common-prefix) |
| [0386-lexicographical-numbers](https://github.com/DpkRn/LeetCode/tree/master/0386-lexicographical-numbers) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/DpkRn/LeetCode/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/DpkRn/LeetCode/tree/master/3309-count-prefix-and-suffix-pairs-i) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/DpkRn/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0239-sliding-window-maximum](https://github.com/DpkRn/LeetCode/tree/master/0239-sliding-window-maximum) |
| [0424-longest-repeating-character-replacement](https://github.com/DpkRn/LeetCode/tree/master/0424-longest-repeating-character-replacement) |
| [0567-permutation-in-string](https://github.com/DpkRn/LeetCode/tree/master/0567-permutation-in-string) |
| [0966-binary-subarrays-with-sum](https://github.com/DpkRn/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [1046-max-consecutive-ones-iii](https://github.com/DpkRn/LeetCode/tree/master/1046-max-consecutive-ones-iii) |
| [1370-count-number-of-nice-subarrays](https://github.com/DpkRn/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |
| [1755-defuse-the-bomb](https://github.com/DpkRn/LeetCode/tree/master/1755-defuse-the-bomb) |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/DpkRn/LeetCode/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/DpkRn/LeetCode/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |
| [2599-take-k-of-each-character-from-left-and-right](https://github.com/DpkRn/LeetCode/tree/master/2599-take-k-of-each-character-from-left-and-right) |
| [2868-continuous-subarrays](https://github.com/DpkRn/LeetCode/tree/master/2868-continuous-subarrays) |
| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/DpkRn/LeetCode/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/DpkRn/LeetCode/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/DpkRn/LeetCode/tree/master/3522-find-the-power-of-k-size-subarrays-i) |
## Binary Search Tree
| |
| ------- |
| [0789-kth-largest-element-in-a-stream](https://github.com/DpkRn/LeetCode/tree/master/0789-kth-largest-element-in-a-stream) |
## Data Stream
| |
| ------- |
| [0789-kth-largest-element-in-a-stream](https://github.com/DpkRn/LeetCode/tree/master/0789-kth-largest-element-in-a-stream) |
## Rolling Hash
| |
| ------- |
| [0214-shortest-palindrome](https://github.com/DpkRn/LeetCode/tree/master/0214-shortest-palindrome) |
| [1508-longest-happy-prefix](https://github.com/DpkRn/LeetCode/tree/master/1508-longest-happy-prefix) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/DpkRn/LeetCode/tree/master/3309-count-prefix-and-suffix-pairs-i) |
## String Matching
| |
| ------- |
| [0214-shortest-palindrome](https://github.com/DpkRn/LeetCode/tree/master/0214-shortest-palindrome) |
| [1508-longest-happy-prefix](https://github.com/DpkRn/LeetCode/tree/master/1508-longest-happy-prefix) |
| [1524-string-matching-in-an-array](https://github.com/DpkRn/LeetCode/tree/master/1524-string-matching-in-an-array) |
| [2292-counting-words-with-a-given-prefix](https://github.com/DpkRn/LeetCode/tree/master/2292-counting-words-with-a-given-prefix) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/DpkRn/LeetCode/tree/master/3309-count-prefix-and-suffix-pairs-i) |
## Hash Function
| |
| ------- |
| [0214-shortest-palindrome](https://github.com/DpkRn/LeetCode/tree/master/0214-shortest-palindrome) |
| [1508-longest-happy-prefix](https://github.com/DpkRn/LeetCode/tree/master/1508-longest-happy-prefix) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/DpkRn/LeetCode/tree/master/3309-count-prefix-and-suffix-pairs-i) |
## Game Theory
| |
| ------- |
| [1240-stone-game-ii](https://github.com/DpkRn/LeetCode/tree/master/1240-stone-game-ii) |
## Bit Manipulation
| |
| ------- |
| [0268-missing-number](https://github.com/DpkRn/LeetCode/tree/master/0268-missing-number) |
| [0476-number-complement](https://github.com/DpkRn/LeetCode/tree/master/0476-number-complement) |
| [1435-xor-queries-of-a-subarray](https://github.com/DpkRn/LeetCode/tree/master/1435-xor-queries-of-a-subarray) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/DpkRn/LeetCode/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1786-count-the-number-of-consistent-strings](https://github.com/DpkRn/LeetCode/tree/master/1786-count-the-number-of-consistent-strings) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/DpkRn/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2323-minimum-bit-flips-to-convert-number](https://github.com/DpkRn/LeetCode/tree/master/2323-minimum-bit-flips-to-convert-number) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/DpkRn/LeetCode/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [2509-minimize-xor](https://github.com/DpkRn/LeetCode/tree/master/2509-minimize-xor) |
| [2533-bitwise-xor-of-all-pairings](https://github.com/DpkRn/LeetCode/tree/master/2533-bitwise-xor-of-all-pairings) |
| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/DpkRn/LeetCode/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |
| [2792-neighboring-bitwise-xor](https://github.com/DpkRn/LeetCode/tree/master/2792-neighboring-bitwise-xor) |
## Number Theory
| |
| ------- |
| [2301-count-array-pairs-divisible-by-k](https://github.com/DpkRn/LeetCode/tree/master/2301-count-array-pairs-divisible-by-k) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/DpkRn/LeetCode/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
## Brainteaser
| |
| ------- |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/DpkRn/LeetCode/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [2533-bitwise-xor-of-all-pairings](https://github.com/DpkRn/LeetCode/tree/master/2533-bitwise-xor-of-all-pairings) |
## Doubly-Linked List
| |
| ------- |
| [0432-all-oone-data-structure](https://github.com/DpkRn/LeetCode/tree/master/0432-all-oone-data-structure) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/DpkRn/LeetCode/tree/master/0042-trapping-rain-water) |
| [0402-remove-k-digits](https://github.com/DpkRn/LeetCode/tree/master/0402-remove-k-digits) |
| [0456-132-pattern](https://github.com/DpkRn/LeetCode/tree/master/0456-132-pattern) |
| [0496-next-greater-element-i](https://github.com/DpkRn/LeetCode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/DpkRn/LeetCode/tree/master/0503-next-greater-element-ii) |
| [1002-maximum-width-ramp](https://github.com/DpkRn/LeetCode/tree/master/1002-maximum-width-ramp) |
## Monotonic Queue
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/DpkRn/LeetCode/tree/master/0239-sliding-window-maximum) |
| [2868-continuous-subarrays](https://github.com/DpkRn/LeetCode/tree/master/2868-continuous-subarrays) |
## Quickselect
| |
| ------- |
| [2113-find-the-kth-largest-integer-in-the-array](https://github.com/DpkRn/LeetCode/tree/master/2113-find-the-kth-largest-integer-in-the-array) |