DSA_Answers

KO | EN

gitlite — search

#hacktoberfest #react #llm #go #machine-learning #rust #linux #macos #nodejs #windows #awesome-list #security #ios #mcp

(★ 16)

A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)

DSA_Answers 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# DSA_Answers
A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)

# LeetCode Topics
## Stack
|  |
| ------- |
| [0071-simplify-path](https://github.com/iceeyyy/DSA_Answers/tree/master/0071-simplify-path) |
| [0094-binary-tree-inorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0094-binary-tree-inorder-traversal) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/iceeyyy/DSA_Answers/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0144-binary-tree-preorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0145-binary-tree-postorder-traversal) |
| [0173-binary-search-tree-iterator](https://github.com/iceeyyy/DSA_Answers/tree/master/0173-binary-search-tree-iterator) |
| [0682-baseball-game](https://github.com/iceeyyy/DSA_Answers/tree/master/0682-baseball-game) |
| [0735-asteroid-collision](https://github.com/iceeyyy/DSA_Answers/tree/master/0735-asteroid-collision) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/iceeyyy/DSA_Answers/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1081-smallest-subsequence-of-distinct-characters](https://github.com/iceeyyy/DSA_Answers/tree/master/1081-smallest-subsequence-of-distinct-characters) |
| [1197-parsing-a-boolean-expression](https://github.com/iceeyyy/DSA_Answers/tree/master/1197-parsing-a-boolean-expression) |
| [1628-count-submatrices-with-all-ones](https://github.com/iceeyyy/DSA_Answers/tree/master/1628-count-submatrices-with-all-ones) |
| [1653-minimum-deletions-to-make-string-balanced](https://github.com/iceeyyy/DSA_Answers/tree/master/1653-minimum-deletions-to-make-string-balanced) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/iceeyyy/DSA_Answers/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
| [1818-maximum-score-from-removing-substrings](https://github.com/iceeyyy/DSA_Answers/tree/master/1818-maximum-score-from-removing-substrings) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/iceeyyy/DSA_Answers/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2307-replace-non-coprime-numbers-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/2307-replace-non-coprime-numbers-in-array) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/iceeyyy/DSA_Answers/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3445-lexicographically-minimum-string-after-removing-stars](https://github.com/iceeyyy/DSA_Answers/tree/master/3445-lexicographically-minimum-string-after-removing-stars) |
| [3447-clear-digits](https://github.com/iceeyyy/DSA_Answers/tree/master/3447-clear-digits) |
| [3834-minimum-operations-to-convert-all-elements-to-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/3834-minimum-operations-to-convert-all-elements-to-zero) |
## Tree
|  |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0110-balanced-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0110-balanced-binary-tree) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/iceeyyy/DSA_Answers/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0124-binary-tree-maximum-path-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0124-binary-tree-maximum-path-sum) |
| [0144-binary-tree-preorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0145-binary-tree-postorder-traversal) |
| [0173-binary-search-tree-iterator](https://github.com/iceeyyy/DSA_Answers/tree/master/0173-binary-search-tree-iterator) |
| [0199-binary-tree-right-side-view](https://github.com/iceeyyy/DSA_Answers/tree/master/0199-binary-tree-right-side-view) |
| [0222-count-complete-tree-nodes](https://github.com/iceeyyy/DSA_Answers/tree/master/0222-count-complete-tree-nodes) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0450-delete-node-in-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0450-delete-node-in-a-bst) |
| [0530-minimum-absolute-difference-in-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0530-minimum-absolute-difference-in-bst) |
| [0543-diameter-of-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0543-diameter-of-binary-tree) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0662-maximum-width-of-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0662-maximum-width-of-binary-tree) |
| [0783-search-in-a-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0784-insert-into-a-binary-search-tree) |
| [0865-smallest-subtree-with-all-the-deepest-nodes](https://github.com/iceeyyy/DSA_Answers/tree/master/0865-smallest-subtree-with-all-the-deepest-nodes) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [2196-create-binary-tree-from-descriptions](https://github.com/iceeyyy/DSA_Answers/tree/master/2196-create-binary-tree-from-descriptions) |
| [2400-minimum-score-after-removals-on-a-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/2400-minimum-score-after-removals-on-a-tree) |
| [3633-maximize-the-number-of-target-nodes-after-connecting-trees-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i) |
| [3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii) |
## Depth-First Search
|  |
| ------- |
| [0079-word-search](https://github.com/iceeyyy/DSA_Answers/tree/master/0079-word-search) |
| [0094-binary-tree-inorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0110-balanced-binary-tree) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/iceeyyy/DSA_Answers/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0124-binary-tree-maximum-path-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0124-binary-tree-maximum-path-sum) |
| [0130-surrounded-regions](https://github.com/iceeyyy/DSA_Answers/tree/master/0130-surrounded-regions) |
| [0144-binary-tree-preorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0145-binary-tree-postorder-traversal) |
| [0199-binary-tree-right-side-view](https://github.com/iceeyyy/DSA_Answers/tree/master/0199-binary-tree-right-side-view) |
| [0200-number-of-islands](https://github.com/iceeyyy/DSA_Answers/tree/master/0200-number-of-islands) |
| [0207-course-schedule](https://github.com/iceeyyy/DSA_Answers/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0210-course-schedule-ii) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0386-lexicographical-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/0386-lexicographical-numbers) |
| [0417-pacific-atlantic-water-flow](https://github.com/iceeyyy/DSA_Answers/tree/master/0417-pacific-atlantic-water-flow) |
| [0530-minimum-absolute-difference-in-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0530-minimum-absolute-difference-in-bst) |
| [0543-diameter-of-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0543-diameter-of-binary-tree) |
| [0547-number-of-provinces](https://github.com/iceeyyy/DSA_Answers/tree/master/0547-number-of-provinces) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0662-maximum-width-of-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0662-maximum-width-of-binary-tree) |
| [0695-max-area-of-island](https://github.com/iceeyyy/DSA_Answers/tree/master/0695-max-area-of-island) |
| [0721-accounts-merge](https://github.com/iceeyyy/DSA_Answers/tree/master/0721-accounts-merge) |
| [0733-flood-fill](https://github.com/iceeyyy/DSA_Answers/tree/master/0733-flood-fill) |
| [0744-network-delay-time](https://github.com/iceeyyy/DSA_Answers/tree/master/0744-network-delay-time) |
| [0794-swim-in-rising-water](https://github.com/iceeyyy/DSA_Answers/tree/master/0794-swim-in-rising-water) |
| [0801-is-graph-bipartite](https://github.com/iceeyyy/DSA_Answers/tree/master/0801-is-graph-bipartite) |
| [0803-cheapest-flights-within-k-stops](https://github.com/iceeyyy/DSA_Answers/tree/master/0803-cheapest-flights-within-k-stops) |
| [0820-find-eventual-safe-states](https://github.com/iceeyyy/DSA_Answers/tree/master/0820-find-eventual-safe-states) |
| [0854-making-a-large-island](https://github.com/iceeyyy/DSA_Answers/tree/master/0854-making-a-large-island) |
| [0865-smallest-subtree-with-all-the-deepest-nodes](https://github.com/iceeyyy/DSA_Answers/tree/master/0865-smallest-subtree-with-all-the-deepest-nodes) |
| [0871-keys-and-rooms](https://github.com/iceeyyy/DSA_Answers/tree/master/0871-keys-and-rooms) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/iceeyyy/DSA_Answers/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1073-number-of-enclaves](https://github.com/iceeyyy/DSA_Answers/tree/master/1073-number-of-enclaves) |
| [1300-critical-connections-in-a-network](https://github.com/iceeyyy/DSA_Answers/tree/master/1300-critical-connections-in-a-network) |
| [1306-jump-game-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/1306-jump-game-iii) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/iceeyyy/DSA_Answers/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/iceeyyy/DSA_Answers/tree/master/1442-number-of-operations-to-make-network-connected) |
| [1559-detect-cycles-in-2d-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/1559-detect-cycles-in-2d-grid) |
| [1747-lexicographically-smallest-string-after-applying-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/1747-lexicographically-smallest-string-after-applying-operations) |
| [1753-path-with-minimum-effort](https://github.com/iceeyyy/DSA_Answers/tree/master/1753-path-with-minimum-effort) |
| [2121-find-if-path-exists-in-graph](https://github.com/iceeyyy/DSA_Answers/tree/master/2121-find-if-path-exists-in-graph) |
| [2400-minimum-score-after-removals-on-a-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/2400-minimum-score-after-removals-on-a-tree) |
| [2438-find-closest-node-to-given-two-nodes](https://github.com/iceeyyy/DSA_Answers/tree/master/2438-find-closest-node-to-given-two-nodes) |
| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/iceeyyy/DSA_Answers/tree/master/2492-minimum-score-of-a-path-between-two-cities) |
| [3633-maximize-the-number-of-target-nodes-after-connecting-trees-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i) |
| [3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii) |
| [3863-power-grid-maintenance](https://github.com/iceeyyy/DSA_Answers/tree/master/3863-power-grid-maintenance) |
## Binary Tree
|  |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0110-balanced-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0110-balanced-binary-tree) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/iceeyyy/DSA_Answers/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0124-binary-tree-maximum-path-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0124-binary-tree-maximum-path-sum) |
| [0144-binary-tree-preorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0145-binary-tree-postorder-traversal) |
| [0173-binary-search-tree-iterator](https://github.com/iceeyyy/DSA_Answers/tree/master/0173-binary-search-tree-iterator) |
| [0199-binary-tree-right-side-view](https://github.com/iceeyyy/DSA_Answers/tree/master/0199-binary-tree-right-side-view) |
| [0222-count-complete-tree-nodes](https://github.com/iceeyyy/DSA_Answers/tree/master/0222-count-complete-tree-nodes) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0450-delete-node-in-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0450-delete-node-in-a-bst) |
| [0530-minimum-absolute-difference-in-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0530-minimum-absolute-difference-in-bst) |
| [0543-diameter-of-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0543-diameter-of-binary-tree) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0662-maximum-width-of-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0662-maximum-width-of-binary-tree) |
| [0783-search-in-a-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0784-insert-into-a-binary-search-tree) |
| [0865-smallest-subtree-with-all-the-deepest-nodes](https://github.com/iceeyyy/DSA_Answers/tree/master/0865-smallest-subtree-with-all-the-deepest-nodes) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [2196-create-binary-tree-from-descriptions](https://github.com/iceeyyy/DSA_Answers/tree/master/2196-create-binary-tree-from-descriptions) |
## Breadth-First Search
|  |
| ------- |
| [0100-same-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0104-maximum-depth-of-binary-tree) |
| [0127-word-ladder](https://github.com/iceeyyy/DSA_Answers/tree/master/0127-word-ladder) |
| [0130-surrounded-regions](https://github.com/iceeyyy/DSA_Answers/tree/master/0130-surrounded-regions) |
| [0199-binary-tree-right-side-view](https://github.com/iceeyyy/DSA_Answers/tree/master/0199-binary-tree-right-side-view) |
| [0200-number-of-islands](https://github.com/iceeyyy/DSA_Answers/tree/master/0200-number-of-islands) |
| [0207-course-schedule](https://github.com/iceeyyy/DSA_Answers/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0210-course-schedule-ii) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0322-coin-change](https://github.com/iceeyyy/DSA_Answers/tree/master/0322-coin-change) |
| [0407-trapping-rain-water-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0407-trapping-rain-water-ii) |
| [0417-pacific-atlantic-water-flow](https://github.com/iceeyyy/DSA_Answers/tree/master/0417-pacific-atlantic-water-flow) |
| [0530-minimum-absolute-difference-in-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0530-minimum-absolute-difference-in-bst) |
| [0542-01-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/0542-01-matrix) |
| [0547-number-of-provinces](https://github.com/iceeyyy/DSA_Answers/tree/master/0547-number-of-provinces) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0662-maximum-width-of-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0662-maximum-width-of-binary-tree) |
| [0695-max-area-of-island](https://github.com/iceeyyy/DSA_Answers/tree/master/0695-max-area-of-island) |
| [0721-accounts-merge](https://github.com/iceeyyy/DSA_Answers/tree/master/0721-accounts-merge) |
| [0733-flood-fill](https://github.com/iceeyyy/DSA_Answers/tree/master/0733-flood-fill) |
| [0744-network-delay-time](https://github.com/iceeyyy/DSA_Answers/tree/master/0744-network-delay-time) |
| [0794-swim-in-rising-water](https://github.com/iceeyyy/DSA_Answers/tree/master/0794-swim-in-rising-water) |
| [0801-is-graph-bipartite](https://github.com/iceeyyy/DSA_Answers/tree/master/0801-is-graph-bipartite) |
| [0803-cheapest-flights-within-k-stops](https://github.com/iceeyyy/DSA_Answers/tree/master/0803-cheapest-flights-within-k-stops) |
| [0820-find-eventual-safe-states](https://github.com/iceeyyy/DSA_Answers/tree/master/0820-find-eventual-safe-states) |
| [0854-making-a-large-island](https://github.com/iceeyyy/DSA_Answers/tree/master/0854-making-a-large-island) |
| [0865-smallest-subtree-with-all-the-deepest-nodes](https://github.com/iceeyyy/DSA_Answers/tree/master/0865-smallest-subtree-with-all-the-deepest-nodes) |
| [0871-keys-and-rooms](https://github.com/iceeyyy/DSA_Answers/tree/master/0871-keys-and-rooms) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1036-rotting-oranges](https://github.com/iceeyyy/DSA_Answers/tree/master/1036-rotting-oranges) |
| [1073-number-of-enclaves](https://github.com/iceeyyy/DSA_Answers/tree/master/1073-number-of-enclaves) |
| [1171-shortest-path-in-binary-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/1171-shortest-path-in-binary-matrix) |
| [1306-jump-game-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/1306-jump-game-iii) |
| [1424-maximum-candies-you-can-get-from-boxes](https://github.com/iceeyyy/DSA_Answers/tree/master/1424-maximum-candies-you-can-get-from-boxes) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/iceeyyy/DSA_Answers/tree/master/1442-number-of-operations-to-make-network-connected) |
| [1559-detect-cycles-in-2d-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/1559-detect-cycles-in-2d-grid) |
| [1747-lexicographically-smallest-string-after-applying-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/1747-lexicographically-smallest-string-after-applying-operations) |
| [1753-path-with-minimum-effort](https://github.com/iceeyyy/DSA_Answers/tree/master/1753-path-with-minimum-effort) |
| [2038-nearest-exit-from-entrance-in-maze](https://github.com/iceeyyy/DSA_Answers/tree/master/2038-nearest-exit-from-entrance-in-maze) |
| [2121-find-if-path-exists-in-graph](https://github.com/iceeyyy/DSA_Answers/tree/master/2121-find-if-path-exists-in-graph) |
| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/iceeyyy/DSA_Answers/tree/master/2492-minimum-score-of-a-path-between-two-cities) |
| [2812-find-the-safest-path-in-a-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/2812-find-the-safest-path-in-a-grid) |
| [3629-minimum-jumps-to-reach-end-via-prime-teleportation](https://github.com/iceeyyy/DSA_Answers/tree/master/3629-minimum-jumps-to-reach-end-via-prime-teleportation) |
| [3633-maximize-the-number-of-target-nodes-after-connecting-trees-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i) |
| [3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii) |
| [3863-power-grid-maintenance](https://github.com/iceeyyy/DSA_Answers/tree/master/3863-power-grid-maintenance) |
## Dynamic Programming
|  |
| ------- |
| [0044-wildcard-matching](https://github.com/iceeyyy/DSA_Answers/tree/master/0044-wildcard-matching) |
| [0053-maximum-subarray](https://github.com/iceeyyy/DSA_Answers/tree/master/0053-maximum-subarray) |
| [0055-jump-game](https://github.com/iceeyyy/DSA_Answers/tree/master/0055-jump-game) |
| [0062-unique-paths](https://github.com/iceeyyy/DSA_Answers/tree/master/0062-unique-paths) |
| [0063-unique-paths-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0064-minimum-path-sum) |
| [0070-climbing-stairs](https://github.com/iceeyyy/DSA_Answers/tree/master/0070-climbing-stairs) |
| [0072-edit-distance](https://github.com/iceeyyy/DSA_Answers/tree/master/0072-edit-distance) |
| [0115-distinct-subsequences](https://github.com/iceeyyy/DSA_Answers/tree/master/0115-distinct-subsequences) |
| [0118-pascals-triangle](https://github.com/iceeyyy/DSA_Answers/tree/master/0118-pascals-triangle) |
| [0120-triangle](https://github.com/iceeyyy/DSA_Answers/tree/master/0120-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/iceeyyy/DSA_Answers/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |
| [0124-binary-tree-maximum-path-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0124-binary-tree-maximum-path-sum) |
| [0131-palindrome-partitioning](https://github.com/iceeyyy/DSA_Answers/tree/master/0131-palindrome-partitioning) |
| [0132-palindrome-partitioning-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0132-palindrome-partitioning-ii) |
| [0188-best-time-to-buy-and-sell-stock-iv](https://github.com/iceeyyy/DSA_Answers/tree/master/0188-best-time-to-buy-and-sell-stock-iv) |
| [0198-house-robber](https://github.com/iceeyyy/DSA_Answers/tree/master/0198-house-robber) |
| [0213-house-robber-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0213-house-robber-ii) |
| [0300-longest-increasing-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0300-longest-increasing-subsequence) |
| [0309-best-time-to-buy-and-sell-stock-with-cooldown](https://github.com/iceeyyy/DSA_Answers/tree/master/0309-best-time-to-buy-and-sell-stock-with-cooldown) |
| [0312-burst-balloons](https://github.com/iceeyyy/DSA_Answers/tree/master/0312-burst-balloons) |
| [0322-coin-change](https://github.com/iceeyyy/DSA_Answers/tree/master/0322-coin-change) |
| [0368-largest-divisible-subset](https://github.com/iceeyyy/DSA_Answers/tree/master/0368-largest-divisible-subset) |
| [0392-is-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0392-is-subsequence) |
| [0416-partition-equal-subset-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0416-partition-equal-subset-sum) |
| [0474-ones-and-zeroes](https://github.com/iceeyyy/DSA_Answers/tree/master/0474-ones-and-zeroes) |
| [0494-target-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0494-target-sum) |
| [0516-longest-palindromic-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0516-longest-palindromic-subsequence) |
| [0518-coin-change-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0518-coin-change-ii) |
| [0542-01-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/0542-01-matrix) |
| [0583-delete-operation-for-two-strings](https://github.com/iceeyyy/DSA_Answers/tree/master/0583-delete-operation-for-two-strings) |
| [0673-number-of-longest-increasing-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0673-number-of-longest-increasing-subsequence) |
| [0714-best-time-to-buy-and-sell-stock-with-transaction-fee](https://github.com/iceeyyy/DSA_Answers/tree/master/0714-best-time-to-buy-and-sell-stock-with-transaction-fee) |
| [0747-min-cost-climbing-stairs](https://github.com/iceeyyy/DSA_Answers/tree/master/0747-min-cost-climbing-stairs) |
| [0803-cheapest-flights-within-k-stops](https://github.com/iceeyyy/DSA_Answers/tree/master/0803-cheapest-flights-within-k-stops) |
| [0875-longest-mountain-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0875-longest-mountain-in-array) |
| [0967-minimum-falling-path-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0967-minimum-falling-path-sum) |
| [1013-fibonacci-number](https://github.com/iceeyyy/DSA_Answers/tree/master/1013-fibonacci-number) |
| [1111-minimum-score-triangulation-of-polygon](https://github.com/iceeyyy/DSA_Answers/tree/master/1111-minimum-score-triangulation-of-polygon) |
| [1121-partition-array-for-maximum-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/1121-partition-array-for-maximum-sum) |
| [1129-longest-string-chain](https://github.com/iceeyyy/DSA_Answers/tree/master/1129-longest-string-chain) |
| [1170-shortest-common-supersequence](https://github.com/iceeyyy/DSA_Answers/tree/master/1170-shortest-common-supersequence) |
| [1250-longest-common-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/1250-longest-common-subsequence) |
| [1262-greatest-sum-divisible-by-three](https://github.com/iceeyyy/DSA_Answers/tree/master/1262-greatest-sum-divisible-by-three) |
| [1320-minimum-distance-to-type-a-word-using-two-fingers](https://github.com/iceeyyy/DSA_Answers/tree/master/1320-minimum-distance-to-type-a-word-using-two-fingers) |
| [1340-jump-game-v](https://github.com/iceeyyy/DSA_Answers/tree/master/1340-jump-game-v) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/iceeyyy/DSA_Answers/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1437-minimum-insertion-steps-to-make-a-string-palindrome](https://github.com/iceeyyy/DSA_Answers/tree/master/1437-minimum-insertion-steps-to-make-a-string-palindrome) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/iceeyyy/DSA_Answers/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/iceeyyy/DSA_Answers/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1628-count-submatrices-with-all-ones](https://github.com/iceeyyy/DSA_Answers/tree/master/1628-count-submatrices-with-all-ones) |
| [1653-minimum-deletions-to-make-string-balanced](https://github.com/iceeyyy/DSA_Answers/tree/master/1653-minimum-deletions-to-make-string-balanced) |
| [1669-minimum-cost-to-cut-a-stick](https://github.com/iceeyyy/DSA_Answers/tree/master/1669-minimum-cost-to-cut-a-stick) |
| [1700-minimum-time-to-make-rope-colorful](https://github.com/iceeyyy/DSA_Answers/tree/master/1700-minimum-time-to-make-rope-colorful) |
| [1732-minimum-one-bit-operations-to-make-integers-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/1732-minimum-one-bit-operations-to-make-integers-zero) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [1871-jump-game-vii](https://github.com/iceeyyy/DSA_Answers/tree/master/1871-jump-game-vii) |
| [1888-minimum-number-of-flips-to-make-the-binary-string-alternating](https://github.com/iceeyyy/DSA_Answers/tree/master/1888-minimum-number-of-flips-to-make-the-binary-string-alternating) |
| [2028-the-earliest-and-latest-rounds-where-players-compete](https://github.com/iceeyyy/DSA_Answers/tree/master/2028-the-earliest-and-latest-rounds-where-players-compete) |
| [2110-number-of-smooth-descent-periods-of-a-stock](https://github.com/iceeyyy/DSA_Answers/tree/master/2110-number-of-smooth-descent-periods-of-a-stock) |
| [2147-number-of-ways-to-divide-a-long-corridor](https://github.com/iceeyyy/DSA_Answers/tree/master/2147-number-of-ways-to-divide-a-long-corridor) |
| [2267-minimum-difference-in-sums-after-removal-of-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/2267-minimum-difference-in-sums-after-removal-of-elements) |
| [2395-longest-binary-subsequence-less-than-or-equal-to-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2395-longest-binary-subsequence-less-than-or-equal-to-k) |
| [2408-number-of-people-aware-of-a-secret](https://github.com/iceeyyy/DSA_Answers/tree/master/2408-number-of-people-aware-of-a-secret) |
| [2435-paths-in-matrix-whose-sum-is-divisible-by-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2435-paths-in-matrix-whose-sum-is-divisible-by-k) |
| [2770-maximum-number-of-jumps-to-reach-the-last-index](https://github.com/iceeyyy/DSA_Answers/tree/master/2770-maximum-number-of-jumps-to-reach-the-last-index) |
| [2882-ways-to-express-an-integer-as-sum-of-powers](https://github.com/iceeyyy/DSA_Answers/tree/master/2882-ways-to-express-an-integer-as-sum-of-powers) |
| [3233-maximize-the-number-of-partitions-after-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/3233-maximize-the-number-of-partitions-after-operations) |
| [3418-maximum-amount-of-money-robot-can-earn](https://github.com/iceeyyy/DSA_Answers/tree/master/3418-maximum-amount-of-money-robot-can-earn) |
| [3437-maximum-total-damage-with-spell-casting](https://github.com/iceeyyy/DSA_Answers/tree/master/3437-maximum-total-damage-with-spell-casting) |
| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |
| [3491-find-the-maximum-length-of-valid-subsequence-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3491-find-the-maximum-length-of-valid-subsequence-ii) |
| [3618-find-the-original-typed-string-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3618-find-the-original-typed-string-ii) |
| [3648-find-the-maximum-number-of-fruits-collected](https://github.com/iceeyyy/DSA_Answers/tree/master/3648-find-the-maximum-number-of-fruits-collected) |
| [3733-length-of-longest-v-shaped-diagonal-segment](https://github.com/iceeyyy/DSA_Answers/tree/master/3733-length-of-longest-v-shaped-diagonal-segment) |
| [3751-total-waviness-of-numbers-in-range-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3751-total-waviness-of-numbers-in-range-i) |
| [3753-total-waviness-of-numbers-in-range-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3753-total-waviness-of-numbers-in-range-ii) |
| [3851-find-sum-of-array-product-of-magical-sequences](https://github.com/iceeyyy/DSA_Answers/tree/master/3851-find-sum-of-array-product-of-magical-sequences) |
## Hash Table
|  |
| ------- |
| [0001-two-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0001-two-sum) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/iceeyyy/DSA_Answers/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0036-valid-sudoku](https://github.com/iceeyyy/DSA_Answers/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/iceeyyy/DSA_Answers/tree/master/0037-sudoku-solver) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0127-word-ladder](https://github.com/iceeyyy/DSA_Answers/tree/master/0127-word-ladder) |
| [0166-fraction-to-recurring-decimal](https://github.com/iceeyyy/DSA_Answers/tree/master/0166-fraction-to-recurring-decimal) |
| [0205-isomorphic-strings](https://github.com/iceeyyy/DSA_Answers/tree/master/0205-isomorphic-strings) |
| [0208-implement-trie-prefix-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0208-implement-trie-prefix-tree) |
| [0217-contains-duplicate](https://github.com/iceeyyy/DSA_Answers/tree/master/0217-contains-duplicate) |
| [0347-top-k-frequent-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/0347-top-k-frequent-elements) |
| [0421-maximum-xor-of-two-numbers-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0421-maximum-xor-of-two-numbers-in-an-array) |
| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0448-find-all-numbers-disappeared-in-an-array) |
| [0451-sort-characters-by-frequency](https://github.com/iceeyyy/DSA_Answers/tree/master/0451-sort-characters-by-frequency) |
| [0594-longest-harmonious-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0594-longest-harmonious-subsequence) |
| [0621-task-scheduler](https://github.com/iceeyyy/DSA_Answers/tree/master/0621-task-scheduler) |
| [0645-set-mismatch](https://github.com/iceeyyy/DSA_Answers/tree/master/0645-set-mismatch) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0721-accounts-merge](https://github.com/iceeyyy/DSA_Answers/tree/master/0721-accounts-merge) |
| [0782-jewels-and-stones](https://github.com/iceeyyy/DSA_Answers/tree/master/0782-jewels-and-stones) |
| [0865-smallest-subtree-with-all-the-deepest-nodes](https://github.com/iceeyyy/DSA_Answers/tree/master/0865-smallest-subtree-with-all-the-deepest-nodes) |
| [0874-walking-robot-simulation](https://github.com/iceeyyy/DSA_Answers/tree/master/0874-walking-robot-simulation) |
| [0876-hand-of-straights](https://github.com/iceeyyy/DSA_Answers/tree/master/0876-hand-of-straights) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [0900-reordered-power-of-2](https://github.com/iceeyyy/DSA_Answers/tree/master/0900-reordered-power-of-2) |
| [0940-fruit-into-baskets](https://github.com/iceeyyy/DSA_Answers/tree/master/0940-fruit-into-baskets) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/iceeyyy/DSA_Answers/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1006-vowel-spellchecker](https://github.com/iceeyyy/DSA_Answers/tree/master/1006-vowel-spellchecker) |
| [1015-smallest-integer-divisible-by-k](https://github.com/iceeyyy/DSA_Answers/tree/master/1015-smallest-integer-divisible-by-k) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1129-longest-string-chain](https://github.com/iceeyyy/DSA_Answers/tree/master/1129-longest-string-chain) |
| [1160-letter-tile-possibilities](https://github.com/iceeyyy/DSA_Answers/tree/master/1160-letter-tile-possibilities) |
| [1264-maximum-number-of-words-you-can-type](https://github.com/iceeyyy/DSA_Answers/tree/master/1264-maximum-number-of-words-you-can-type) |
| [1297-maximum-number-of-balloons](https://github.com/iceeyyy/DSA_Answers/tree/master/1297-maximum-number-of-balloons) |
| [1319-unique-number-of-occurrences](https://github.com/iceeyyy/DSA_Answers/tree/master/1319-unique-number-of-occurrences) |
| [1353-find-resultant-array-after-removing-anagrams](https://github.com/iceeyyy/DSA_Answers/tree/master/1353-find-resultant-array-after-removing-anagrams) |
| [1364-tuple-with-same-product](https://github.com/iceeyyy/DSA_Answers/tree/master/1364-tuple-with-same-product) |
| [1392-find-the-difference-of-two-arrays](https://github.com/iceeyyy/DSA_Answers/tree/master/1392-find-the-difference-of-two-arrays) |
| [1461-check-if-a-string-contains-all-binary-codes-of-size-k](https://github.com/iceeyyy/DSA_Answers/tree/master/1461-check-if-a-string-contains-all-binary-codes-of-size-k) |
| [1510-find-lucky-integer-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1510-find-lucky-integer-in-an-array) |
| [1590-make-sum-divisible-by-p](https://github.com/iceeyyy/DSA_Answers/tree/master/1590-make-sum-divisible-by-p) |
| [1612-avoid-flood-in-the-city](https://github.com/iceeyyy/DSA_Answers/tree/master/1612-avoid-flood-in-the-city) |
| [1781-sum-of-beauty-of-all-substrings](https://github.com/iceeyyy/DSA_Answers/tree/master/1781-sum-of-beauty-of-all-substrings) |
| [1813-maximum-erasure-value](https://github.com/iceeyyy/DSA_Answers/tree/master/1813-maximum-erasure-value) |
| [1834-minimum-number-of-people-to-teach](https://github.com/iceeyyy/DSA_Answers/tree/master/1834-minimum-number-of-people-to-teach) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/iceeyyy/DSA_Answers/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [1930-unique-length-3-palindromic-subsequences](https://github.com/iceeyyy/DSA_Answers/tree/master/1930-unique-length-3-palindromic-subsequences) |
| [1980-find-unique-binary-string](https://github.com/iceeyyy/DSA_Answers/tree/master/1980-find-unique-binary-string) |
| [1995-finding-pairs-with-a-certain-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/1995-finding-pairs-with-a-certain-sum) |
| [2023-design-movie-rental-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2023-design-movie-rental-system) |
| [2169-simple-bank-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2169-simple-bank-system) |
| [2174-next-greater-numerically-balanced-number](https://github.com/iceeyyy/DSA_Answers/tree/master/2174-next-greater-numerically-balanced-number) |
| [2196-create-binary-tree-from-descriptions](https://github.com/iceeyyy/DSA_Answers/tree/master/2196-create-binary-tree-from-descriptions) |
| [2204-find-subsequence-of-length-k-with-the-largest-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/2204-find-subsequence-of-length-k-with-the-largest-sum) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/iceeyyy/DSA_Answers/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |
| [2274-keep-multiplying-found-values-by-two](https://github.com/iceeyyy/DSA_Answers/tree/master/2274-keep-multiplying-found-values-by-two) |
| [2429-design-a-food-rating-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2429-design-a-food-rating-system) |
| [2434-design-a-number-container-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2434-design-a-number-container-system) |
| [2448-count-number-of-bad-pairs](https://github.com/iceeyyy/DSA_Answers/tree/master/2448-count-number-of-bad-pairs) |
| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/iceeyyy/DSA_Answers/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |
| [2479-meeting-rooms-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/2479-meeting-rooms-iii) |
| [2661-smallest-missing-non-negative-integer-after-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/2661-smallest-missing-non-negative-integer-after-operations) |
| [2689-rearranging-fruits](https://github.com/iceeyyy/DSA_Answers/tree/master/2689-rearranging-fruits) |
| [3120-count-the-number-of-special-characters-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3120-count-the-number-of-special-characters-i) |
| [3121-count-the-number-of-special-characters-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3121-count-the-number-of-special-characters-ii) |
| [3242-count-elements-with-maximum-frequency](https://github.com/iceeyyy/DSA_Answers/tree/master/3242-count-elements-with-maximum-frequency) |
| [3360-minimum-deletions-to-make-string-k-special](https://github.com/iceeyyy/DSA_Answers/tree/master/3360-minimum-deletions-to-make-string-k-special) |
| [3381-maximum-subarray-sum-with-length-divisible-by-k](https://github.com/iceeyyy/DSA_Answers/tree/master/3381-maximum-subarray-sum-with-length-divisible-by-k) |
| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/iceeyyy/DSA_Answers/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |
| [3437-maximum-total-damage-with-spell-casting](https://github.com/iceeyyy/DSA_Answers/tree/master/3437-maximum-total-damage-with-spell-casting) |
| [3445-lexicographically-minimum-string-after-removing-stars](https://github.com/iceeyyy/DSA_Answers/tree/master/3445-lexicographically-minimum-string-after-removing-stars) |
| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/iceeyyy/DSA_Answers/tree/master/3581-the-two-sneaky-numbers-of-digitville) |
| [3583-count-special-triplets](https://github.com/iceeyyy/DSA_Answers/tree/master/3583-count-special-triplets) |
| [3592-find-x-sum-of-all-k-long-subarrays-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3592-find-x-sum-of-all-k-long-subarrays-ii) |
| [3610-find-x-sum-of-all-k-long-subarrays-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3610-find-x-sum-of-all-k-long-subarrays-i) |
| [3623-count-number-of-trapezoids-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3623-count-number-of-trapezoids-i) |
| [3629-minimum-jumps-to-reach-end-via-prime-teleportation](https://github.com/iceeyyy/DSA_Answers/tree/master/3629-minimum-jumps-to-reach-end-via-prime-teleportation) |
| [3678-design-task-manager](https://github.com/iceeyyy/DSA_Answers/tree/master/3678-design-task-manager) |
| [3741-minimum-distance-between-three-equal-elements-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3741-minimum-distance-between-three-equal-elements-ii) |
| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |
| [3754-maximum-manhattan-distance-after-k-changes](https://github.com/iceeyyy/DSA_Answers/tree/master/3754-maximum-manhattan-distance-after-k-changes) |
| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/iceeyyy/DSA_Answers/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |
| [3797-design-spreadsheet](https://github.com/iceeyyy/DSA_Answers/tree/master/3797-design-spreadsheet) |
| [3827-implement-router](https://github.com/iceeyyy/DSA_Answers/tree/master/3827-implement-router) |
| [3834-minimum-operations-to-convert-all-elements-to-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/3834-minimum-operations-to-convert-all-elements-to-zero) |
| [3863-power-grid-maintenance](https://github.com/iceeyyy/DSA_Answers/tree/master/3863-power-grid-maintenance) |
| [3872-find-most-frequent-vowel-and-consonant](https://github.com/iceeyyy/DSA_Answers/tree/master/3872-find-most-frequent-vowel-and-consonant) |
## Sorting
|  |
| ------- |
| [0047-permutations-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0047-permutations-ii) |
| [0075-sort-colors](https://github.com/iceeyyy/DSA_Answers/tree/master/0075-sort-colors) |
| [0215-kth-largest-element-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0215-kth-largest-element-in-an-array) |
| [0217-contains-duplicate](https://github.com/iceeyyy/DSA_Answers/tree/master/0217-contains-duplicate) |
| [0347-top-k-frequent-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/0347-top-k-frequent-elements) |
| [0368-largest-divisible-subset](https://github.com/iceeyyy/DSA_Answers/tree/master/0368-largest-divisible-subset) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0451-sort-characters-by-frequency](https://github.com/iceeyyy/DSA_Answers/tree/master/0451-sort-characters-by-frequency) |
| [0594-longest-harmonious-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0594-longest-harmonious-subsequence) |
| [0611-valid-triangle-number](https://github.com/iceeyyy/DSA_Answers/tree/master/0611-valid-triangle-number) |
| [0621-task-scheduler](https://github.com/iceeyyy/DSA_Answers/tree/master/0621-task-scheduler) |
| [0628-maximum-product-of-three-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/0628-maximum-product-of-three-numbers) |
| [0645-set-mismatch](https://github.com/iceeyyy/DSA_Answers/tree/master/0645-set-mismatch) |
| [0721-accounts-merge](https://github.com/iceeyyy/DSA_Answers/tree/master/0721-accounts-merge) |
| [0759-set-intersection-size-at-least-two](https://github.com/iceeyyy/DSA_Answers/tree/master/0759-set-intersection-size-at-least-two) |
| [0876-hand-of-straights](https://github.com/iceeyyy/DSA_Answers/tree/master/0876-hand-of-straights) |
| [0900-reordered-power-of-2](https://github.com/iceeyyy/DSA_Answers/tree/master/0900-reordered-power-of-2) |
| [0948-sort-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0948-sort-an-array) |
| [1014-k-closest-points-to-origin](https://github.com/iceeyyy/DSA_Answers/tree/master/1014-k-closest-points-to-origin) |
| [1018-largest-perimeter-triangle](https://github.com/iceeyyy/DSA_Answers/tree/master/1018-largest-perimeter-triangle) |
| [1019-squares-of-a-sorted-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1019-squares-of-a-sorted-array) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1129-longest-string-chain](https://github.com/iceeyyy/DSA_Answers/tree/master/1129-longest-string-chain) |
| [1200-minimum-absolute-difference](https://github.com/iceeyyy/DSA_Answers/tree/master/1200-minimum-absolute-difference) |
| [1262-greatest-sum-divisible-by-three](https://github.com/iceeyyy/DSA_Answers/tree/master/1262-greatest-sum-divisible-by-three) |
| [1340-jump-game-v](https://github.com/iceeyyy/DSA_Answers/tree/master/1340-jump-game-v) |
| [1353-find-resultant-array-after-removing-anagrams](https://github.com/iceeyyy/DSA_Answers/tree/master/1353-find-resultant-array-after-removing-anagrams) |
| [1356-sort-integers-by-the-number-of-1-bits](https://github.com/iceeyyy/DSA_Answers/tree/master/1356-sort-integers-by-the-number-of-1-bits) |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/iceeyyy/DSA_Answers/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/iceeyyy/DSA_Answers/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [1669-minimum-cost-to-cut-a-stick](https://github.com/iceeyyy/DSA_Answers/tree/master/1669-minimum-cost-to-cut-a-stick) |
| [1727-largest-submatrix-with-rearrangements](https://github.com/iceeyyy/DSA_Answers/tree/master/1727-largest-submatrix-with-rearrangements) |
| [1833-maximum-ice-cream-bars](https://github.com/iceeyyy/DSA_Answers/tree/master/1833-maximum-ice-cream-bars) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [1877-minimize-maximum-pair-sum-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1877-minimize-maximum-pair-sum-in-array) |
| [1984-minimum-difference-between-highest-and-lowest-of-k-scores](https://github.com/iceeyyy/DSA_Answers/tree/master/1984-minimum-difference-between-highest-and-lowest-of-k-scores) |
| [2126-destroying-asteroids](https://github.com/iceeyyy/DSA_Answers/tree/master/2126-destroying-asteroids) |
| [2144-minimum-cost-of-buying-candies-with-discount](https://github.com/iceeyyy/DSA_Answers/tree/master/2144-minimum-cost-of-buying-candies-with-discount) |
| [2204-find-subsequence-of-length-k-with-the-largest-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/2204-find-subsequence-of-length-k-with-the-largest-sum) |
| [2274-keep-multiplying-found-values-by-two](https://github.com/iceeyyy/DSA_Answers/tree/master/2274-keep-multiplying-found-values-by-two) |
| [2387-partition-array-such-that-maximum-difference-is-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2387-partition-array-such-that-maximum-difference-is-k) |
| [2392-successful-pairs-of-spells-and-potions](https://github.com/iceeyyy/DSA_Answers/tree/master/2392-successful-pairs-of-spells-and-potions) |
| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/iceeyyy/DSA_Answers/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |
| [2479-meeting-rooms-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/2479-meeting-rooms-iii) |
| [2497-maximum-matching-of-players-with-trainers](https://github.com/iceeyyy/DSA_Answers/tree/master/2497-maximum-matching-of-players-with-trainers) |
| [2689-rearranging-fruits](https://github.com/iceeyyy/DSA_Answers/tree/master/2689-rearranging-fruits) |
| [2887-sort-vowels-in-a-string](https://github.com/iceeyyy/DSA_Answers/tree/master/2887-sort-vowels-in-a-string) |
| [3010-divide-an-array-into-subarrays-with-minimum-cost-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3010-divide-an-array-into-subarrays-with-minimum-cost-i) |
| [3074-apple-redistribution-into-boxes](https://github.com/iceeyyy/DSA_Answers/tree/master/3074-apple-redistribution-into-boxes) |
| [3241-divide-array-into-arrays-with-max-difference](https://github.com/iceeyyy/DSA_Answers/tree/master/3241-divide-array-into-arrays-with-max-difference) |
| [3277-find-the-number-of-ways-to-place-people-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3277-find-the-number-of-ways-to-place-people-ii) |
| [3278-find-the-number-of-ways-to-place-people-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3278-find-the-number-of-ways-to-place-people-i) |
| [3321-type-of-triangle](https://github.com/iceeyyy/DSA_Answers/tree/master/3321-type-of-triangle) |
| [3360-minimum-deletions-to-make-string-k-special](https://github.com/iceeyyy/DSA_Answers/tree/master/3360-minimum-deletions-to-make-string-k-special) |
| [3437-maximum-total-damage-with-spell-casting](https://github.com/iceeyyy/DSA_Answers/tree/master/3437-maximum-total-damage-with-spell-casting) |
| [3536-maximum-product-of-two-digits](https://github.com/iceeyyy/DSA_Answers/tree/master/3536-maximum-product-of-two-digits) |
| [3567-minimum-absolute-difference-in-sliding-submatrix](https://github.com/iceeyyy/DSA_Answers/tree/master/3567-minimum-absolute-difference-in-sliding-submatrix) |
| [3620-maximum-number-of-distinct-elements-after-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/3620-maximum-number-of-distinct-elements-after-operations) |
| [3635-earliest-finish-time-for-land-and-water-rides-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3635-earliest-finish-time-for-land-and-water-rides-ii) |
| [3748-sort-matrix-by-diagonals](https://github.com/iceeyyy/DSA_Answers/tree/master/3748-sort-matrix-by-diagonals) |
## Array
|  |
| ------- |
| [0001-two-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0001-two-sum) |
| [0011-container-with-most-water](https://github.com/iceeyyy/DSA_Answers/tree/master/0011-container-with-most-water) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0036-valid-sudoku](https://github.com/iceeyyy/DSA_Answers/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/iceeyyy/DSA_Answers/tree/master/0037-sudoku-solver) |
| [0039-combination-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0040-combination-sum-ii) |
| [0046-permutations](https://github.com/iceeyyy/DSA_Answers/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0047-permutations-ii) |
| [0053-maximum-subarray](https://github.com/iceeyyy/DSA_Answers/tree/master/0053-maximum-subarray) |
| [0055-jump-game](https://github.com/iceeyyy/DSA_Answers/tree/master/0055-jump-game) |
| [0063-unique-paths-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0064-minimum-path-sum) |
| [0075-sort-colors](https://github.com/iceeyyy/DSA_Answers/tree/master/0075-sort-colors) |
| [0078-subsets](https://github.com/iceeyyy/DSA_Answers/tree/master/0078-subsets) |
| [0079-word-search](https://github.com/iceeyyy/DSA_Answers/tree/master/0079-word-search) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0118-pascals-triangle](https://github.com/iceeyyy/DSA_Answers/tree/master/0118-pascals-triangle) |
| [0120-triangle](https://github.com/iceeyyy/DSA_Answers/tree/master/0120-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/iceeyyy/DSA_Answers/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |
| [0130-surrounded-regions](https://github.com/iceeyyy/DSA_Answers/tree/master/0130-surrounded-regions) |
| [0135-candy](https://github.com/iceeyyy/DSA_Answers/tree/master/0135-candy) |
| [0136-single-number](https://github.com/iceeyyy/DSA_Answers/tree/master/0136-single-number) |
| [0137-single-number-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0137-single-number-ii) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/iceeyyy/DSA_Answers/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0188-best-time-to-buy-and-sell-stock-iv](https://github.com/iceeyyy/DSA_Answers/tree/master/0188-best-time-to-buy-and-sell-stock-iv) |
| [0198-house-robber](https://github.com/iceeyyy/DSA_Answers/tree/master/0198-house-robber) |
| [0200-number-of-islands](https://github.com/iceeyyy/DSA_Answers/tree/master/0200-number-of-islands) |
| [0204-count-primes](https://github.com/iceeyyy/DSA_Answers/tree/master/0204-count-primes) |
| [0213-house-robber-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0213-house-robber-ii) |
| [0215-kth-largest-element-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0215-kth-largest-element-in-an-array) |
| [0216-combination-sum-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/0216-combination-sum-iii) |
| [0217-contains-duplicate](https://github.com/iceeyyy/DSA_Answers/tree/master/0217-contains-duplicate) |
| [0238-product-of-array-except-self](https://github.com/iceeyyy/DSA_Answers/tree/master/0238-product-of-array-except-self) |
| [0300-longest-increasing-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0300-longest-increasing-subsequence) |
| [0303-range-sum-query-immutable](https://github.com/iceeyyy/DSA_Answers/tree/master/0303-range-sum-query-immutable) |
| [0307-range-sum-query-mutable](https://github.com/iceeyyy/DSA_Answers/tree/master/0307-range-sum-query-mutable) |
| [0309-best-time-to-buy-and-sell-stock-with-cooldown](https://github.com/iceeyyy/DSA_Answers/tree/master/0309-best-time-to-buy-and-sell-stock-with-cooldown) |
| [0312-burst-balloons](https://github.com/iceeyyy/DSA_Answers/tree/master/0312-burst-balloons) |
| [0322-coin-change](https://github.com/iceeyyy/DSA_Answers/tree/master/0322-coin-change) |
| [0347-top-k-frequent-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/0347-top-k-frequent-elements) |
| [0368-largest-divisible-subset](https://github.com/iceeyyy/DSA_Answers/tree/master/0368-largest-divisible-subset) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0407-trapping-rain-water-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0407-trapping-rain-water-ii) |
| [0416-partition-equal-subset-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0416-partition-equal-subset-sum) |
| [0417-pacific-atlantic-water-flow](https://github.com/iceeyyy/DSA_Answers/tree/master/0417-pacific-atlantic-water-flow) |
| [0421-maximum-xor-of-two-numbers-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0421-maximum-xor-of-two-numbers-in-an-array) |
| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0448-find-all-numbers-disappeared-in-an-array) |
| [0474-ones-and-zeroes](https://github.com/iceeyyy/DSA_Answers/tree/master/0474-ones-and-zeroes) |
| [0485-max-consecutive-ones](https://github.com/iceeyyy/DSA_Answers/tree/master/0485-max-consecutive-ones) |
| [0494-target-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0494-target-sum) |
| [0498-diagonal-traverse](https://github.com/iceeyyy/DSA_Answers/tree/master/0498-diagonal-traverse) |
| [0518-coin-change-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0518-coin-change-ii) |
| [0542-01-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/0542-01-matrix) |
| [0594-longest-harmonious-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0594-longest-harmonious-subsequence) |
| [0605-can-place-flowers](https://github.com/iceeyyy/DSA_Answers/tree/master/0605-can-place-flowers) |
| [0611-valid-triangle-number](https://github.com/iceeyyy/DSA_Answers/tree/master/0611-valid-triangle-number) |
| [0621-task-scheduler](https://github.com/iceeyyy/DSA_Answers/tree/master/0621-task-scheduler) |
| [0628-maximum-product-of-three-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/0628-maximum-product-of-three-numbers) |
| [0643-maximum-average-subarray-i](https://github.com/iceeyyy/DSA_Answers/tree/master/0643-maximum-average-subarray-i) |
| [0645-set-mismatch](https://github.com/iceeyyy/DSA_Answers/tree/master/0645-set-mismatch) |
| [0673-number-of-longest-increasing-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0673-number-of-longest-increasing-subsequence) |
| [0679-24-game](https://github.com/iceeyyy/DSA_Answers/tree/master/0679-24-game) |
| [0682-baseball-game](https://github.com/iceeyyy/DSA_Answers/tree/master/0682-baseball-game) |
| [0695-max-area-of-island](https://github.com/iceeyyy/DSA_Answers/tree/master/0695-max-area-of-island) |
| [0714-best-time-to-buy-and-sell-stock-with-transaction-fee](https://github.com/iceeyyy/DSA_Answers/tree/master/0714-best-time-to-buy-and-sell-stock-with-transaction-fee) |
| [0717-1-bit-and-2-bit-characters](https://github.com/iceeyyy/DSA_Answers/tree/master/0717-1-bit-and-2-bit-characters) |
| [0721-accounts-merge](https://github.com/iceeyyy/DSA_Answers/tree/master/0721-accounts-merge) |
| [0733-flood-fill](https://github.com/iceeyyy/DSA_Answers/tree/master/0733-flood-fill) |
| [0735-asteroid-collision](https://github.com/iceeyyy/DSA_Answers/tree/master/0735-asteroid-collision) |
| [0747-min-cost-climbing-stairs](https://github.com/iceeyyy/DSA_Answers/tree/master/0747-min-cost-climbing-stairs) |
| [0759-set-intersection-size-at-least-two](https://github.com/iceeyyy/DSA_Answers/tree/master/0759-set-intersection-size-at-least-two) |
| [0794-swim-in-rising-water](https://github.com/iceeyyy/DSA_Answers/tree/master/0794-swim-in-rising-water) |
| [0830-largest-triangle-area](https://github.com/iceeyyy/DSA_Answers/tree/master/0830-largest-triangle-area) |
| [0854-making-a-large-island](https://github.com/iceeyyy/DSA_Answers/tree/master/0854-making-a-large-island) |
| [0874-walking-robot-simulation](https://github.com/iceeyyy/DSA_Answers/tree/master/0874-walking-robot-simulation) |
| [0875-longest-mountain-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0875-longest-mountain-in-array) |
| [0876-hand-of-straights](https://github.com/iceeyyy/DSA_Answers/tree/master/0876-hand-of-straights) |
| [0882-peak-index-in-a-mountain-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0882-peak-index-in-a-mountain-array) |
| [0940-fruit-into-baskets](https://github.com/iceeyyy/DSA_Answers/tree/master/0940-fruit-into-baskets) |
| [0944-delete-columns-to-make-sorted](https://github.com/iceeyyy/DSA_Answers/tree/master/0944-delete-columns-to-make-sorted) |
| [0948-sort-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0948-sort-an-array) |
| [0967-minimum-falling-path-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0967-minimum-falling-path-sum) |
| [0978-valid-mountain-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0978-valid-mountain-array) |
| [1006-vowel-spellchecker](https://github.com/iceeyyy/DSA_Answers/tree/master/1006-vowel-spellchecker) |
| [1014-k-closest-points-to-origin](https://github.com/iceeyyy/DSA_Answers/tree/master/1014-k-closest-points-to-origin) |
| [1018-largest-perimeter-triangle](https://github.com/iceeyyy/DSA_Answers/tree/master/1018-largest-perimeter-triangle) |
| [1018-binary-prefix-divisible-by-5](https://github.com/iceeyyy/DSA_Answers/tree/master/1018-binary-prefix-divisible-by-5) |
| [1019-squares-of-a-sorted-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1019-squares-of-a-sorted-array) |
| [1036-rotting-oranges](https://github.com/iceeyyy/DSA_Answers/tree/master/1036-rotting-oranges) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1073-number-of-enclaves](https://github.com/iceeyyy/DSA_Answers/tree/master/1073-number-of-enclaves) |
| [1111-minimum-score-triangulation-of-polygon](https://github.com/iceeyyy/DSA_Answers/tree/master/1111-minimum-score-triangulation-of-polygon) |
| [1121-partition-array-for-maximum-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/1121-partition-array-for-maximum-sum) |
| [1127-last-stone-weight](https://github.com/iceeyyy/DSA_Answers/tree/master/1127-last-stone-weight) |
| [1129-longest-string-chain](https://github.com/iceeyyy/DSA_Answers/tree/master/1129-longest-string-chain) |
| [1171-shortest-path-in-binary-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/1171-shortest-path-in-binary-matrix) |
| [1200-minimum-absolute-difference](https://github.com/iceeyyy/DSA_Answers/tree/master/1200-minimum-absolute-difference) |
| [1262-greatest-sum-divisible-by-three](https://github.com/iceeyyy/DSA_Answers/tree/master/1262-greatest-sum-divisible-by-three) |
| [1266-minimum-time-visiting-all-points](https://github.com/iceeyyy/DSA_Answers/tree/master/1266-minimum-time-visiting-all-points) |
| [1293-three-consecutive-odds](https://github.com/iceeyyy/DSA_Answers/tree/master/1293-three-consecutive-odds) |
| [1306-jump-game-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/1306-jump-game-iii) |
| [1319-unique-number-of-occurrences](https://github.com/iceeyyy/DSA_Answers/tree/master/1319-unique-number-of-occurrences) |
| [1340-jump-game-v](https://github.com/iceeyyy/DSA_Answers/tree/master/1340-jump-game-v) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/iceeyyy/DSA_Answers/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1351-count-negative-numbers-in-a-sorted-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/1351-count-negative-numbers-in-a-sorted-matrix) |
| [1353-find-resultant-array-after-removing-anagrams](https://github.com/iceeyyy/DSA_Answers/tree/master/1353-find-resultant-array-after-removing-anagrams) |
| [1356-sort-integers-by-the-number-of-1-bits](https://github.com/iceeyyy/DSA_Answers/tree/master/1356-sort-integers-by-the-number-of-1-bits) |
| [1364-tuple-with-same-product](https://github.com/iceeyyy/DSA_Answers/tree/master/1364-tuple-with-same-product) |
| [1392-find-the-difference-of-two-arrays](https://github.com/iceeyyy/DSA_Answers/tree/master/1392-find-the-difference-of-two-arrays) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/iceeyyy/DSA_Answers/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1424-maximum-candies-you-can-get-from-boxes](https://github.com/iceeyyy/DSA_Answers/tree/master/1424-maximum-candies-you-can-get-from-boxes) |
| [1426-find-n-unique-integers-sum-up-to-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/1426-find-n-unique-integers-sum-up-to-zero) |
| [1477-product-of-the-last-k-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/1477-product-of-the-last-k-numbers) |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/iceeyyy/DSA_Answers/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
| [1510-find-lucky-integer-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1510-find-lucky-integer-in-an-array) |
| [1528-kids-with-the-greatest-number-of-candies](https://github.com/iceeyyy/DSA_Answers/tree/master/1528-kids-with-the-greatest-number-of-candies) |
| [1548-check-if-all-1s-are-at-least-length-k-places-away](https://github.com/iceeyyy/DSA_Answers/tree/master/1548-check-if-all-1s-are-at-least-length-k-places-away) |
| [1559-detect-cycles-in-2d-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/1559-detect-cycles-in-2d-grid) |
| [1582-special-positions-in-a-binary-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/1582-special-positions-in-a-binary-matrix) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/iceeyyy/DSA_Answers/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1590-make-sum-divisible-by-p](https://github.com/iceeyyy/DSA_Answers/tree/master/1590-make-sum-divisible-by-p) |
| [1612-avoid-flood-in-the-city](https://github.com/iceeyyy/DSA_Answers/tree/master/1612-avoid-flood-in-the-city) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/iceeyyy/DSA_Answers/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [1628-count-submatrices-with-all-ones](https://github.com/iceeyyy/DSA_Answers/tree/master/1628-count-submatrices-with-all-ones) |
| [1669-minimum-cost-to-cut-a-stick](https://github.com/iceeyyy/DSA_Answers/tree/master/1669-minimum-cost-to-cut-a-stick) |
| [1700-minimum-time-to-make-rope-colorful](https://github.com/iceeyyy/DSA_Answers/tree/master/1700-minimum-time-to-make-rope-colorful) |
| [1706-min-cost-to-connect-all-points](https://github.com/iceeyyy/DSA_Answers/tree/master/1706-min-cost-to-connect-all-points) |
| [1727-largest-submatrix-with-rearrangements](https://github.com/iceeyyy/DSA_Answers/tree/master/1727-largest-submatrix-with-rearrangements) |
| [1752-check-if-array-is-sorted-and-rotated](https://github.com/iceeyyy/DSA_Answers/tree/master/1752-check-if-array-is-sorted-and-rotated) |
| [1753-path-with-minimum-effort](https://github.com/iceeyyy/DSA_Answers/tree/master/1753-path-with-minimum-effort) |
| [1813-maximum-erasure-value](https://github.com/iceeyyy/DSA_Answers/tree/master/1813-maximum-erasure-value) |
| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/iceeyyy/DSA_Answers/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |
| [1826-maximum-xor-with-an-element-from-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1826-maximum-xor-with-an-element-from-array) |
| [1833-maximum-ice-cream-bars](https://github.com/iceeyyy/DSA_Answers/tree/master/1833-maximum-ice-cream-bars) |
| [1834-minimum-number-of-people-to-teach](https://github.com/iceeyyy/DSA_Answers/tree/master/1834-minimum-number-of-people-to-teach) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [1877-minimize-maximum-pair-sum-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1877-minimize-maximum-pair-sum-in-array) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/iceeyyy/DSA_Answers/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [1886-determine-whether-matrix-can-be-obtained-by-rotation](https://github.com/iceeyyy/DSA_Answers/tree/master/1886-determine-whether-matrix-can-be-obtained-by-rotation) |
| [1895-largest-magic-square](https://github.com/iceeyyy/DSA_Answers/tree/master/1895-largest-magic-square) |
| [1914-cyclically-rotating-a-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/1914-cyclically-rotating-a-grid) |
| [1917-maximum-average-pass-ratio](https://github.com/iceeyyy/DSA_Answers/tree/master/1917-maximum-average-pass-ratio) |
| [1927-maximum-ascending-subarray-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/1927-maximum-ascending-subarray-sum) |
| [1980-find-unique-binary-string](https://github.com/iceeyyy/DSA_Answers/tree/master/1980-find-unique-binary-string) |
| [1984-minimum-difference-between-highest-and-lowest-of-k-scores](https://github.com/iceeyyy/DSA_Answers/tree/master/1984-minimum-difference-between-highest-and-lowest-of-k-scores) |
| [1995-finding-pairs-with-a-certain-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/1995-finding-pairs-with-a-certain-sum) |
| [2023-design-movie-rental-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2023-design-movie-rental-system) |
| [2038-nearest-exit-from-entrance-in-maze](https://github.com/iceeyyy/DSA_Answers/tree/master/2038-nearest-exit-from-entrance-in-maze) |
| [2110-number-of-smooth-descent-periods-of-a-stock](https://github.com/iceeyyy/DSA_Answers/tree/master/2110-number-of-smooth-descent-periods-of-a-stock) |
| [2126-destroying-asteroids](https://github.com/iceeyyy/DSA_Answers/tree/master/2126-destroying-asteroids) |
| [2137-final-value-of-variable-after-performing-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/2137-final-value-of-variable-after-performing-operations) |
| [2144-maximum-difference-between-increasing-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/2144-maximum-difference-between-increasing-elements) |
| [2144-minimum-cost-of-buying-candies-with-discount](https://github.com/iceeyyy/DSA_Answers/tree/master/2144-minimum-cost-of-buying-candies-with-discount) |
| [2150-kth-smallest-product-of-two-sorted-arrays](https://github.com/iceeyyy/DSA_Answers/tree/master/2150-kth-smallest-product-of-two-sorted-arrays) |
| [2169-simple-bank-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2169-simple-bank-system) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/iceeyyy/DSA_Answers/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2196-create-binary-tree-from-descriptions](https://github.com/iceeyyy/DSA_Answers/tree/master/2196-create-binary-tree-from-descriptions) |
| [2204-find-subsequence-of-length-k-with-the-largest-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/2204-find-subsequence-of-length-k-with-the-largest-sum) |
| [2229-maximum-fruits-harvested-after-at-most-k-steps](https://github.com/iceeyyy/DSA_Answers/tree/master/2229-maximum-fruits-harvested-after-at-most-k-steps) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/iceeyyy/DSA_Answers/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2244-number-of-laser-beams-in-a-bank](https://github.com/iceeyyy/DSA_Answers/tree/master/2244-number-of-laser-beams-in-a-bank) |
| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |
| [2267-minimum-difference-in-sums-after-removal-of-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/2267-minimum-difference-in-sums-after-removal-of-elements) |
| [2274-keep-multiplying-found-values-by-two](https://github.com/iceeyyy/DSA_Answers/tree/master/2274-keep-multiplying-found-values-by-two) |
| [2307-replace-non-coprime-numbers-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/2307-replace-non-coprime-numbers-in-array) |
| [2316-count-hills-and-valleys-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/2316-count-hills-and-valleys-in-an-array) |
| [2320-find-all-k-distant-indices-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/2320-find-all-k-distant-indices-in-an-array) |
| [2324-find-triangular-sum-of-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/2324-find-triangular-sum-of-an-array) |
| [2350-find-closest-number-to-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/2350-find-closest-number-to-zero) |
| [2387-partition-array-such-that-maximum-difference-is-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2387-partition-array-such-that-maximum-difference-is-k) |
| [2392-successful-pairs-of-spells-and-potions](https://github.com/iceeyyy/DSA_Answers/tree/master/2392-successful-pairs-of-spells-and-potions) |
| [2400-minimum-score-after-removals-on-a-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/2400-minimum-score-after-removals-on-a-tree) |
| [2429-design-a-food-rating-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2429-design-a-food-rating-system) |
| [2432-number-of-zero-filled-subarrays](https://github.com/iceeyyy/DSA_Answers/tree/master/2432-number-of-zero-filled-subarrays) |
| [2435-paths-in-matrix-whose-sum-is-divisible-by-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2435-paths-in-matrix-whose-sum-is-divisible-by-k) |
| [2448-count-number-of-bad-pairs](https://github.com/iceeyyy/DSA_Answers/tree/master/2448-count-number-of-bad-pairs) |
| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/iceeyyy/DSA_Answers/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |
| [2479-meeting-rooms-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/2479-meeting-rooms-iii) |
| [2497-maximum-matching-of-players-with-trainers](https://github.com/iceeyyy/DSA_Answers/tree/master/2497-maximum-matching-of-players-with-trainers) |
| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/iceeyyy/DSA_Answers/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |
| [2529-range-product-queries-of-powers](https://github.com/iceeyyy/DSA_Answers/tree/master/2529-range-product-queries-of-powers) |
| [2574-left-and-right-sum-differences](https://github.com/iceeyyy/DSA_Answers/tree/master/2574-left-and-right-sum-differences) |
| [2618-maximize-the-minimum-powered-city](https://github.com/iceeyyy/DSA_Answers/tree/master/2618-maximize-the-minimum-powered-city) |
| [2625-increment-submatrices-by-one](https://github.com/iceeyyy/DSA_Answers/tree/master/2625-increment-submatrices-by-one) |
| [2661-smallest-missing-non-negative-integer-after-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/2661-smallest-missing-non-negative-integer-after-operations) |
| [2689-rearranging-fruits](https://github.com/iceeyyy/DSA_Answers/tree/master/2689-rearranging-fruits) |
| [2720-minimize-the-maximum-difference-of-pairs](https://github.com/iceeyyy/DSA_Answers/tree/master/2720-minimize-the-maximum-difference-of-pairs) |
| [2770-maximum-number-of-jumps-to-reach-the-last-index](https://github.com/iceeyyy/DSA_Answers/tree/master/2770-maximum-number-of-jumps-to-reach-the-last-index) |
| [2812-find-the-safest-path-in-a-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/2812-find-the-safest-path-in-a-grid) |
| [2946-matrix-similarity-after-cyclic-shifts](https://github.com/iceeyyy/DSA_Answers/tree/master/2946-matrix-similarity-after-cyclic-shifts) |
| [3010-divide-an-array-into-subarrays-with-minimum-cost-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3010-divide-an-array-into-subarrays-with-minimum-cost-i) |
| [3074-apple-redistribution-into-boxes](https://github.com/iceeyyy/DSA_Answers/tree/master/3074-apple-redistribution-into-boxes) |
| [3161-block-placement-queries](https://github.com/iceeyyy/DSA_Answers/tree/master/3161-block-placement-queries) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/iceeyyy/DSA_Answers/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3190-find-minimum-operations-to-make-all-elements-divisible-by-three](https://github.com/iceeyyy/DSA_Answers/tree/master/3190-find-minimum-operations-to-make-all-elements-divisible-by-three) |
| [3194-find-words-containing-character](https://github.com/iceeyyy/DSA_Answers/tree/master/3194-find-words-containing-character) |
| [3241-divide-array-into-arrays-with-max-difference](https://github.com/iceeyyy/DSA_Answers/tree/master/3241-divide-array-into-arrays-with-max-difference) |
| [3242-count-elements-with-maximum-frequency](https://github.com/iceeyyy/DSA_Answers/tree/master/3242-count-elements-with-maximum-frequency) |
| [3251-maximum-area-of-longest-diagonal-rectangle](https://github.com/iceeyyy/DSA_Answers/tree/master/3251-maximum-area-of-longest-diagonal-rectangle) |
| [3277-find-the-number-of-ways-to-place-people-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3277-find-the-number-of-ways-to-place-people-ii) |
| [3278-find-the-number-of-ways-to-place-people-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3278-find-the-number-of-ways-to-place-people-i) |
| [3300-minimum-element-after-replacement-with-digit-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/3300-minimum-element-after-replacement-with-digit-sum) |
| [3315-construct-the-minimum-bitwise-array-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3315-construct-the-minimum-bitwise-array-ii) |
| [3321-type-of-triangle](https://github.com/iceeyyy/DSA_Answers/tree/master/3321-type-of-triangle) |
| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |
| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/iceeyyy/DSA_Answers/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |
| [3381-maximum-subarray-sum-with-length-divisible-by-k](https://github.com/iceeyyy/DSA_Answers/tree/master/3381-maximum-subarray-sum-with-length-divisible-by-k) |
| [3383-taking-maximum-energy-from-the-mystic-dungeon](https://github.com/iceeyyy/DSA_Answers/tree/master/3383-taking-maximum-energy-from-the-mystic-dungeon) |
| [3418-maximum-amount-of-money-robot-can-earn](https://github.com/iceeyyy/DSA_Answers/tree/master/3418-maximum-amount-of-money-robot-can-earn) |
| [3432-count-partitions-with-even-sum-difference](https://github.com/iceeyyy/DSA_Answers/tree/master/3432-count-partitions-with-even-sum-difference) |
| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/iceeyyy/DSA_Answers/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |
| [3437-maximum-total-damage-with-spell-casting](https://github.com/iceeyyy/DSA_Answers/tree/master/3437-maximum-total-damage-with-spell-casting) |
| [3459-find-the-minimum-area-to-cover-all-ones-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3459-find-the-minimum-area-to-cover-all-ones-ii) |
| [3461-find-the-minimum-area-to-cover-all-ones-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3461-find-the-minimum-area-to-cover-all-ones-i) |
| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |
| [3491-find-the-maximum-length-of-valid-subsequence-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3491-find-the-maximum-length-of-valid-subsequence-ii) |
| [3567-minimum-absolute-difference-in-sliding-submatrix](https://github.com/iceeyyy/DSA_Answers/tree/master/3567-minimum-absolute-difference-in-sliding-submatrix) |
| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/iceeyyy/DSA_Answers/tree/master/3581-the-two-sneaky-numbers-of-digitville) |
| [3583-count-special-triplets](https://github.com/iceeyyy/DSA_Answers/tree/master/3583-count-special-triplets) |
| [3592-find-x-sum-of-all-k-long-subarrays-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3592-find-x-sum-of-all-k-long-subarrays-ii) |
| [3610-find-x-sum-of-all-k-long-subarrays-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3610-find-x-sum-of-all-k-long-subarrays-i) |
| [3612-adjacent-increasing-subarrays-detection-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3612-adjacent-increasing-subarrays-detection-i) |
| [3616-make-array-elements-equal-to-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/3616-make-array-elements-equal-to-zero) |
| [3619-adjacent-increasing-subarrays-detection-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3619-adjacent-increasing-subarrays-detection-ii) |
| [3620-maximum-number-of-distinct-elements-after-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/3620-maximum-number-of-distinct-elements-after-operations) |
| [3623-count-number-of-trapezoids-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3623-count-number-of-trapezoids-i) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
| [3629-minimum-jumps-to-reach-end-via-prime-teleportation](https://github.com/iceeyyy/DSA_Answers/tree/master/3629-minimum-jumps-to-reach-end-via-prime-teleportation) |
| [3635-earliest-finish-time-for-land-and-water-rides-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3635-earliest-finish-time-for-land-and-water-rides-ii) |
| [3643-flip-square-submatrix-vertically](https://github.com/iceeyyy/DSA_Answers/tree/master/3643-flip-square-submatrix-vertically) |
| [3648-find-the-maximum-number-of-fruits-collected](https://github.com/iceeyyy/DSA_Answers/tree/master/3648-find-the-maximum-number-of-fruits-collected) |
| [3689-maximum-total-subarray-value-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3689-maximum-total-subarray-value-i) |
| [3733-length-of-longest-v-shaped-diagonal-segment](https://github.com/iceeyyy/DSA_Answers/tree/master/3733-length-of-longest-v-shaped-diagonal-segment) |
| [3741-reschedule-meetings-for-maximum-free-time-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3741-reschedule-meetings-for-maximum-free-time-ii) |
| [3741-minimum-distance-between-three-equal-elements-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3741-minimum-distance-between-three-equal-elements-ii) |
| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |
| [3744-minimum-operations-to-make-array-elements-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/3744-minimum-operations-to-make-array-elements-zero) |
| [3747-maximum-difference-between-adjacent-elements-in-a-circular-array](https://github.com/iceeyyy/DSA_Answers/tree/master/3747-maximum-difference-between-adjacent-elements-in-a-circular-array) |
| [3748-sort-matrix-by-diagonals](https://github.com/iceeyyy/DSA_Answers/tree/master/3748-sort-matrix-by-diagonals) |
| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/iceeyyy/DSA_Answers/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |
| [3789-maximize-subarrays-after-removing-one-conflicting-pair](https://github.com/iceeyyy/DSA_Answers/tree/master/3789-maximize-subarrays-after-removing-one-conflicting-pair) |
| [3790-fruits-into-baskets-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3790-fruits-into-baskets-ii) |
| [3791-fruits-into-baskets-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/3791-fruits-into-baskets-iii) |
| [3794-find-the-minimum-amount-of-time-to-brew-potions](https://github.com/iceeyyy/DSA_Answers/tree/master/3794-find-the-minimum-amount-of-time-to-brew-potions) |
| [3797-design-spreadsheet](https://github.com/iceeyyy/DSA_Answers/tree/master/3797-design-spreadsheet) |
| [3827-implement-router](https://github.com/iceeyyy/DSA_Answers/tree/master/3827-implement-router) |
| [3834-minimum-operations-to-convert-all-elements-to-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/3834-minimum-operations-to-convert-all-elements-to-zero) |
| [3838-weighted-word-mapping](https://github.com/iceeyyy/DSA_Answers/tree/master/3838-weighted-word-mapping) |
| [3851-find-sum-of-array-product-of-magical-sequences](https://github.com/iceeyyy/DSA_Answers/tree/master/3851-find-sum-of-array-product-of-magical-sequences) |
| [3863-power-grid-maintenance](https://github.com/iceeyyy/DSA_Answers/tree/master/3863-power-grid-maintenance) |
## Backtracking
|  |
| ------- |
| [0017-letter-combinations-of-a-phone-number](https://github.com/iceeyyy/DSA_Answers/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0037-sudoku-solver](https://github.com/iceeyyy/DSA_Answers/tree/master/0037-sudoku-solver) |
| [0039-combination-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0040-combination-sum-ii) |
| [0046-permutations](https://github.com/iceeyyy/DSA_Answers/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0047-permutations-ii) |
| [0077-combinations](https://github.com/iceeyyy/DSA_Answers/tree/master/0077-combinations) |
| [0078-subsets](https://github.com/iceeyyy/DSA_Answers/tree/master/0078-subsets) |
| [0079-word-search](https://github.com/iceeyyy/DSA_Answers/tree/master/0079-word-search) |
| [0131-palindrome-partitioning](https://github.com/iceeyyy/DSA_Answers/tree/master/0131-palindrome-partitioning) |
| [0216-combination-sum-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/0216-combination-sum-iii) |
| [0401-binary-watch](https://github.com/iceeyyy/DSA_Answers/tree/master/0401-binary-watch) |
| [0494-target-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0494-target-sum) |
| [0679-24-game](https://github.com/iceeyyy/DSA_Answers/tree/master/0679-24-game) |
| [1160-letter-tile-possibilities](https://github.com/iceeyyy/DSA_Answers/tree/master/1160-letter-tile-possibilities) |
| [1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/iceeyyy/DSA_Answers/tree/master/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |
| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/iceeyyy/DSA_Answers/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |
| [1980-find-unique-binary-string](https://github.com/iceeyyy/DSA_Answers/tree/master/1980-find-unique-binary-string) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/iceeyyy/DSA_Answers/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2174-next-greater-numerically-balanced-number](https://github.com/iceeyyy/DSA_Answers/tree/master/2174-next-greater-numerically-balanced-number) |
| [2802-find-the-punishment-number-of-an-integer](https://github.com/iceeyyy/DSA_Answers/tree/master/2802-find-the-punishment-number-of-an-integer) |
## Bit Manipulation
|  |
| ------- |
| [0029-divide-two-integers](https://github.com/iceeyyy/DSA_Answers/tree/master/0029-divide-two-integers) |
| [0067-add-binary](https://github.com/iceeyyy/DSA_Answers/tree/master/0067-add-binary) |
| [0078-subsets](https://github.com/iceeyyy/DSA_Answers/tree/master/0078-subsets) |
| [0136-single-number](https://github.com/iceeyyy/DSA_Answers/tree/master/0136-single-number) |
| [0137-single-number-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0137-single-number-ii) |
| [0190-reverse-bits](https://github.com/iceeyyy/DSA_Answers/tree/master/0190-reverse-bits) |
| [0222-count-complete-tree-nodes](https://github.com/iceeyyy/DSA_Answers/tree/master/0222-count-complete-tree-nodes) |
| [0231-power-of-two](https://github.com/iceeyyy/DSA_Answers/tree/master/0231-power-of-two) |
| [0342-power-of-four](https://github.com/iceeyyy/DSA_Answers/tree/master/0342-power-of-four) |
| [0401-binary-watch](https://github.com/iceeyyy/DSA_Answers/tree/master/0401-binary-watch) |
| [0421-maximum-xor-of-two-numbers-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0421-maximum-xor-of-two-numbers-in-an-array) |
| [0645-set-mismatch](https://github.com/iceeyyy/DSA_Answers/tree/master/0645-set-mismatch) |
| [0693-binary-number-with-alternating-bits](https://github.com/iceeyyy/DSA_Answers/tree/master/0693-binary-number-with-alternating-bits) |
| [0762-prime-number-of-set-bits-in-binary-representation](https://github.com/iceeyyy/DSA_Answers/tree/master/0762-prime-number-of-set-bits-in-binary-representation) |
| [1018-binary-prefix-divisible-by-5](https://github.com/iceeyyy/DSA_Answers/tree/master/1018-binary-prefix-divisible-by-5) |
| [1356-sort-integers-by-the-number-of-1-bits](https://github.com/iceeyyy/DSA_Answers/tree/master/1356-sort-integers-by-the-number-of-1-bits) |
| [1461-check-if-a-string-contains-all-binary-codes-of-size-k](https://github.com/iceeyyy/DSA_Answers/tree/master/1461-check-if-a-string-contains-all-binary-codes-of-size-k) |
| [1732-minimum-one-bit-operations-to-make-integers-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/1732-minimum-one-bit-operations-to-make-integers-zero) |
| [1826-maximum-xor-with-an-element-from-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1826-maximum-xor-with-an-element-from-array) |
| [1930-unique-length-3-palindromic-subsequences](https://github.com/iceeyyy/DSA_Answers/tree/master/1930-unique-length-3-palindromic-subsequences) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/iceeyyy/DSA_Answers/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2323-minimum-bit-flips-to-convert-number](https://github.com/iceeyyy/DSA_Answers/tree/master/2323-minimum-bit-flips-to-convert-number) |
| [2400-minimum-score-after-removals-on-a-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/2400-minimum-score-after-removals-on-a-tree) |
| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/iceeyyy/DSA_Answers/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |
| [2529-range-product-queries-of-powers](https://github.com/iceeyyy/DSA_Answers/tree/master/2529-range-product-queries-of-powers) |
| [2837-minimum-operations-to-make-the-integer-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/2837-minimum-operations-to-make-the-integer-zero) |
| [3233-maximize-the-number-of-partitions-after-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/3233-maximize-the-number-of-partitions-after-operations) |
| [3315-construct-the-minimum-bitwise-array-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3315-construct-the-minimum-bitwise-array-ii) |
| [3600-find-the-k-th-character-in-string-game-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3600-find-the-k-th-character-in-string-game-i) |
| [3601-find-the-k-th-character-in-string-game-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3601-find-the-k-th-character-in-string-game-ii) |
| [3676-smallest-number-with-all-set-bits](https://github.com/iceeyyy/DSA_Answers/tree/master/3676-smallest-number-with-all-set-bits) |
| [3744-minimum-operations-to-make-array-elements-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/3744-minimum-operations-to-make-array-elements-zero) |
| [3851-find-sum-of-array-product-of-magical-sequences](https://github.com/iceeyyy/DSA_Answers/tree/master/3851-find-sum-of-array-product-of-magical-sequences) |
## Two Pointers
|  |
| ------- |
| [0011-container-with-most-water](https://github.com/iceeyyy/DSA_Answers/tree/master/0011-container-with-most-water) |
| [0075-sort-colors](https://github.com/iceeyyy/DSA_Answers/tree/master/0075-sort-colors) |
| [0151-reverse-words-in-a-string](https://github.com/iceeyyy/DSA_Answers/tree/master/0151-reverse-words-in-a-string) |
| [0165-compare-version-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/0165-compare-version-numbers) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/iceeyyy/DSA_Answers/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0392-is-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0392-is-subsequence) |
| [0611-valid-triangle-number](https://github.com/iceeyyy/DSA_Answers/tree/master/0611-valid-triangle-number) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0696-count-binary-substrings](https://github.com/iceeyyy/DSA_Answers/tree/master/0696-count-binary-substrings) |
| [0875-longest-mountain-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0875-longest-mountain-in-array) |
| [1019-squares-of-a-sorted-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1019-squares-of-a-sorted-array) |
| [1129-longest-string-chain](https://github.com/iceeyyy/DSA_Answers/tree/master/1129-longest-string-chain) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/iceeyyy/DSA_Answers/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [1877-minimize-maximum-pair-sum-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1877-minimize-maximum-pair-sum-in-array) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/iceeyyy/DSA_Answers/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
| [2320-find-all-k-distant-indices-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/2320-find-all-k-distant-indices-in-an-array) |
| [2392-successful-pairs-of-spells-and-potions](https://github.com/iceeyyy/DSA_Answers/tree/master/2392-successful-pairs-of-spells-and-potions) |
| [2481-strictly-palindromic-number](https://github.com/iceeyyy/DSA_Answers/tree/master/2481-strictly-palindromic-number) |
| [2497-maximum-matching-of-players-with-trainers](https://github.com/iceeyyy/DSA_Answers/tree/master/2497-maximum-matching-of-players-with-trainers) |
| [3437-maximum-total-damage-with-spell-casting](https://github.com/iceeyyy/DSA_Answers/tree/master/3437-maximum-total-damage-with-spell-casting) |
| [3635-earliest-finish-time-for-land-and-water-rides-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3635-earliest-finish-time-for-land-and-water-rides-ii) |
| [3643-flip-square-submatrix-vertically](https://github.com/iceeyyy/DSA_Answers/tree/master/3643-flip-square-submatrix-vertically) |
| [3683-find-the-lexicographically-largest-string-from-the-box-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3683-find-the-lexicographically-largest-string-from-the-box-i) |
## Binary Search
|  |
| ------- |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/iceeyyy/DSA_Answers/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0222-count-complete-tree-nodes](https://github.com/iceeyyy/DSA_Answers/tree/master/0222-count-complete-tree-nodes) |
| [0300-longest-increasing-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0300-longest-increasing-subsequence) |
| [0367-valid-perfect-square](https://github.com/iceeyyy/DSA_Answers/tree/master/0367-valid-perfect-square) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0611-valid-triangle-number](https://github.com/iceeyyy/DSA_Answers/tree/master/0611-valid-triangle-number) |
| [0794-swim-in-rising-water](https://github.com/iceeyyy/DSA_Answers/tree/master/0794-swim-in-rising-water) |
| [0882-peak-index-in-a-mountain-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0882-peak-index-in-a-mountain-array) |
| [1351-count-negative-numbers-in-a-sorted-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/1351-count-negative-numbers-in-a-sorted-matrix) |
| [1612-avoid-flood-in-the-city](https://github.com/iceeyyy/DSA_Answers/tree/master/1612-avoid-flood-in-the-city) |
| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/iceeyyy/DSA_Answers/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |
| [1753-path-with-minimum-effort](https://github.com/iceeyyy/DSA_Answers/tree/master/1753-path-with-minimum-effort) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [2150-kth-smallest-product-of-two-sorted-arrays](https://github.com/iceeyyy/DSA_Answers/tree/master/2150-kth-smallest-product-of-two-sorted-arrays) |
| [2229-maximum-fruits-harvested-after-at-most-k-steps](https://github.com/iceeyyy/DSA_Answers/tree/master/2229-maximum-fruits-harvested-after-at-most-k-steps) |
| [2392-successful-pairs-of-spells-and-potions](https://github.com/iceeyyy/DSA_Answers/tree/master/2392-successful-pairs-of-spells-and-potions) |
| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/iceeyyy/DSA_Answers/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |
| [2618-maximize-the-minimum-powered-city](https://github.com/iceeyyy/DSA_Answers/tree/master/2618-maximize-the-minimum-powered-city) |
| [2720-minimize-the-maximum-difference-of-pairs](https://github.com/iceeyyy/DSA_Answers/tree/master/2720-minimize-the-maximum-difference-of-pairs) |
| [2812-find-the-safest-path-in-a-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/2812-find-the-safest-path-in-a-grid) |
| [3161-block-placement-queries](https://github.com/iceeyyy/DSA_Answers/tree/master/3161-block-placement-queries) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/iceeyyy/DSA_Answers/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3437-maximum-total-damage-with-spell-casting](https://github.com/iceeyyy/DSA_Answers/tree/master/3437-maximum-total-damage-with-spell-casting) |
| [3619-adjacent-increasing-subarrays-detection-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3619-adjacent-increasing-subarrays-detection-ii) |
| [3635-earliest-finish-time-for-land-and-water-rides-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3635-earliest-finish-time-for-land-and-water-rides-ii) |
| [3790-fruits-into-baskets-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3790-fruits-into-baskets-ii) |
| [3791-fruits-into-baskets-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/3791-fruits-into-baskets-iii) |
| [3827-implement-router](https://github.com/iceeyyy/DSA_Answers/tree/master/3827-implement-router) |
## Divide and Conquer
|  |
| ------- |
| [0053-maximum-subarray](https://github.com/iceeyyy/DSA_Answers/tree/master/0053-maximum-subarray) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0190-reverse-bits](https://github.com/iceeyyy/DSA_Answers/tree/master/0190-reverse-bits) |
| [0215-kth-largest-element-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0215-kth-largest-element-in-an-array) |
| [0307-range-sum-query-mutable](https://github.com/iceeyyy/DSA_Answers/tree/master/0307-range-sum-query-mutable) |
| [0347-top-k-frequent-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/0347-top-k-frequent-elements) |
| [0948-sort-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0948-sort-an-array) |
| [1014-k-closest-points-to-origin](https://github.com/iceeyyy/DSA_Answers/tree/master/1014-k-closest-points-to-origin) |
## String
|  |
| ------- |
| [0017-letter-combinations-of-a-phone-number](https://github.com/iceeyyy/DSA_Answers/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0044-wildcard-matching](https://github.com/iceeyyy/DSA_Answers/tree/master/0044-wildcard-matching) |
| [0067-add-binary](https://github.com/iceeyyy/DSA_Answers/tree/master/0067-add-binary) |
| [0071-simplify-path](https://github.com/iceeyyy/DSA_Answers/tree/master/0071-simplify-path) |
| [0072-edit-distance](https://github.com/iceeyyy/DSA_Answers/tree/master/0072-edit-distance) |
| [0079-word-search](https://github.com/iceeyyy/DSA_Answers/tree/master/0079-word-search) |
| [0115-distinct-subsequences](https://github.com/iceeyyy/DSA_Answers/tree/master/0115-distinct-subsequences) |
| [0127-word-ladder](https://github.com/iceeyyy/DSA_Answers/tree/master/0127-word-ladder) |
| [0131-palindrome-partitioning](https://github.com/iceeyyy/DSA_Answers/tree/master/0131-palindrome-partitioning) |
| [0132-palindrome-partitioning-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0132-palindrome-partitioning-ii) |
| [0151-reverse-words-in-a-string](https://github.com/iceeyyy/DSA_Answers/tree/master/0151-reverse-words-in-a-string) |
| [0165-compare-version-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/0165-compare-version-numbers) |
| [0166-fraction-to-recurring-decimal](https://github.com/iceeyyy/DSA_Answers/tree/master/0166-fraction-to-recurring-decimal) |
| [0205-isomorphic-strings](https://github.com/iceeyyy/DSA_Answers/tree/master/0205-isomorphic-strings) |
| [0208-implement-trie-prefix-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0208-implement-trie-prefix-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0392-is-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0392-is-subsequence) |
| [0451-sort-characters-by-frequency](https://github.com/iceeyyy/DSA_Answers/tree/master/0451-sort-characters-by-frequency) |
| [0474-ones-and-zeroes](https://github.com/iceeyyy/DSA_Answers/tree/master/0474-ones-and-zeroes) |
| [0516-longest-palindromic-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0516-longest-palindromic-subsequence) |
| [0583-delete-operation-for-two-strings](https://github.com/iceeyyy/DSA_Answers/tree/master/0583-delete-operation-for-two-strings) |
| [0696-count-binary-substrings](https://github.com/iceeyyy/DSA_Answers/tree/master/0696-count-binary-substrings) |
| [0721-accounts-merge](https://github.com/iceeyyy/DSA_Answers/tree/master/0721-accounts-merge) |
| [0782-jewels-and-stones](https://github.com/iceeyyy/DSA_Answers/tree/master/0782-jewels-and-stones) |
| [0796-rotate-string](https://github.com/iceeyyy/DSA_Answers/tree/master/0796-rotate-string) |
| [0944-delete-columns-to-make-sorted](https://github.com/iceeyyy/DSA_Answers/tree/master/0944-delete-columns-to-make-sorted) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/iceeyyy/DSA_Answers/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1006-vowel-spellchecker](https://github.com/iceeyyy/DSA_Answers/tree/master/1006-vowel-spellchecker) |
| [1058-lexicographically-smallest-equivalent-string](https://github.com/iceeyyy/DSA_Answers/tree/master/1058-lexicographically-smallest-equivalent-string) |
| [1081-smallest-subsequence-of-distinct-characters](https://github.com/iceeyyy/DSA_Answers/tree/master/1081-smallest-subsequence-of-distinct-characters) |
| [1129-longest-string-chain](https://github.com/iceeyyy/DSA_Answers/tree/master/1129-longest-string-chain) |
| [1160-letter-tile-possibilities](https://github.com/iceeyyy/DSA_Answers/tree/master/1160-letter-tile-possibilities) |
| [1170-shortest-common-supersequence](https://github.com/iceeyyy/DSA_Answers/tree/master/1170-shortest-common-supersequence) |
| [1197-parsing-a-boolean-expression](https://github.com/iceeyyy/DSA_Answers/tree/master/1197-parsing-a-boolean-expression) |
| [1250-longest-common-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/1250-longest-common-subsequence) |
| [1264-maximum-number-of-words-you-can-type](https://github.com/iceeyyy/DSA_Answers/tree/master/1264-maximum-number-of-words-you-can-type) |
| [1297-maximum-number-of-balloons](https://github.com/iceeyyy/DSA_Answers/tree/master/1297-maximum-number-of-balloons) |
| [1302-delete-characters-to-make-fancy-string](https://github.com/iceeyyy/DSA_Answers/tree/master/1302-delete-characters-to-make-fancy-string) |
| [1320-minimum-distance-to-type-a-word-using-two-fingers](https://github.com/iceeyyy/DSA_Answers/tree/master/1320-minimum-distance-to-type-a-word-using-two-fingers) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/iceeyyy/DSA_Answers/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1353-find-resultant-array-after-removing-anagrams](https://github.com/iceeyyy/DSA_Answers/tree/master/1353-find-resultant-array-after-removing-anagrams) |
| [1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/iceeyyy/DSA_Answers/tree/master/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |
| [1437-minimum-insertion-steps-to-make-a-string-palindrome](https://github.com/iceeyyy/DSA_Answers/tree/master/1437-minimum-insertion-steps-to-make-a-string-palindrome) |
| [1461-check-if-a-string-contains-all-binary-codes-of-size-k](https://github.com/iceeyyy/DSA_Answers/tree/master/1461-check-if-a-string-contains-all-binary-codes-of-size-k) |
| [1636-number-of-substrings-with-only-1s](https://github.com/iceeyyy/DSA_Answers/tree/master/1636-number-of-substrings-with-only-1s) |
| [1653-minimum-deletions-to-make-string-balanced](https://github.com/iceeyyy/DSA_Answers/tree/master/1653-minimum-deletions-to-make-string-balanced) |
| [1689-partitioning-into-minimum-number-of-deci-binary-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/1689-partitioning-into-minimum-number-of-deci-binary-numbers) |
| [1700-minimum-time-to-make-rope-colorful](https://github.com/iceeyyy/DSA_Answers/tree/master/1700-minimum-time-to-make-rope-colorful) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/iceeyyy/DSA_Answers/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
| [1747-lexicographically-smallest-string-after-applying-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/1747-lexicographically-smallest-string-after-applying-operations) |
| [1781-sum-of-beauty-of-all-substrings](https://github.com/iceeyyy/DSA_Answers/tree/master/1781-sum-of-beauty-of-all-substrings) |
| [1784-check-if-binary-string-has-at-most-one-segment-of-ones](https://github.com/iceeyyy/DSA_Answers/tree/master/1784-check-if-binary-string-has-at-most-one-segment-of-ones) |
| [1818-maximum-score-from-removing-substrings](https://github.com/iceeyyy/DSA_Answers/tree/master/1818-maximum-score-from-removing-substrings) |
| [1871-jump-game-vii](https://github.com/iceeyyy/DSA_Answers/tree/master/1871-jump-game-vii) |
| [1888-minimum-number-of-flips-to-make-the-binary-string-alternating](https://github.com/iceeyyy/DSA_Answers/tree/master/1888-minimum-number-of-flips-to-make-the-binary-string-alternating) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/iceeyyy/DSA_Answers/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [1930-unique-length-3-palindromic-subsequences](https://github.com/iceeyyy/DSA_Answers/tree/master/1930-unique-length-3-palindromic-subsequences) |
| [1980-find-unique-binary-string](https://github.com/iceeyyy/DSA_Answers/tree/master/1980-find-unique-binary-string) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/iceeyyy/DSA_Answers/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2075-decode-the-slanted-ciphertext](https://github.com/iceeyyy/DSA_Answers/tree/master/2075-decode-the-slanted-ciphertext) |
| [2137-final-value-of-variable-after-performing-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/2137-final-value-of-variable-after-performing-operations) |
| [2147-number-of-ways-to-divide-a-long-corridor](https://github.com/iceeyyy/DSA_Answers/tree/master/2147-number-of-ways-to-divide-a-long-corridor) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/iceeyyy/DSA_Answers/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2244-number-of-laser-beams-in-a-bank](https://github.com/iceeyyy/DSA_Answers/tree/master/2244-number-of-laser-beams-in-a-bank) |
| [2260-divide-a-string-into-groups-of-size-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2260-divide-a-string-into-groups-of-size-k) |
| [2346-largest-3-same-digit-number-in-string](https://github.com/iceeyyy/DSA_Answers/tree/master/2346-largest-3-same-digit-number-in-string) |
| [2395-longest-binary-subsequence-less-than-or-equal-to-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2395-longest-binary-subsequence-less-than-or-equal-to-k) |
| [2429-design-a-food-rating-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2429-design-a-food-rating-system) |
| [2833-furthest-point-from-origin](https://github.com/iceeyyy/DSA_Answers/tree/master/2833-furthest-point-from-origin) |
| [2839-check-if-strings-can-be-made-equal-with-operations-i](https://github.com/iceeyyy/DSA_Answers/tree/master/2839-check-if-strings-can-be-made-equal-with-operations-i) |
| [2887-sort-vowels-in-a-string](https://github.com/iceeyyy/DSA_Answers/tree/master/2887-sort-vowels-in-a-string) |
| [3120-count-the-number-of-special-characters-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3120-count-the-number-of-special-characters-i) |
| [3121-count-the-number-of-special-characters-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3121-count-the-number-of-special-characters-ii) |
| [3194-find-words-containing-character](https://github.com/iceeyyy/DSA_Answers/tree/master/3194-find-words-containing-character) |
| [3233-maximize-the-number-of-partitions-after-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/3233-maximize-the-number-of-partitions-after-operations) |
| [3360-minimum-deletions-to-make-string-k-special](https://github.com/iceeyyy/DSA_Answers/tree/master/3360-minimum-deletions-to-make-string-k-special) |
| [3396-valid-word](https://github.com/iceeyyy/DSA_Answers/tree/master/3396-valid-word) |
| [3445-lexicographically-minimum-string-after-removing-stars](https://github.com/iceeyyy/DSA_Answers/tree/master/3445-lexicographically-minimum-string-after-removing-stars) |
| [3447-clear-digits](https://github.com/iceeyyy/DSA_Answers/tree/master/3447-clear-digits) |
| [3462-vowels-game-in-a-string](https://github.com/iceeyyy/DSA_Answers/tree/master/3462-vowels-game-in-a-string) |
| [3493-maximum-number-of-operations-to-move-ones-to-the-end](https://github.com/iceeyyy/DSA_Answers/tree/master/3493-maximum-number-of-operations-to-move-ones-to-the-end) |
| [3614-process-string-with-special-operations-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3614-process-string-with-special-operations-ii) |
| [3617-find-the-original-typed-string-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3617-find-the-original-typed-string-i) |
| [3618-find-the-original-typed-string-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3618-find-the-original-typed-string-ii) |
| [3683-find-the-lexicographically-largest-string-from-the-box-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3683-find-the-lexicographically-largest-string-from-the-box-i) |
| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |
| [3754-maximum-manhattan-distance-after-k-changes](https://github.com/iceeyyy/DSA_Answers/tree/master/3754-maximum-manhattan-distance-after-k-changes) |
| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |
| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |
| [3797-design-spreadsheet](https://github.com/iceeyyy/DSA_Answers/tree/master/3797-design-spreadsheet) |
| [3838-weighted-word-mapping](https://github.com/iceeyyy/DSA_Answers/tree/master/3838-weighted-word-mapping) |
| [3872-find-most-frequent-vowel-and-consonant](https://github.com/iceeyyy/DSA_Answers/tree/master/3872-find-most-frequent-vowel-and-consonant) |
## Design
|  |
| ------- |
| [0173-binary-search-tree-iterator](https://github.com/iceeyyy/DSA_Answers/tree/master/0173-binary-search-tree-iterator) |
| [0208-implement-trie-prefix-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0208-implement-trie-prefix-tree) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0303-range-sum-query-immutable](https://github.com/iceeyyy/DSA_Answers/tree/master/0303-range-sum-query-immutable) |
| [0307-range-sum-query-mutable](https://github.com/iceeyyy/DSA_Answers/tree/master/0307-range-sum-query-mutable) |
| [0969-number-of-recent-calls](https://github.com/iceeyyy/DSA_Answers/tree/master/0969-number-of-recent-calls) |
| [1477-product-of-the-last-k-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/1477-product-of-the-last-k-numbers) |
| [1995-finding-pairs-with-a-certain-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/1995-finding-pairs-with-a-certain-sum) |
| [2023-design-movie-rental-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2023-design-movie-rental-system) |
| [2169-simple-bank-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2169-simple-bank-system) |
| [2429-design-a-food-rating-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2429-design-a-food-rating-system) |
| [2434-design-a-number-container-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2434-design-a-number-container-system) |
| [3678-design-task-manager](https://github.com/iceeyyy/DSA_Answers/tree/master/3678-design-task-manager) |
| [3797-design-spreadsheet](https://github.com/iceeyyy/DSA_Answers/tree/master/3797-design-spreadsheet) |
| [3827-implement-router](https://github.com/iceeyyy/DSA_Answers/tree/master/3827-implement-router) |
## Database
|  |
| ------- |
| [0175-combine-two-tables](https://github.com/iceeyyy/DSA_Answers/tree/master/0175-combine-two-tables) |
| [0183-customers-who-never-order](https://github.com/iceeyyy/DSA_Answers/tree/master/0183-customers-who-never-order) |
| [1179-game-play-analysis-i](https://github.com/iceeyyy/DSA_Answers/tree/master/1179-game-play-analysis-i) |
## Linked List
|  |
| ------- |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/iceeyyy/DSA_Answers/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/iceeyyy/DSA_Answers/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/iceeyyy/DSA_Answers/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
## Binary Search Tree
|  |
| ------- |
| [0098-validate-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0099-recover-binary-search-tree) |
| [0173-binary-search-tree-iterator](https://github.com/iceeyyy/DSA_Answers/tree/master/0173-binary-search-tree-iterator) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0450-delete-node-in-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0450-delete-node-in-a-bst) |
| [0530-minimum-absolute-difference-in-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0530-minimum-absolute-difference-in-bst) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/iceeyyy/DSA_Answers/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0783-search-in-a-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0784-insert-into-a-binary-search-tree) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
## Math
|  |
| ------- |
| [0029-divide-two-integers](https://github.com/iceeyyy/DSA_Answers/tree/master/0029-divide-two-integers) |
| [0062-unique-paths](https://github.com/iceeyyy/DSA_Answers/tree/master/0062-unique-paths) |
| [0067-add-binary](https://github.com/iceeyyy/DSA_Answers/tree/master/0067-add-binary) |
| [0070-climbing-stairs](https://github.com/iceeyyy/DSA_Answers/tree/master/0070-climbing-stairs) |
| [0166-fraction-to-recurring-decimal](https://github.com/iceeyyy/DSA_Answers/tree/master/0166-fraction-to-recurring-decimal) |
| [0204-count-primes](https://github.com/iceeyyy/DSA_Answers/tree/master/0204-count-primes) |
| [0231-power-of-two](https://github.com/iceeyyy/DSA_Answers/tree/master/0231-power-of-two) |
| [0326-power-of-three](https://github.com/iceeyyy/DSA_Answers/tree/master/0326-power-of-three) |
| [0342-power-of-four](https://github.com/iceeyyy/DSA_Answers/tree/master/0342-power-of-four) |
| [0367-valid-perfect-square](https://github.com/iceeyyy/DSA_Answers/tree/master/0367-valid-perfect-square) |
| [0368-largest-divisible-subset](https://github.com/iceeyyy/DSA_Answers/tree/master/0368-largest-divisible-subset) |
| [0628-maximum-product-of-three-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/0628-maximum-product-of-three-numbers) |
| [0679-24-game](https://github.com/iceeyyy/DSA_Answers/tree/master/0679-24-game) |
| [0762-prime-number-of-set-bits-in-binary-representation](https://github.com/iceeyyy/DSA_Answers/tree/master/0762-prime-number-of-set-bits-in-binary-representation) |
| [0830-largest-triangle-area](https://github.com/iceeyyy/DSA_Answers/tree/master/0830-largest-triangle-area) |
| [0900-reordered-power-of-2](https://github.com/iceeyyy/DSA_Answers/tree/master/0900-reordered-power-of-2) |
| [1013-fibonacci-number](https://github.com/iceeyyy/DSA_Answers/tree/master/1013-fibonacci-number) |
| [1014-k-closest-points-to-origin](https://github.com/iceeyyy/DSA_Answers/tree/master/1014-k-closest-points-to-origin) |
| [1015-smallest-integer-divisible-by-k](https://github.com/iceeyyy/DSA_Answers/tree/master/1015-smallest-integer-divisible-by-k) |
| [1018-largest-perimeter-triangle](https://github.com/iceeyyy/DSA_Answers/tree/master/1018-largest-perimeter-triangle) |
| [1266-minimum-time-visiting-all-points](https://github.com/iceeyyy/DSA_Answers/tree/master/1266-minimum-time-visiting-all-points) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/iceeyyy/DSA_Answers/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
| [1426-find-n-unique-integers-sum-up-to-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/1426-find-n-unique-integers-sum-up-to-zero) |
| [1440-convert-integer-to-the-sum-of-two-no-zero-integers](https://github.com/iceeyyy/DSA_Answers/tree/master/1440-convert-integer-to-the-sum-of-two-no-zero-integers) |
| [1477-product-of-the-last-k-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/1477-product-of-the-last-k-numbers) |
| [1523-count-odd-numbers-in-an-interval-range](https://github.com/iceeyyy/DSA_Answers/tree/master/1523-count-odd-numbers-in-an-interval-range) |
| [1529-max-difference-you-can-get-from-changing-an-integer](https://github.com/iceeyyy/DSA_Answers/tree/master/1529-max-difference-you-can-get-from-changing-an-integer) |
| [1636-number-of-substrings-with-only-1s](https://github.com/iceeyyy/DSA_Answers/tree/master/1636-number-of-substrings-with-only-1s) |
| [1642-water-bottles](https://github.com/iceeyyy/DSA_Answers/tree/master/1642-water-bottles) |
| [1817-calculate-money-in-leetcode-bank](https://github.com/iceeyyy/DSA_Answers/tree/master/1817-calculate-money-in-leetcode-bank) |
| [1925-count-square-sum-triples](https://github.com/iceeyyy/DSA_Answers/tree/master/1925-count-square-sum-triples) |
| [2050-count-good-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/2050-count-good-numbers) |
| [2110-number-of-smooth-descent-periods-of-a-stock](https://github.com/iceeyyy/DSA_Answers/tree/master/2110-number-of-smooth-descent-periods-of-a-stock) |
| [2147-number-of-ways-to-divide-a-long-corridor](https://github.com/iceeyyy/DSA_Answers/tree/master/2147-number-of-ways-to-divide-a-long-corridor) |
| [2174-next-greater-numerically-balanced-number](https://github.com/iceeyyy/DSA_Answers/tree/master/2174-next-greater-numerically-balanced-number) |
| [2202-sum-of-k-mirror-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/2202-sum-of-k-mirror-numbers) |
| [2244-number-of-laser-beams-in-a-bank](https://github.com/iceeyyy/DSA_Answers/tree/master/2244-number-of-laser-beams-in-a-bank) |
| [2288-count-operations-to-obtain-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/2288-count-operations-to-obtain-zero) |
| [2307-replace-non-coprime-numbers-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/2307-replace-non-coprime-numbers-in-array) |
| [2324-find-triangular-sum-of-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/2324-find-triangular-sum-of-an-array) |
| [2432-number-of-zero-filled-subarrays](https://github.com/iceeyyy/DSA_Answers/tree/master/2432-number-of-zero-filled-subarrays) |
| [2448-count-number-of-bad-pairs](https://github.com/iceeyyy/DSA_Answers/tree/master/2448-count-number-of-bad-pairs) |
| [2481-strictly-palindromic-number](https://github.com/iceeyyy/DSA_Answers/tree/master/2481-strictly-palindromic-number) |
| [2661-smallest-missing-non-negative-integer-after-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/2661-smallest-missing-non-negative-integer-after-operations) |
| [2704-maximum-difference-by-remapping-a-digit](https://github.com/iceeyyy/DSA_Answers/tree/master/2704-maximum-difference-by-remapping-a-digit) |
| [2802-find-the-punishment-number-of-an-integer](https://github.com/iceeyyy/DSA_Answers/tree/master/2802-find-the-punishment-number-of-an-integer) |
| [2946-matrix-similarity-after-cyclic-shifts](https://github.com/iceeyyy/DSA_Answers/tree/master/2946-matrix-similarity-after-cyclic-shifts) |
| [3172-divisible-and-non-divisible-sums-difference](https://github.com/iceeyyy/DSA_Answers/tree/master/3172-divisible-and-non-divisible-sums-difference) |
| [3190-find-minimum-operations-to-make-all-elements-divisible-by-three](https://github.com/iceeyyy/DSA_Answers/tree/master/3190-find-minimum-operations-to-make-all-elements-divisible-by-three) |
| [3201-distribute-candies-among-children-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3201-distribute-candies-among-children-ii) |
| [3277-find-the-number-of-ways-to-place-people-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3277-find-the-number-of-ways-to-place-people-ii) |
| [3278-find-the-number-of-ways-to-place-people-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3278-find-the-number-of-ways-to-place-people-i) |
| [3300-minimum-element-after-replacement-with-digit-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/3300-minimum-element-after-replacement-with-digit-sum) |
| [3321-type-of-triangle](https://github.com/iceeyyy/DSA_Answers/tree/master/3321-type-of-triangle) |
| [3336-water-bottles-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3336-water-bottles-ii) |
| [3432-count-partitions-with-even-sum-difference](https://github.com/iceeyyy/DSA_Answers/tree/master/3432-count-partitions-with-even-sum-difference) |
| [3462-vowels-game-in-a-string](https://github.com/iceeyyy/DSA_Answers/tree/master/3462-vowels-game-in-a-string) |
| [3536-maximum-product-of-two-digits](https://github.com/iceeyyy/DSA_Answers/tree/master/3536-maximum-product-of-two-digits) |
| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/iceeyyy/DSA_Answers/tree/master/3581-the-two-sneaky-numbers-of-digitville) |
| [3600-find-the-k-th-character-in-string-game-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3600-find-the-k-th-character-in-string-game-i) |
| [3601-find-the-k-th-character-in-string-game-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3601-find-the-k-th-character-in-string-game-ii) |
| [3623-count-number-of-trapezoids-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3623-count-number-of-trapezoids-i) |
| [3629-minimum-jumps-to-reach-end-via-prime-teleportation](https://github.com/iceeyyy/DSA_Answers/tree/master/3629-minimum-jumps-to-reach-end-via-prime-teleportation) |
| [3676-smallest-number-with-all-set-bits](https://github.com/iceeyyy/DSA_Answers/tree/master/3676-smallest-number-with-all-set-bits) |
| [3744-minimum-operations-to-make-array-elements-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/3744-minimum-operations-to-make-array-elements-zero) |
| [3751-total-waviness-of-numbers-in-range-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3751-total-waviness-of-numbers-in-range-i) |
| [3753-total-waviness-of-numbers-in-range-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3753-total-waviness-of-numbers-in-range-ii) |
| [3754-maximum-manhattan-distance-after-k-changes](https://github.com/iceeyyy/DSA_Answers/tree/master/3754-maximum-manhattan-distance-after-k-changes) |
| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |
| [3783-mirror-distance-of-an-integer](https://github.com/iceeyyy/DSA_Answers/tree/master/3783-mirror-distance-of-an-integer) |
| [3830-find-closest-person](https://github.com/iceeyyy/DSA_Answers/tree/master/3830-find-closest-person) |
| [3851-find-sum-of-array-product-of-magical-sequences](https://github.com/iceeyyy/DSA_Answers/tree/master/3851-find-sum-of-array-product-of-magical-sequences) |
## Monotonic Stack
|  |
| ------- |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/iceeyyy/DSA_Answers/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1081-smallest-subsequence-of-distinct-characters](https://github.com/iceeyyy/DSA_Answers/tree/master/1081-smallest-subsequence-of-distinct-characters) |
| [1628-count-submatrices-with-all-ones](https://github.com/iceeyyy/DSA_Answers/tree/master/1628-count-submatrices-with-all-ones) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/iceeyyy/DSA_Answers/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3834-minimum-operations-to-convert-all-elements-to-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/3834-minimum-operations-to-convert-all-elements-to-zero) |
## Counting
|  |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/0347-top-k-frequent-elements) |
| [0451-sort-characters-by-frequency](https://github.com/iceeyyy/DSA_Answers/tree/master/0451-sort-characters-by-frequency) |
| [0594-longest-harmonious-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0594-longest-harmonious-subsequence) |
| [0621-task-scheduler](https://github.com/iceeyyy/DSA_Answers/tree/master/0621-task-scheduler) |
| [0900-reordered-power-of-2](https://github.com/iceeyyy/DSA_Answers/tree/master/0900-reordered-power-of-2) |
| [1160-letter-tile-possibilities](https://github.com/iceeyyy/DSA_Answers/tree/master/1160-letter-tile-possibilities) |
| [1297-maximum-number-of-balloons](https://github.com/iceeyyy/DSA_Answers/tree/master/1297-maximum-number-of-balloons) |
| [1356-sort-integers-by-the-number-of-1-bits](https://github.com/iceeyyy/DSA_Answers/tree/master/1356-sort-integers-by-the-number-of-1-bits) |
| [1364-tuple-with-same-product](https://github.com/iceeyyy/DSA_Answers/tree/master/1364-tuple-with-same-product) |
| [1510-find-lucky-integer-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1510-find-lucky-integer-in-an-array) |
| [1781-sum-of-beauty-of-all-substrings](https://github.com/iceeyyy/DSA_Answers/tree/master/1781-sum-of-beauty-of-all-substrings) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/iceeyyy/DSA_Answers/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [2174-next-greater-numerically-balanced-number](https://github.com/iceeyyy/DSA_Answers/tree/master/2174-next-greater-numerically-balanced-number) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/iceeyyy/DSA_Answers/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2448-count-number-of-bad-pairs](https://github.com/iceeyyy/DSA_Answers/tree/master/2448-count-number-of-bad-pairs) |
| [2833-furthest-point-from-origin](https://github.com/iceeyyy/DSA_Answers/tree/master/2833-furthest-point-from-origin) |
| [3242-count-elements-with-maximum-frequency](https://github.com/iceeyyy/DSA_Answers/tree/master/3242-count-elements-with-maximum-frequency) |
| [3360-minimum-deletions-to-make-string-k-special](https://github.com/iceeyyy/DSA_Answers/tree/master/3360-minimum-deletions-to-make-string-k-special) |
| [3437-maximum-total-damage-with-spell-casting](https://github.com/iceeyyy/DSA_Answers/tree/master/3437-maximum-total-damage-with-spell-casting) |
| [3493-maximum-number-of-operations-to-move-ones-to-the-end](https://github.com/iceeyyy/DSA_Answers/tree/master/3493-maximum-number-of-operations-to-move-ones-to-the-end) |
| [3583-count-special-triplets](https://github.com/iceeyyy/DSA_Answers/tree/master/3583-count-special-triplets) |
| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |
| [3754-maximum-manhattan-distance-after-k-changes](https://github.com/iceeyyy/DSA_Answers/tree/master/3754-maximum-manhattan-distance-after-k-changes) |
| [3872-find-most-frequent-vowel-and-consonant](https://github.com/iceeyyy/DSA_Answers/tree/master/3872-find-most-frequent-vowel-and-consonant) |
## Iterator
|  |
| ------- |
| [0173-binary-search-tree-iterator](https://github.com/iceeyyy/DSA_Answers/tree/master/0173-binary-search-tree-iterator) |
## Simulation
|  |
| ------- |
| [0067-add-binary](https://github.com/iceeyyy/DSA_Answers/tree/master/0067-add-binary) |
| [0498-diagonal-traverse](https://github.com/iceeyyy/DSA_Answers/tree/master/0498-diagonal-traverse) |
| [0682-baseball-game](https://github.com/iceeyyy/DSA_Answers/tree/master/0682-baseball-game) |
| [0735-asteroid-collision](https://github.com/iceeyyy/DSA_Answers/tree/master/0735-asteroid-collision) |
| [0874-walking-robot-simulation](https://github.com/iceeyyy/DSA_Answers/tree/master/0874-walking-robot-simulation) |
| [1642-water-bottles](https://github.com/iceeyyy/DSA_Answers/tree/master/1642-water-bottles) |
| [1914-cyclically-rotating-a-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/1914-cyclically-rotating-a-grid) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/iceeyyy/DSA_Answers/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2075-decode-the-slanted-ciphertext](https://github.com/iceeyyy/DSA_Answers/tree/master/2075-decode-the-slanted-ciphertext) |
| [2137-final-value-of-variable-after-performing-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/2137-final-value-of-variable-after-performing-operations) |
| [2169-simple-bank-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2169-simple-bank-system) |
| [2260-divide-a-string-into-groups-of-size-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2260-divide-a-string-into-groups-of-size-k) |
| [2274-keep-multiplying-found-values-by-two](https://github.com/iceeyyy/DSA_Answers/tree/master/2274-keep-multiplying-found-values-by-two) |
| [2288-count-operations-to-obtain-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/2288-count-operations-to-obtain-zero) |
| [2324-find-triangular-sum-of-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/2324-find-triangular-sum-of-an-array) |
| [2408-number-of-people-aware-of-a-secret](https://github.com/iceeyyy/DSA_Answers/tree/master/2408-number-of-people-aware-of-a-secret) |
| [2479-meeting-rooms-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/2479-meeting-rooms-iii) |
| [2946-matrix-similarity-after-cyclic-shifts](https://github.com/iceeyyy/DSA_Answers/tree/master/2946-matrix-similarity-after-cyclic-shifts) |
| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |
| [3336-water-bottles-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3336-water-bottles-ii) |
| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/iceeyyy/DSA_Answers/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |
| [3447-clear-digits](https://github.com/iceeyyy/DSA_Answers/tree/master/3447-clear-digits) |
| [3600-find-the-k-th-character-in-string-game-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3600-find-the-k-th-character-in-string-game-i) |
| [3614-process-string-with-special-operations-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3614-process-string-with-special-operations-ii) |
| [3616-make-array-elements-equal-to-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/3616-make-array-elements-equal-to-zero) |
| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |
| [3790-fruits-into-baskets-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3790-fruits-into-baskets-ii) |
| [3794-find-the-minimum-amount-of-time-to-brew-potions](https://github.com/iceeyyy/DSA_Answers/tree/master/3794-find-the-minimum-amount-of-time-to-brew-potions) |
| [3838-weighted-word-mapping](https://github.com/iceeyyy/DSA_Answers/tree/master/3838-weighted-word-mapping) |
## Heap (Priority Queue)
|  |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/0347-top-k-frequent-elements) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0407-trapping-rain-water-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0407-trapping-rain-water-ii) |
| [0451-sort-characters-by-frequency](https://github.com/iceeyyy/DSA_Answers/tree/master/0451-sort-characters-by-frequency) |
| [0621-task-scheduler](https://github.com/iceeyyy/DSA_Answers/tree/master/0621-task-scheduler) |
| [0744-network-delay-time](https://github.com/iceeyyy/DSA_Answers/tree/master/0744-network-delay-time) |
| [0794-swim-in-rising-water](https://github.com/iceeyyy/DSA_Answers/tree/master/0794-swim-in-rising-water) |
| [0803-cheapest-flights-within-k-stops](https://github.com/iceeyyy/DSA_Answers/tree/master/0803-cheapest-flights-within-k-stops) |
| [0948-sort-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0948-sort-an-array) |
| [1014-k-closest-points-to-origin](https://github.com/iceeyyy/DSA_Answers/tree/master/1014-k-closest-points-to-origin) |
| [1127-last-stone-weight](https://github.com/iceeyyy/DSA_Answers/tree/master/1127-last-stone-weight) |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/iceeyyy/DSA_Answers/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
| [1612-avoid-flood-in-the-city](https://github.com/iceeyyy/DSA_Answers/tree/master/1612-avoid-flood-in-the-city) |
| [1753-path-with-minimum-effort](https://github.com/iceeyyy/DSA_Answers/tree/master/1753-path-with-minimum-effort) |
| [1917-maximum-average-pass-ratio](https://github.com/iceeyyy/DSA_Answers/tree/master/1917-maximum-average-pass-ratio) |
| [2023-design-movie-rental-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2023-design-movie-rental-system) |
| [2204-find-subsequence-of-length-k-with-the-largest-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/2204-find-subsequence-of-length-k-with-the-largest-sum) |
| [2267-minimum-difference-in-sums-after-removal-of-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/2267-minimum-difference-in-sums-after-removal-of-elements) |
| [2429-design-a-food-rating-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2429-design-a-food-rating-system) |
| [2434-design-a-number-container-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2434-design-a-number-container-system) |
| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/iceeyyy/DSA_Answers/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |
| [2479-meeting-rooms-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/2479-meeting-rooms-iii) |
| [2812-find-the-safest-path-in-a-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/2812-find-the-safest-path-in-a-grid) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/iceeyyy/DSA_Answers/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |
| [3445-lexicographically-minimum-string-after-removing-stars](https://github.com/iceeyyy/DSA_Answers/tree/master/3445-lexicographically-minimum-string-after-removing-stars) |
| [3592-find-x-sum-of-all-k-long-subarrays-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3592-find-x-sum-of-all-k-long-subarrays-ii) |
| [3610-find-x-sum-of-all-k-long-subarrays-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3610-find-x-sum-of-all-k-long-subarrays-i) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
| [3650-minimum-cost-path-with-edge-reversals](https://github.com/iceeyyy/DSA_Answers/tree/master/3650-minimum-cost-path-with-edge-reversals) |
| [3678-design-task-manager](https://github.com/iceeyyy/DSA_Answers/tree/master/3678-design-task-manager) |
| [3863-power-grid-maintenance](https://github.com/iceeyyy/DSA_Answers/tree/master/3863-power-grid-maintenance) |
## Ordered Set
|  |
| ------- |
| [2023-design-movie-rental-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2023-design-movie-rental-system) |
| [2429-design-a-food-rating-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2429-design-a-food-rating-system) |
| [2434-design-a-number-container-system](https://github.com/iceeyyy/DSA_Answers/tree/master/2434-design-a-number-container-system) |
| [3678-design-task-manager](https://github.com/iceeyyy/DSA_Answers/tree/master/3678-design-task-manager) |
| [3790-fruits-into-baskets-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3790-fruits-into-baskets-ii) |
| [3791-fruits-into-baskets-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/3791-fruits-into-baskets-iii) |
| [3827-implement-router](https://github.com/iceeyyy/DSA_Answers/tree/master/3827-implement-router) |
| [3863-power-grid-maintenance](https://github.com/iceeyyy/DSA_Answers/tree/master/3863-power-grid-maintenance) |
## Quickselect
|  |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/0347-top-k-frequent-elements) |
| [1014-k-closest-points-to-origin](https://github.com/iceeyyy/DSA_Answers/tree/master/1014-k-closest-points-to-origin) |
## Union Find
|  |
| ------- |
| [0130-surrounded-regions](https://github.com/iceeyyy/DSA_Answers/tree/master/0130-surrounded-regions) |
| [0200-number-of-islands](https://github.com/iceeyyy/DSA_Answers/tree/master/0200-number-of-islands) |
| [0547-number-of-provinces](https://github.com/iceeyyy/DSA_Answers/tree/master/0547-number-of-provinces) |
| [0695-max-area-of-island](https://github.com/iceeyyy/DSA_Answers/tree/master/0695-max-area-of-island) |
| [0721-accounts-merge](https://github.com/iceeyyy/DSA_Answers/tree/master/0721-accounts-merge) |
| [0794-swim-in-rising-water](https://github.com/iceeyyy/DSA_Answers/tree/master/0794-swim-in-rising-water) |
| [0801-is-graph-bipartite](https://github.com/iceeyyy/DSA_Answers/tree/master/0801-is-graph-bipartite) |
| [0854-making-a-large-island](https://github.com/iceeyyy/DSA_Answers/tree/master/0854-making-a-large-island) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/iceeyyy/DSA_Answers/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1058-lexicographically-smallest-equivalent-string](https://github.com/iceeyyy/DSA_Answers/tree/master/1058-lexicographically-smallest-equivalent-string) |
| [1073-number-of-enclaves](https://github.com/iceeyyy/DSA_Answers/tree/master/1073-number-of-enclaves) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/iceeyyy/DSA_Answers/tree/master/1442-number-of-operations-to-make-network-connected) |
| [1706-min-cost-to-connect-all-points](https://github.com/iceeyyy/DSA_Answers/tree/master/1706-min-cost-to-connect-all-points) |
| [1753-path-with-minimum-effort](https://github.com/iceeyyy/DSA_Answers/tree/master/1753-path-with-minimum-effort) |
| [2121-find-if-path-exists-in-graph](https://github.com/iceeyyy/DSA_Answers/tree/master/2121-find-if-path-exists-in-graph) |
| [3863-power-grid-maintenance](https://github.com/iceeyyy/DSA_Answers/tree/master/3863-power-grid-maintenance) |
## Graph
|  |
| ------- |
| [0207-course-schedule](https://github.com/iceeyyy/DSA_Answers/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0210-course-schedule-ii) |
| [0547-number-of-provinces](https://github.com/iceeyyy/DSA_Answers/tree/master/0547-number-of-provinces) |
| [0744-network-delay-time](https://github.com/iceeyyy/DSA_Answers/tree/master/0744-network-delay-time) |
| [0801-is-graph-bipartite](https://github.com/iceeyyy/DSA_Answers/tree/master/0801-is-graph-bipartite) |
| [0803-cheapest-flights-within-k-stops](https://github.com/iceeyyy/DSA_Answers/tree/master/0803-cheapest-flights-within-k-stops) |
| [0820-find-eventual-safe-states](https://github.com/iceeyyy/DSA_Answers/tree/master/0820-find-eventual-safe-states) |
| [0871-keys-and-rooms](https://github.com/iceeyyy/DSA_Answers/tree/master/0871-keys-and-rooms) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/iceeyyy/DSA_Answers/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1300-critical-connections-in-a-network](https://github.com/iceeyyy/DSA_Answers/tree/master/1300-critical-connections-in-a-network) |
| [1424-maximum-candies-you-can-get-from-boxes](https://github.com/iceeyyy/DSA_Answers/tree/master/1424-maximum-candies-you-can-get-from-boxes) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/iceeyyy/DSA_Answers/tree/master/1442-number-of-operations-to-make-network-connected) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/iceeyyy/DSA_Answers/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [1706-min-cost-to-connect-all-points](https://github.com/iceeyyy/DSA_Answers/tree/master/1706-min-cost-to-connect-all-points) |
| [2121-find-if-path-exists-in-graph](https://github.com/iceeyyy/DSA_Answers/tree/master/2121-find-if-path-exists-in-graph) |
| [2438-find-closest-node-to-given-two-nodes](https://github.com/iceeyyy/DSA_Answers/tree/master/2438-find-closest-node-to-given-two-nodes) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
| [3863-power-grid-maintenance](https://github.com/iceeyyy/DSA_Answers/tree/master/3863-power-grid-maintenance) |
## Data Stream
|  |
| ------- |
| [0969-number-of-recent-calls](https://github.com/iceeyyy/DSA_Answers/tree/master/0969-number-of-recent-calls) |
| [1477-product-of-the-last-k-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/1477-product-of-the-last-k-numbers) |
## Prefix Sum
|  |
| ------- |
| [0238-product-of-array-except-self](https://github.com/iceeyyy/DSA_Answers/tree/master/0238-product-of-array-except-self) |
| [0303-range-sum-query-immutable](https://github.com/iceeyyy/DSA_Answers/tree/master/0303-range-sum-query-immutable) |
| [1477-product-of-the-last-k-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/1477-product-of-the-last-k-numbers) |
| [1590-make-sum-divisible-by-p](https://github.com/iceeyyy/DSA_Answers/tree/master/1590-make-sum-divisible-by-p) |
| [1871-jump-game-vii](https://github.com/iceeyyy/DSA_Answers/tree/master/1871-jump-game-vii) |
| [1895-largest-magic-square](https://github.com/iceeyyy/DSA_Answers/tree/master/1895-largest-magic-square) |
| [1930-unique-length-3-palindromic-subsequences](https://github.com/iceeyyy/DSA_Answers/tree/master/1930-unique-length-3-palindromic-subsequences) |
| [2229-maximum-fruits-harvested-after-at-most-k-steps](https://github.com/iceeyyy/DSA_Answers/tree/master/2229-maximum-fruits-harvested-after-at-most-k-steps) |
| [2529-range-product-queries-of-powers](https://github.com/iceeyyy/DSA_Answers/tree/master/2529-range-product-queries-of-powers) |
| [2574-left-and-right-sum-differences](https://github.com/iceeyyy/DSA_Answers/tree/master/2574-left-and-right-sum-differences) |
| [2618-maximize-the-minimum-powered-city](https://github.com/iceeyyy/DSA_Answers/tree/master/2618-maximize-the-minimum-powered-city) |
| [2625-increment-submatrices-by-one](https://github.com/iceeyyy/DSA_Answers/tree/master/2625-increment-submatrices-by-one) |
| [3381-maximum-subarray-sum-with-length-divisible-by-k](https://github.com/iceeyyy/DSA_Answers/tree/master/3381-maximum-subarray-sum-with-length-divisible-by-k) |
| [3383-taking-maximum-energy-from-the-mystic-dungeon](https://github.com/iceeyyy/DSA_Answers/tree/master/3383-taking-maximum-energy-from-the-mystic-dungeon) |
| [3432-count-partitions-with-even-sum-difference](https://github.com/iceeyyy/DSA_Answers/tree/master/3432-count-partitions-with-even-sum-difference) |
| [3616-make-array-elements-equal-to-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/3616-make-array-elements-equal-to-zero) |
| [3618-find-the-original-typed-string-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3618-find-the-original-typed-string-ii) |
| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |
| [3789-maximize-subarrays-after-removing-one-conflicting-pair](https://github.com/iceeyyy/DSA_Answers/tree/master/3789-maximize-subarrays-after-removing-one-conflicting-pair) |
| [3794-find-the-minimum-amount-of-time-to-brew-potions](https://github.com/iceeyyy/DSA_Answers/tree/master/3794-find-the-minimum-amount-of-time-to-brew-potions) |
## Matrix
|  |
| ------- |
| [0036-valid-sudoku](https://github.com/iceeyyy/DSA_Answers/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/iceeyyy/DSA_Answers/tree/master/0037-sudoku-solver) |
| [0063-unique-paths-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0064-minimum-path-sum) |
| [0079-word-search](https://github.com/iceeyyy/DSA_Answers/tree/master/0079-word-search) |
| [0130-surrounded-regions](https://github.com/iceeyyy/DSA_Answers/tree/master/0130-surrounded-regions) |
| [0200-number-of-islands](https://github.com/iceeyyy/DSA_Answers/tree/master/0200-number-of-islands) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0407-trapping-rain-water-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0407-trapping-rain-water-ii) |
| [0417-pacific-atlantic-water-flow](https://github.com/iceeyyy/DSA_Answers/tree/master/0417-pacific-atlantic-water-flow) |
| [0498-diagonal-traverse](https://github.com/iceeyyy/DSA_Answers/tree/master/0498-diagonal-traverse) |
| [0542-01-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/0542-01-matrix) |
| [0695-max-area-of-island](https://github.com/iceeyyy/DSA_Answers/tree/master/0695-max-area-of-island) |
| [0733-flood-fill](https://github.com/iceeyyy/DSA_Answers/tree/master/0733-flood-fill) |
| [0794-swim-in-rising-water](https://github.com/iceeyyy/DSA_Answers/tree/master/0794-swim-in-rising-water) |
| [0854-making-a-large-island](https://github.com/iceeyyy/DSA_Answers/tree/master/0854-making-a-large-island) |
| [0967-minimum-falling-path-sum](https://github.com/iceeyyy/DSA_Answers/tree/master/0967-minimum-falling-path-sum) |
| [1036-rotting-oranges](https://github.com/iceeyyy/DSA_Answers/tree/master/1036-rotting-oranges) |
| [1073-number-of-enclaves](https://github.com/iceeyyy/DSA_Answers/tree/master/1073-number-of-enclaves) |
| [1171-shortest-path-in-binary-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/1171-shortest-path-in-binary-matrix) |
| [1351-count-negative-numbers-in-a-sorted-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/1351-count-negative-numbers-in-a-sorted-matrix) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/iceeyyy/DSA_Answers/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1559-detect-cycles-in-2d-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/1559-detect-cycles-in-2d-grid) |
| [1582-special-positions-in-a-binary-matrix](https://github.com/iceeyyy/DSA_Answers/tree/master/1582-special-positions-in-a-binary-matrix) |
| [1628-count-submatrices-with-all-ones](https://github.com/iceeyyy/DSA_Answers/tree/master/1628-count-submatrices-with-all-ones) |
| [1727-largest-submatrix-with-rearrangements](https://github.com/iceeyyy/DSA_Answers/tree/master/1727-largest-submatrix-with-rearrangements) |
| [1753-path-with-minimum-effort](https://github.com/iceeyyy/DSA_Answers/tree/master/1753-path-with-minimum-effort) |
| [1886-determine-whether-matrix-can-be-obtained-by-rotation](https://github.com/iceeyyy/DSA_Answers/tree/master/1886-determine-whether-matrix-can-be-obtained-by-rotation) |
| [1895-largest-magic-square](https://github.com/iceeyyy/DSA_Answers/tree/master/1895-largest-magic-square) |
| [1914-cyclically-rotating-a-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/1914-cyclically-rotating-a-grid) |
| [2038-nearest-exit-from-entrance-in-maze](https://github.com/iceeyyy/DSA_Answers/tree/master/2038-nearest-exit-from-entrance-in-maze) |
| [2244-number-of-laser-beams-in-a-bank](https://github.com/iceeyyy/DSA_Answers/tree/master/2244-number-of-laser-beams-in-a-bank) |
| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |
| [2435-paths-in-matrix-whose-sum-is-divisible-by-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2435-paths-in-matrix-whose-sum-is-divisible-by-k) |
| [2625-increment-submatrices-by-one](https://github.com/iceeyyy/DSA_Answers/tree/master/2625-increment-submatrices-by-one) |
| [2812-find-the-safest-path-in-a-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/2812-find-the-safest-path-in-a-grid) |
| [2946-matrix-similarity-after-cyclic-shifts](https://github.com/iceeyyy/DSA_Answers/tree/master/2946-matrix-similarity-after-cyclic-shifts) |
| [3418-maximum-amount-of-money-robot-can-earn](https://github.com/iceeyyy/DSA_Answers/tree/master/3418-maximum-amount-of-money-robot-can-earn) |
| [3459-find-the-minimum-area-to-cover-all-ones-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3459-find-the-minimum-area-to-cover-all-ones-ii) |
| [3461-find-the-minimum-area-to-cover-all-ones-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3461-find-the-minimum-area-to-cover-all-ones-i) |
| [3567-minimum-absolute-difference-in-sliding-submatrix](https://github.com/iceeyyy/DSA_Answers/tree/master/3567-minimum-absolute-difference-in-sliding-submatrix) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
| [3643-flip-square-submatrix-vertically](https://github.com/iceeyyy/DSA_Answers/tree/master/3643-flip-square-submatrix-vertically) |
| [3648-find-the-maximum-number-of-fruits-collected](https://github.com/iceeyyy/DSA_Answers/tree/master/3648-find-the-maximum-number-of-fruits-collected) |
| [3733-length-of-longest-v-shaped-diagonal-segment](https://github.com/iceeyyy/DSA_Answers/tree/master/3733-length-of-longest-v-shaped-diagonal-segment) |
| [3748-sort-matrix-by-diagonals](https://github.com/iceeyyy/DSA_Answers/tree/master/3748-sort-matrix-by-diagonals) |
| [3797-design-spreadsheet](https://github.com/iceeyyy/DSA_Answers/tree/master/3797-design-spreadsheet) |
## Topological Sort
|  |
| ------- |
| [0207-course-schedule](https://github.com/iceeyyy/DSA_Answers/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0210-course-schedule-ii) |
| [0820-find-eventual-safe-states](https://github.com/iceeyyy/DSA_Answers/tree/master/0820-find-eventual-safe-states) |
## Shortest Path
|  |
| ------- |
| [0744-network-delay-time](https://github.com/iceeyyy/DSA_Answers/tree/master/0744-network-delay-time) |
| [0803-cheapest-flights-within-k-stops](https://github.com/iceeyyy/DSA_Answers/tree/master/0803-cheapest-flights-within-k-stops) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/iceeyyy/DSA_Answers/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
| [3650-minimum-cost-path-with-edge-reversals](https://github.com/iceeyyy/DSA_Answers/tree/master/3650-minimum-cost-path-with-edge-reversals) |
## Concurrency
|  |
| ------- |
| [1203-print-in-order](https://github.com/iceeyyy/DSA_Answers/tree/master/1203-print-in-order) |
## Minimum Spanning Tree
|  |
| ------- |
| [1706-min-cost-to-connect-all-points](https://github.com/iceeyyy/DSA_Answers/tree/master/1706-min-cost-to-connect-all-points) |
## Biconnected Component
|  |
| ------- |
| [1300-critical-connections-in-a-network](https://github.com/iceeyyy/DSA_Answers/tree/master/1300-critical-connections-in-a-network) |
## Bucket Sort
|  |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/iceeyyy/DSA_Answers/tree/master/0347-top-k-frequent-elements) |
| [0451-sort-characters-by-frequency](https://github.com/iceeyyy/DSA_Answers/tree/master/0451-sort-characters-by-frequency) |
| [0948-sort-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0948-sort-an-array) |
## Geometry
|  |
| ------- |
| [0830-largest-triangle-area](https://github.com/iceeyyy/DSA_Answers/tree/master/0830-largest-triangle-area) |
| [1014-k-closest-points-to-origin](https://github.com/iceeyyy/DSA_Answers/tree/master/1014-k-closest-points-to-origin) |
| [1266-minimum-time-visiting-all-points](https://github.com/iceeyyy/DSA_Answers/tree/master/1266-minimum-time-visiting-all-points) |
| [3277-find-the-number-of-ways-to-place-people-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3277-find-the-number-of-ways-to-place-people-ii) |
| [3278-find-the-number-of-ways-to-place-people-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3278-find-the-number-of-ways-to-place-people-i) |
| [3623-count-number-of-trapezoids-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3623-count-number-of-trapezoids-i) |
## Greedy
|  |
| ------- |
| [0011-container-with-most-water](https://github.com/iceeyyy/DSA_Answers/tree/master/0011-container-with-most-water) |
| [0044-wildcard-matching](https://github.com/iceeyyy/DSA_Answers/tree/master/0044-wildcard-matching) |
| [0055-jump-game](https://github.com/iceeyyy/DSA_Answers/tree/master/0055-jump-game) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0135-candy](https://github.com/iceeyyy/DSA_Answers/tree/master/0135-candy) |
| [0605-can-place-flowers](https://github.com/iceeyyy/DSA_Answers/tree/master/0605-can-place-flowers) |
| [0611-valid-triangle-number](https://github.com/iceeyyy/DSA_Answers/tree/master/0611-valid-triangle-number) |
| [0621-task-scheduler](https://github.com/iceeyyy/DSA_Answers/tree/master/0621-task-scheduler) |
| [0714-best-time-to-buy-and-sell-stock-with-transaction-fee](https://github.com/iceeyyy/DSA_Answers/tree/master/0714-best-time-to-buy-and-sell-stock-with-transaction-fee) |
| [0759-set-intersection-size-at-least-two](https://github.com/iceeyyy/DSA_Answers/tree/master/0759-set-intersection-size-at-least-two) |
| [0876-hand-of-straights](https://github.com/iceeyyy/DSA_Answers/tree/master/0876-hand-of-straights) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/iceeyyy/DSA_Answers/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1018-largest-perimeter-triangle](https://github.com/iceeyyy/DSA_Answers/tree/master/1018-largest-perimeter-triangle) |
| [1081-smallest-subsequence-of-distinct-characters](https://github.com/iceeyyy/DSA_Answers/tree/master/1081-smallest-subsequence-of-distinct-characters) |
| [1262-greatest-sum-divisible-by-three](https://github.com/iceeyyy/DSA_Answers/tree/master/1262-greatest-sum-divisible-by-three) |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/iceeyyy/DSA_Answers/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
| [1529-max-difference-you-can-get-from-changing-an-integer](https://github.com/iceeyyy/DSA_Answers/tree/master/1529-max-difference-you-can-get-from-changing-an-integer) |
| [1612-avoid-flood-in-the-city](https://github.com/iceeyyy/DSA_Answers/tree/master/1612-avoid-flood-in-the-city) |
| [1689-partitioning-into-minimum-number-of-deci-binary-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/1689-partitioning-into-minimum-number-of-deci-binary-numbers) |
| [1700-minimum-time-to-make-rope-colorful](https://github.com/iceeyyy/DSA_Answers/tree/master/1700-minimum-time-to-make-rope-colorful) |
| [1727-largest-submatrix-with-rearrangements](https://github.com/iceeyyy/DSA_Answers/tree/master/1727-largest-submatrix-with-rearrangements) |
| [1818-maximum-score-from-removing-substrings](https://github.com/iceeyyy/DSA_Answers/tree/master/1818-maximum-score-from-removing-substrings) |
| [1833-maximum-ice-cream-bars](https://github.com/iceeyyy/DSA_Answers/tree/master/1833-maximum-ice-cream-bars) |
| [1834-minimum-number-of-people-to-teach](https://github.com/iceeyyy/DSA_Answers/tree/master/1834-minimum-number-of-people-to-teach) |
| [1877-minimize-maximum-pair-sum-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1877-minimize-maximum-pair-sum-in-array) |
| [1917-maximum-average-pass-ratio](https://github.com/iceeyyy/DSA_Answers/tree/master/1917-maximum-average-pass-ratio) |
| [2126-destroying-asteroids](https://github.com/iceeyyy/DSA_Answers/tree/master/2126-destroying-asteroids) |
| [2144-minimum-cost-of-buying-candies-with-discount](https://github.com/iceeyyy/DSA_Answers/tree/master/2144-minimum-cost-of-buying-candies-with-discount) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/iceeyyy/DSA_Answers/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2387-partition-array-such-that-maximum-difference-is-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2387-partition-array-such-that-maximum-difference-is-k) |
| [2395-longest-binary-subsequence-less-than-or-equal-to-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2395-longest-binary-subsequence-less-than-or-equal-to-k) |
| [2497-maximum-matching-of-players-with-trainers](https://github.com/iceeyyy/DSA_Answers/tree/master/2497-maximum-matching-of-players-with-trainers) |
| [2618-maximize-the-minimum-powered-city](https://github.com/iceeyyy/DSA_Answers/tree/master/2618-maximize-the-minimum-powered-city) |
| [2661-smallest-missing-non-negative-integer-after-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/2661-smallest-missing-non-negative-integer-after-operations) |
| [2689-rearranging-fruits](https://github.com/iceeyyy/DSA_Answers/tree/master/2689-rearranging-fruits) |
| [2704-maximum-difference-by-remapping-a-digit](https://github.com/iceeyyy/DSA_Answers/tree/master/2704-maximum-difference-by-remapping-a-digit) |
| [2720-minimize-the-maximum-difference-of-pairs](https://github.com/iceeyyy/DSA_Answers/tree/master/2720-minimize-the-maximum-difference-of-pairs) |
| [3074-apple-redistribution-into-boxes](https://github.com/iceeyyy/DSA_Answers/tree/master/3074-apple-redistribution-into-boxes) |
| [3241-divide-array-into-arrays-with-max-difference](https://github.com/iceeyyy/DSA_Answers/tree/master/3241-divide-array-into-arrays-with-max-difference) |
| [3360-minimum-deletions-to-make-string-k-special](https://github.com/iceeyyy/DSA_Answers/tree/master/3360-minimum-deletions-to-make-string-k-special) |
| [3445-lexicographically-minimum-string-after-removing-stars](https://github.com/iceeyyy/DSA_Answers/tree/master/3445-lexicographically-minimum-string-after-removing-stars) |
| [3493-maximum-number-of-operations-to-move-ones-to-the-end](https://github.com/iceeyyy/DSA_Answers/tree/master/3493-maximum-number-of-operations-to-move-ones-to-the-end) |
| [3620-maximum-number-of-distinct-elements-after-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/3620-maximum-number-of-distinct-elements-after-operations) |
| [3635-earliest-finish-time-for-land-and-water-rides-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3635-earliest-finish-time-for-land-and-water-rides-ii) |
| [3689-maximum-total-subarray-value-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3689-maximum-total-subarray-value-i) |
| [3741-reschedule-meetings-for-maximum-free-time-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3741-reschedule-meetings-for-maximum-free-time-ii) |
| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |
| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/iceeyyy/DSA_Answers/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |
| [3834-minimum-operations-to-convert-all-elements-to-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/3834-minimum-operations-to-convert-all-elements-to-zero) |
## Sliding Window
|  |
| ------- |
| [0594-longest-harmonious-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0594-longest-harmonious-subsequence) |
| [0643-maximum-average-subarray-i](https://github.com/iceeyyy/DSA_Answers/tree/master/0643-maximum-average-subarray-i) |
| [0940-fruit-into-baskets](https://github.com/iceeyyy/DSA_Answers/tree/master/0940-fruit-into-baskets) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/iceeyyy/DSA_Answers/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1813-maximum-erasure-value](https://github.com/iceeyyy/DSA_Answers/tree/master/1813-maximum-erasure-value) |
| [1871-jump-game-vii](https://github.com/iceeyyy/DSA_Answers/tree/master/1871-jump-game-vii) |
| [1888-minimum-number-of-flips-to-make-the-binary-string-alternating](https://github.com/iceeyyy/DSA_Answers/tree/master/1888-minimum-number-of-flips-to-make-the-binary-string-alternating) |
| [1984-minimum-difference-between-highest-and-lowest-of-k-scores](https://github.com/iceeyyy/DSA_Answers/tree/master/1984-minimum-difference-between-highest-and-lowest-of-k-scores) |
| [2229-maximum-fruits-harvested-after-at-most-k-steps](https://github.com/iceeyyy/DSA_Answers/tree/master/2229-maximum-fruits-harvested-after-at-most-k-steps) |
| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/iceeyyy/DSA_Answers/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |
| [2618-maximize-the-minimum-powered-city](https://github.com/iceeyyy/DSA_Answers/tree/master/2618-maximize-the-minimum-powered-city) |
| [3592-find-x-sum-of-all-k-long-subarrays-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3592-find-x-sum-of-all-k-long-subarrays-ii) |
| [3610-find-x-sum-of-all-k-long-subarrays-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3610-find-x-sum-of-all-k-long-subarrays-i) |
| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |
| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |
## Merge Sort
|  |
| ------- |
| [0948-sort-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0948-sort-an-array) |
## Radix Sort
|  |
| ------- |
| [0948-sort-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0948-sort-an-array) |
## Counting Sort
|  |
| ------- |
| [0948-sort-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0948-sort-an-array) |
| [1833-maximum-ice-cream-bars](https://github.com/iceeyyy/DSA_Answers/tree/master/1833-maximum-ice-cream-bars) |
## Combinatorics
|  |
| ------- |
| [0062-unique-paths](https://github.com/iceeyyy/DSA_Answers/tree/master/0062-unique-paths) |
| [2324-find-triangular-sum-of-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/2324-find-triangular-sum-of-an-array) |
| [3201-distribute-candies-among-children-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3201-distribute-candies-among-children-ii) |
| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |
| [3851-find-sum-of-array-product-of-magical-sequences](https://github.com/iceeyyy/DSA_Answers/tree/master/3851-find-sum-of-array-product-of-magical-sequences) |
## Memoization
|  |
| ------- |
| [0070-climbing-stairs](https://github.com/iceeyyy/DSA_Answers/tree/master/0070-climbing-stairs) |
| [1013-fibonacci-number](https://github.com/iceeyyy/DSA_Answers/tree/master/1013-fibonacci-number) |
| [1732-minimum-one-bit-operations-to-make-integers-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/1732-minimum-one-bit-operations-to-make-integers-zero) |
| [2028-the-earliest-and-latest-rounds-where-players-compete](https://github.com/iceeyyy/DSA_Answers/tree/master/2028-the-earliest-and-latest-rounds-where-players-compete) |
| [2395-longest-binary-subsequence-less-than-or-equal-to-k](https://github.com/iceeyyy/DSA_Answers/tree/master/2395-longest-binary-subsequence-less-than-or-equal-to-k) |
| [3733-length-of-longest-v-shaped-diagonal-segment](https://github.com/iceeyyy/DSA_Answers/tree/master/3733-length-of-longest-v-shaped-diagonal-segment) |
## Recursion
|  |
| ------- |
| [0044-wildcard-matching](https://github.com/iceeyyy/DSA_Answers/tree/master/0044-wildcard-matching) |
| [0231-power-of-two](https://github.com/iceeyyy/DSA_Answers/tree/master/0231-power-of-two) |
| [0326-power-of-three](https://github.com/iceeyyy/DSA_Answers/tree/master/0326-power-of-three) |
| [0342-power-of-four](https://github.com/iceeyyy/DSA_Answers/tree/master/0342-power-of-four) |
| [1013-fibonacci-number](https://github.com/iceeyyy/DSA_Answers/tree/master/1013-fibonacci-number) |
| [1197-parsing-a-boolean-expression](https://github.com/iceeyyy/DSA_Answers/tree/master/1197-parsing-a-boolean-expression) |
| [2050-count-good-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/2050-count-good-numbers) |
| [3600-find-the-k-th-character-in-string-game-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3600-find-the-k-th-character-in-string-game-i) |
| [3601-find-the-k-th-character-in-string-game-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3601-find-the-k-th-character-in-string-game-ii) |
## Binary Indexed Tree
|  |
| ------- |
| [0307-range-sum-query-mutable](https://github.com/iceeyyy/DSA_Answers/tree/master/0307-range-sum-query-mutable) |
| [0673-number-of-longest-increasing-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0673-number-of-longest-increasing-subsequence) |
| [3161-block-placement-queries](https://github.com/iceeyyy/DSA_Answers/tree/master/3161-block-placement-queries) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/iceeyyy/DSA_Answers/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
## Segment Tree
|  |
| ------- |
| [0307-range-sum-query-mutable](https://github.com/iceeyyy/DSA_Answers/tree/master/0307-range-sum-query-mutable) |
| [0673-number-of-longest-increasing-subsequence](https://github.com/iceeyyy/DSA_Answers/tree/master/0673-number-of-longest-increasing-subsequence) |
| [3161-block-placement-queries](https://github.com/iceeyyy/DSA_Answers/tree/master/3161-block-placement-queries) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/iceeyyy/DSA_Answers/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3789-maximize-subarrays-after-removing-one-conflicting-pair](https://github.com/iceeyyy/DSA_Answers/tree/master/3789-maximize-subarrays-after-removing-one-conflicting-pair) |
| [3790-fruits-into-baskets-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3790-fruits-into-baskets-ii) |
| [3791-fruits-into-baskets-iii](https://github.com/iceeyyy/DSA_Answers/tree/master/3791-fruits-into-baskets-iii) |
## Enumeration
|  |
| ------- |
| [0204-count-primes](https://github.com/iceeyyy/DSA_Answers/tree/master/0204-count-primes) |
| [0875-longest-mountain-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0875-longest-mountain-in-array) |
| [0900-reordered-power-of-2](https://github.com/iceeyyy/DSA_Answers/tree/master/0900-reordered-power-of-2) |
| [1747-lexicographically-smallest-string-after-applying-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/1747-lexicographically-smallest-string-after-applying-operations) |
| [1925-count-square-sum-triples](https://github.com/iceeyyy/DSA_Answers/tree/master/1925-count-square-sum-triples) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/iceeyyy/DSA_Answers/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2174-next-greater-numerically-balanced-number](https://github.com/iceeyyy/DSA_Answers/tree/master/2174-next-greater-numerically-balanced-number) |
| [2202-sum-of-k-mirror-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/2202-sum-of-k-mirror-numbers) |
| [2837-minimum-operations-to-make-the-integer-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/2837-minimum-operations-to-make-the-integer-zero) |
| [3010-divide-an-array-into-subarrays-with-minimum-cost-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3010-divide-an-array-into-subarrays-with-minimum-cost-i) |
| [3201-distribute-candies-among-children-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3201-distribute-candies-among-children-ii) |
| [3277-find-the-number-of-ways-to-place-people-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3277-find-the-number-of-ways-to-place-people-ii) |
| [3278-find-the-number-of-ways-to-place-people-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3278-find-the-number-of-ways-to-place-people-i) |
| [3459-find-the-minimum-area-to-cover-all-ones-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3459-find-the-minimum-area-to-cover-all-ones-ii) |
| [3683-find-the-lexicographically-largest-string-from-the-box-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3683-find-the-lexicographically-largest-string-from-the-box-i) |
| [3741-reschedule-meetings-for-maximum-free-time-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3741-reschedule-meetings-for-maximum-free-time-ii) |
| [3751-total-waviness-of-numbers-in-range-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3751-total-waviness-of-numbers-in-range-i) |
| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/iceeyyy/DSA_Answers/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |
| [3789-maximize-subarrays-after-removing-one-conflicting-pair](https://github.com/iceeyyy/DSA_Answers/tree/master/3789-maximize-subarrays-after-removing-one-conflicting-pair) |
## Trie
|  |
| ------- |
| [0208-implement-trie-prefix-tree](https://github.com/iceeyyy/DSA_Answers/tree/master/0208-implement-trie-prefix-tree) |
| [0386-lexicographical-numbers](https://github.com/iceeyyy/DSA_Answers/tree/master/0386-lexicographical-numbers) |
| [0421-maximum-xor-of-two-numbers-in-an-array](https://github.com/iceeyyy/DSA_Answers/tree/master/0421-maximum-xor-of-two-numbers-in-an-array) |
| [0440-k-th-smallest-in-lexicographical-order](https://github.com/iceeyyy/DSA_Answers/tree/master/0440-k-th-smallest-in-lexicographical-order) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/iceeyyy/DSA_Answers/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1826-maximum-xor-with-an-element-from-array](https://github.com/iceeyyy/DSA_Answers/tree/master/1826-maximum-xor-with-an-element-from-array) |
## Number Theory
|  |
| ------- |
| [0204-count-primes](https://github.com/iceeyyy/DSA_Answers/tree/master/0204-count-primes) |
| [2307-replace-non-coprime-numbers-in-array](https://github.com/iceeyyy/DSA_Answers/tree/master/2307-replace-non-coprime-numbers-in-array) |
| [3629-minimum-jumps-to-reach-end-via-prime-teleportation](https://github.com/iceeyyy/DSA_Answers/tree/master/3629-minimum-jumps-to-reach-end-via-prime-teleportation) |
| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/iceeyyy/DSA_Answers/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |
## Brainteaser
|  |
| ------- |
| [2481-strictly-palindromic-number](https://github.com/iceeyyy/DSA_Answers/tree/master/2481-strictly-palindromic-number) |
| [2837-minimum-operations-to-make-the-integer-zero](https://github.com/iceeyyy/DSA_Answers/tree/master/2837-minimum-operations-to-make-the-integer-zero) |
| [3462-vowels-game-in-a-string](https://github.com/iceeyyy/DSA_Answers/tree/master/3462-vowels-game-in-a-string) |
## Queue
|  |
| ------- |
| [0969-number-of-recent-calls](https://github.com/iceeyyy/DSA_Answers/tree/master/0969-number-of-recent-calls) |
| [2408-number-of-people-aware-of-a-secret](https://github.com/iceeyyy/DSA_Answers/tree/master/2408-number-of-people-aware-of-a-secret) |
| [2618-maximize-the-minimum-powered-city](https://github.com/iceeyyy/DSA_Answers/tree/master/2618-maximize-the-minimum-powered-city) |
| [3827-implement-router](https://github.com/iceeyyy/DSA_Answers/tree/master/3827-implement-router) |
## Game Theory
|  |
| ------- |
| [3462-vowels-game-in-a-string](https://github.com/iceeyyy/DSA_Answers/tree/master/3462-vowels-game-in-a-string) |
## Bitmask
|  |
| ------- |
| [3233-maximize-the-number-of-partitions-after-operations](https://github.com/iceeyyy/DSA_Answers/tree/master/3233-maximize-the-number-of-partitions-after-operations) |
| [3851-find-sum-of-array-product-of-magical-sequences](https://github.com/iceeyyy/DSA_Answers/tree/master/3851-find-sum-of-array-product-of-magical-sequences) |
## Graph Theory
|  |
| ------- |
| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/iceeyyy/DSA_Answers/tree/master/2492-minimum-score-of-a-path-between-two-cities) |
| [3650-minimum-cost-path-with-edge-reversals](https://github.com/iceeyyy/DSA_Answers/tree/master/3650-minimum-cost-path-with-edge-reversals) |
## Rolling Hash
|  |
| ------- |
| [1461-check-if-a-string-contains-all-binary-codes-of-size-k](https://github.com/iceeyyy/DSA_Answers/tree/master/1461-check-if-a-string-contains-all-binary-codes-of-size-k) |
## Hash Function
|  |
| ------- |
| [1461-check-if-a-string-contains-all-binary-codes-of-size-k](https://github.com/iceeyyy/DSA_Answers/tree/master/1461-check-if-a-string-contains-all-binary-codes-of-size-k) |
## Union-Find
|  |
| ------- |
| [1559-detect-cycles-in-2d-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/1559-detect-cycles-in-2d-grid) |
| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/iceeyyy/DSA_Answers/tree/master/2492-minimum-score-of-a-path-between-two-cities) |
| [2812-find-the-safest-path-in-a-grid](https://github.com/iceeyyy/DSA_Answers/tree/master/2812-find-the-safest-path-in-a-grid) |
## String Matching
|  |
| ------- |
| [0796-rotate-string](https://github.com/iceeyyy/DSA_Answers/tree/master/0796-rotate-string) |

DSA_Answers

DSA_Answers 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

DSA_Answers

DSA_Answers 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README