Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/pritz69/leetcode-solutions
Solutions of some of the best Programs available on LeetCode for Beginners and Intermediate , uploaded on languages namely Python , Java , C++, C .
https://github.com/pritz69/leetcode-solutions
competitive-coding competitive-programming cpp daily-coding-problem dailycodingproblem java leetcode leetcode-cpp leetcode-java leetcode-python leetcode-solutions potd potd-github potd-practice potd-solution programming python
Last synced: 3 months ago
JSON representation
Solutions of some of the best Programs available on LeetCode for Beginners and Intermediate , uploaded on languages namely Python , Java , C++, C .
- Host: GitHub
- URL: https://github.com/pritz69/leetcode-solutions
- Owner: Pritz69
- Created: 2022-09-06T12:59:05.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-10-30T05:08:26.000Z (3 months ago)
- Last Synced: 2024-10-30T08:31:52.539Z (3 months ago)
- Topics: competitive-coding, competitive-programming, cpp, daily-coding-problem, dailycodingproblem, java, leetcode, leetcode-cpp, leetcode-java, leetcode-python, leetcode-solutions, potd, potd-github, potd-practice, potd-solution, programming, python
- Language: Python
- Homepage:
- Size: 3.19 MB
- Stars: 4
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode-Solutions
Easy Solutions of some of the best programs available on LeetCode for Beginners and Intermediate , uploaded on languages namely Python , Java , C++, C .
# Two Pointers
| |
| ------- |
| [0075-sort-colors](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0075-sort-colors) |
| [0344-reverse-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0344-reverse-string) |
| [0633-sum-of-square-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0633-sum-of-square-numbers) |
| [0853-most-profit-assigning-work](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0853-most-profit-assigning-work) |
| [2572-append-characters-to-string-to-make-subsequence](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2572-append-characters-to-string-to-make-subsequence) |
# String
| |
| ------- |
| [0344-reverse-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0344-reverse-string) |
| [0409-longest-palindrome](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0409-longest-palindrome) |
| [0648-replace-words](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0648-replace-words) |
| [1044-find-common-characters](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1044-find-common-characters) |
| [2572-append-characters-to-string-to-make-subsequence](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2572-append-characters-to-string-to-make-subsequence) |
# Greedy
| |
| ------- |
| [0330-patching-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0330-patching-array) |
| [0409-longest-palindrome](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0409-longest-palindrome) |
| [0502-ipo](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0502-ipo) |
| [0853-most-profit-assigning-work](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0853-most-profit-assigning-work) |
| [0876-hand-of-straights](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0876-hand-of-straights) |
| [0982-minimum-increment-to-make-array-unique](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0982-minimum-increment-to-make-array-unique) |
| [1285-balance-a-binary-search-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1285-balance-a-binary-search-tree) |
| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |
| [2379-maximum-total-importance-of-roads](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2379-maximum-total-importance-of-roads) |
| [2572-append-characters-to-string-to-make-subsequence](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2572-append-characters-to-string-to-make-subsequence) |
# Database
| |
| ------- |
| [1245-user-activity-for-the-past-30-days-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1245-user-activity-for-the-past-30-days-i) |
| [2495-number-of-unique-subjects-taught-by-each-teacher](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2495-number-of-unique-subjects-taught-by-each-teacher) |
# Hash Table
| |
| ------- |
| [0409-longest-palindrome](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0409-longest-palindrome) |
| [0523-continuous-subarray-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0523-continuous-subarray-sum) |
| [0648-replace-words](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0648-replace-words) |
| [0876-hand-of-straights](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0876-hand-of-straights) |
| [1016-subarray-sums-divisible-by-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1016-subarray-sums-divisible-by-k) |
| [1044-find-common-characters](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1044-find-common-characters) |
| [1217-relative-sort-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1217-relative-sort-array) |
| [1370-count-number-of-nice-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1370-count-number-of-nice-subarrays) |
# Array
| |
| ------- |
| [0075-sort-colors](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0075-sort-colors) |
| [0330-patching-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0330-patching-array) |
| [0502-ipo](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0502-ipo) |
| [0523-continuous-subarray-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0523-continuous-subarray-sum) |
| [0648-replace-words](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0648-replace-words) |
| [0853-most-profit-assigning-work](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0853-most-profit-assigning-work) |
| [0876-hand-of-straights](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0876-hand-of-straights) |
| [0982-minimum-increment-to-make-array-unique](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0982-minimum-increment-to-make-array-unique) |
| [1016-subarray-sums-divisible-by-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1016-subarray-sums-divisible-by-k) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1044-find-common-characters](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1044-find-common-characters) |
| [1137-height-checker](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1137-height-checker) |
| [1138-grumpy-bookstore-owner](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1138-grumpy-bookstore-owner) |
| [1217-relative-sort-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1217-relative-sort-array) |
| [1370-count-number-of-nice-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1370-count-number-of-nice-subarrays) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [1605-minimum-number-of-days-to-make-m-bouquets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1605-minimum-number-of-days-to-make-m-bouquets) |
| [1675-magnetic-force-between-two-balls](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1675-magnetic-force-between-two-balls) |
| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |
# Sorting
| |
| ------- |
| [0075-sort-colors](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0075-sort-colors) |
| [0502-ipo](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0502-ipo) |
| [0853-most-profit-assigning-work](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0853-most-profit-assigning-work) |
| [0876-hand-of-straights](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0876-hand-of-straights) |
| [0982-minimum-increment-to-make-array-unique](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0982-minimum-increment-to-make-array-unique) |
| [1137-height-checker](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1137-height-checker) |
| [1217-relative-sort-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1217-relative-sort-array) |
| [1675-magnetic-force-between-two-balls](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1675-magnetic-force-between-two-balls) |
| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |
| [2379-maximum-total-importance-of-roads](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2379-maximum-total-importance-of-roads) |
# Trie
| |
| ------- |
| [0648-replace-words](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0648-replace-words) |
# Math
| |
| ------- |
| [0523-continuous-subarray-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0523-continuous-subarray-sum) |
| [0633-sum-of-square-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0633-sum-of-square-numbers) |
| [1370-count-number-of-nice-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1370-count-number-of-nice-subarrays) |
# Prefix Sum
| |
| ------- |
| [0523-continuous-subarray-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0523-continuous-subarray-sum) |
| [1016-subarray-sums-divisible-by-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1016-subarray-sums-divisible-by-k) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
# Counting Sort
| |
| ------- |
| [0982-minimum-increment-to-make-array-unique](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0982-minimum-increment-to-make-array-unique) |
| [1137-height-checker](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1137-height-checker) |
| [1217-relative-sort-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1217-relative-sort-array) |
# Heap (Priority Queue)
| |
| ------- |
| [0502-ipo](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0502-ipo) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [2379-maximum-total-importance-of-roads](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2379-maximum-total-importance-of-roads) |
# Binary Search
| |
| ------- |
| [0633-sum-of-square-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0633-sum-of-square-numbers) |
| [0853-most-profit-assigning-work](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0853-most-profit-assigning-work) |
| [1605-minimum-number-of-days-to-make-m-bouquets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1605-minimum-number-of-days-to-make-m-bouquets) |
| [1675-magnetic-force-between-two-balls](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1675-magnetic-force-between-two-balls) |
# Sliding Window
| |
| ------- |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1138-grumpy-bookstore-owner](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1138-grumpy-bookstore-owner) |
| [1370-count-number-of-nice-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1370-count-number-of-nice-subarrays) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
# Queue
| |
| ------- |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
# Ordered Set
| |
| ------- |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
# Monotonic Queue
| |
| ------- |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
# Bit Manipulation
| |
| ------- |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
# Tree
| |
| ------- |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
| [1285-balance-a-binary-search-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1285-balance-a-binary-search-tree) |
# Depth-First Search
| |
| ------- |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
| [1285-balance-a-binary-search-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1285-balance-a-binary-search-tree) |
# Binary Search Tree
| |
| ------- |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
| [1285-balance-a-binary-search-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1285-balance-a-binary-search-tree) |
# Binary Tree
| |
| ------- |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
| [1285-balance-a-binary-search-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1285-balance-a-binary-search-tree) |
# Divide and Conquer
| |
| ------- |
| [1285-balance-a-binary-search-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1285-balance-a-binary-search-tree) |
# Graph
| |
| ------- |
| [1916-find-center-of-star-graph](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1916-find-center-of-star-graph) |
| [2379-maximum-total-importance-of-roads](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2379-maximum-total-importance-of-roads) |
# LeetCode Topics
## Depth-First Search
| |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [0386-lexicographical-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0386-lexicographical-numbers) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0776-n-ary-tree-postorder-traversal) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [0988-flip-equivalent-binary-trees](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0988-flip-equivalent-binary-trees) |
| [0999-regions-cut-by-slashes](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0999-regions-cut-by-slashes) |
| [1207-delete-nodes-and-return-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [1484-linked-list-in-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1484-linked-list-in-binary-tree) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [2035-count-sub-islands](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2035-count-sub-islands) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2677-cousins-in-binary-tree-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2677-cousins-in-binary-tree-ii) |
## Breadth-First Search
| |
| ------- |
| [0102-binary-tree-level-order-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0102-binary-tree-level-order-traversal) |
| [0999-regions-cut-by-slashes](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0999-regions-cut-by-slashes) |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [1484-linked-list-in-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1484-linked-list-in-binary-tree) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [2035-count-sub-islands](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2035-count-sub-islands) |
| [2171-second-minimum-time-to-reach-destination](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2171-second-minimum-time-to-reach-destination) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [2677-cousins-in-binary-tree-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2677-cousins-in-binary-tree-ii) |
## Graph
| |
| ------- |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1325-path-with-maximum-probability](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1325-path-with-maximum-probability) |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [1701-remove-max-number-of-edges-to-keep-graph-fully-traversable](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1701-remove-max-number-of-edges-to-keep-graph-fully-traversable) |
| [2171-second-minimum-time-to-reach-destination](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2171-second-minimum-time-to-reach-destination) |
| [2472-build-a-matrix-with-conditions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2472-build-a-matrix-with-conditions) |
| [2803-modify-graph-edge-weights](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2803-modify-graph-edge-weights) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3235-minimum-cost-to-convert-string-i) |
## Topological Sort
| |
| ------- |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [2472-build-a-matrix-with-conditions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2472-build-a-matrix-with-conditions) |
## Union Find
| |
| ------- |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [0999-regions-cut-by-slashes](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0999-regions-cut-by-slashes) |
| [1701-remove-max-number-of-edges-to-keep-graph-fully-traversable](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1701-remove-max-number-of-edges-to-keep-graph-fully-traversable) |
| [2035-count-sub-islands](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2035-count-sub-islands) |
## Array
| |
| ------- |
| [0033-search-in-rotated-sorted-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0033-search-in-rotated-sorted-array) |
| [0040-combination-sum-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0040-combination-sum-ii) |
| [0179-largest-number](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0179-largest-number) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0350-intersection-of-two-arrays-ii) |
| [0539-minimum-time-difference](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0539-minimum-time-difference) |
| [0624-maximum-distance-in-arrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0624-maximum-distance-in-arrays) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0729-my-calendar-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0731-my-calendar-ii) |
| [0859-design-circular-deque](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0859-design-circular-deque) |
| [0870-magic-squares-in-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0870-magic-squares-in-grid) |
| [0890-lemonade-change](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0890-lemonade-change) |
| [0906-walking-robot-simulation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0906-walking-robot-simulation) |
| [0921-spiral-matrix-iii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0921-spiral-matrix-iii) |
| [0948-sort-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0948-sort-an-array) |
| [0999-regions-cut-by-slashes](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0999-regions-cut-by-slashes) |
| [1002-maximum-width-ramp](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1002-maximum-width-ramp) |
| [1196-filling-bookcase-shelves](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1196-filling-bookcase-shelves) |
| [1207-delete-nodes-and-return-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |
| [1240-stone-game-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1240-stone-game-ii) |
| [1256-rank-transform-of-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1256-rank-transform-of-an-array) |
| [1293-three-consecutive-odds](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1293-three-consecutive-odds) |
| [1325-path-with-maximum-probability](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1325-path-with-maximum-probability) |
| [1333-sort-the-jumbled-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1333-sort-the-jumbled-numbers) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1435-xor-queries-of-a-subarray](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1435-xor-queries-of-a-subarray) |
| [1496-lucky-numbers-in-a-matrix](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1496-lucky-numbers-in-a-matrix) |
| [1497-design-a-stack-with-increment-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1497-design-a-stack-with-increment-operation) |
| [1511-count-number-of-teams](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1511-count-number-of-teams) |
| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [1694-make-sum-divisible-by-p](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1694-make-sum-divisible-by-p) |
| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |
| [1720-crawler-log-folder](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1720-crawler-log-folder) |
| [1741-sort-array-by-increasing-frequency](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1741-sort-array-by-increasing-frequency) |
| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |
| [1786-count-the-number-of-consistent-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1786-count-the-number-of-consistent-strings) |
| [1803-average-waiting-time](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1803-average-waiting-time) |
| [1923-sentence-similarity-iii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1923-sentence-similarity-iii) |
| [1940-maximum-xor-for-each-query](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1940-maximum-xor-for-each-query) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1951-find-the-winner-of-the-circular-game) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2035-count-sub-islands](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2035-count-sub-islands) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2067-maximum-number-of-points-with-cost](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2067-maximum-number-of-points-with-cost) |
| [2132-convert-1d-array-into-2d-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2132-convert-1d-array-into-2d-array) |
| [2155-find-missing-observations](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2155-find-missing-observations) |
| [2163-kth-distinct-string-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2163-kth-distinct-string-in-an-array) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
| [2306-create-binary-tree-from-descriptions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2306-create-binary-tree-from-descriptions) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2411-spiral-matrix-iv](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2411-spiral-matrix-iv) |
| [2472-build-a-matrix-with-conditions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2472-build-a-matrix-with-conditions) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [2502-sort-the-people](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2502-sort-the-people) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2554-minimum-total-distance-traveled](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2554-minimum-total-distance-traveled) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2586-longest-square-streak-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2586-longest-square-streak-in-an-array) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2716-prime-subtraction-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2716-prime-subtraction-operation) |
| [2727-number-of-senior-citizens](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2727-number-of-senior-citizens) |
| [2755-extra-characters-in-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2755-extra-characters-in-a-string) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2794-maximum-number-of-moves-in-a-grid) |
| [2846-robot-collisions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2846-robot-collisions) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3235-minimum-cost-to-convert-string-i) |
| [3291-find-if-array-can-be-sorted](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3291-find-if-array-can-be-sorted) |
| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3329-find-the-length-of-the-longest-common-prefix) |
| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
## Hash Table
| |
| ------- |
| [0264-ugly-number-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0264-ugly-number-ii) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0350-intersection-of-two-arrays-ii) |
| [0432-all-oone-data-structure](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0432-all-oone-data-structure) |
| [0567-permutation-in-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0567-permutation-in-string) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0726-number-of-atoms](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0726-number-of-atoms) |
| [0870-magic-squares-in-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0870-magic-squares-in-grid) |
| [0906-walking-robot-simulation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0906-walking-robot-simulation) |
| [0920-uncommon-words-from-two-sentences](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0920-uncommon-words-from-two-sentences) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [0999-regions-cut-by-slashes](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0999-regions-cut-by-slashes) |
| [1207-delete-nodes-and-return-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |
| [1256-rank-transform-of-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1256-rank-transform-of-an-array) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1694-make-sum-divisible-by-p](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1694-make-sum-divisible-by-p) |
| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |
| [1741-sort-array-by-increasing-frequency](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1741-sort-array-by-increasing-frequency) |
| [1786-count-the-number-of-consistent-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1786-count-the-number-of-consistent-strings) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2163-kth-distinct-string-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2163-kth-distinct-string-in-an-array) |
| [2306-create-binary-tree-from-descriptions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2306-create-binary-tree-from-descriptions) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2502-sort-the-people](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2502-sort-the-people) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2586-longest-square-streak-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2586-longest-square-streak-in-an-array) |
| [2677-cousins-in-binary-tree-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2677-cousins-in-binary-tree-ii) |
| [2755-extra-characters-in-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2755-extra-characters-in-a-string) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3329-find-the-length-of-the-longest-common-prefix) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
## Two Pointers
| |
| ------- |
| [0350-intersection-of-two-arrays-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0350-intersection-of-two-arrays-ii) |
| [0567-permutation-in-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0567-permutation-in-string) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0719-find-k-th-smallest-pair-distance) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1923-sentence-similarity-iii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1923-sentence-similarity-iii) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [3195-separate-black-and-white-balls](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3195-separate-black-and-white-balls) |
## Binary Search
| |
| ------- |
| [0033-search-in-rotated-sorted-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0033-search-in-rotated-sorted-array) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0350-intersection-of-two-arrays-ii) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0729-my-calendar-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0731-my-calendar-ii) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2586-longest-square-streak-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2586-longest-square-streak-in-an-array) |
| [2716-prime-subtraction-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2716-prime-subtraction-operation) |
## Sorting
| |
| ------- |
| [0179-largest-number](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0179-largest-number) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0350-intersection-of-two-arrays-ii) |
| [0539-minimum-time-difference](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0539-minimum-time-difference) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0726-number-of-atoms](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0726-number-of-atoms) |
| [0948-sort-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0948-sort-an-array) |
| [1256-rank-transform-of-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1256-rank-transform-of-an-array) |
| [1333-sort-the-jumbled-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1333-sort-the-jumbled-numbers) |
| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
| [1741-sort-array-by-increasing-frequency](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1741-sort-array-by-increasing-frequency) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2502-sort-the-people](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2502-sort-the-people) |
| [2554-minimum-total-distance-traveled](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2554-minimum-total-distance-traveled) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2586-longest-square-streak-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2586-longest-square-streak-in-an-array) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [2846-robot-collisions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2846-robot-collisions) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3291-find-if-array-can-be-sorted](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3291-find-if-array-can-be-sorted) |
## Greedy
| |
| ------- |
| [0179-largest-number](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0179-largest-number) |
| [0624-maximum-distance-in-arrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0624-maximum-distance-in-arrays) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0670-maximum-swap](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0670-maximum-swap) |
| [0890-lemonade-change](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0890-lemonade-change) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1304-longest-happy-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1304-longest-happy-string) |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |
| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |
| [1818-maximum-score-from-removing-substrings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1818-maximum-score-from-removing-substrings) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2716-prime-subtraction-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2716-prime-subtraction-operation) |
| [3195-separate-black-and-white-balls](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3195-separate-black-and-white-balls) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Database
| |
| ------- |
| [0196-delete-duplicate-emails](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0196-delete-duplicate-emails) |
| [0610-triangle-judgement](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0610-triangle-judgement) |
| [0619-biggest-single-number](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0619-biggest-single-number) |
| [0626-exchange-seats](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0626-exchange-seats) |
| [1811-fix-names-in-a-table](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1811-fix-names-in-a-table) |
| [1877-find-followers-count](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1877-find-followers-count) |
| [1882-the-number-of-employees-which-report-to-each-employee](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1882-the-number-of-employees-which-report-to-each-employee) |
| [1942-primary-department-for-each-employee](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1942-primary-department-for-each-employee) |
| [2127-employees-whose-manager-left-the-company](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2127-employees-whose-manager-left-the-company) |
## Linked List
| |
| ------- |
| [0432-all-oone-data-structure](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0432-all-oone-data-structure) |
| [0725-split-linked-list-in-parts](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0725-split-linked-list-in-parts) |
| [0859-design-circular-deque](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0859-design-circular-deque) |
| [1484-linked-list-in-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1484-linked-list-in-binary-tree) |
| [2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points) |
| [2299-merge-nodes-in-between-zeros](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2299-merge-nodes-in-between-zeros) |
| [2411-spiral-matrix-iv](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2411-spiral-matrix-iv) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
## Simulation
| |
| ------- |
| [0592-fraction-addition-and-subtraction](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0592-fraction-addition-and-subtraction) |
| [0906-walking-robot-simulation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0906-walking-robot-simulation) |
| [0921-spiral-matrix-iii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0921-spiral-matrix-iii) |
| [1642-water-bottles](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1642-water-bottles) |
| [1667-find-kth-bit-in-nth-binary-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1667-find-kth-bit-in-nth-binary-string) |
| [1803-average-waiting-time](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1803-average-waiting-time) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1951-find-the-winner-of-the-circular-game) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2076-sum-of-digits-of-string-after-convert](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2076-sum-of-digits-of-string-after-convert) |
| [2132-convert-1d-array-into-2d-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2132-convert-1d-array-into-2d-array) |
| [2155-find-missing-observations](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2155-find-missing-observations) |
| [2299-merge-nodes-in-between-zeros](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2299-merge-nodes-in-between-zeros) |
| [2411-spiral-matrix-iv](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2411-spiral-matrix-iv) |
| [2645-pass-the-pillow](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2645-pass-the-pillow) |
| [2800-minimum-string-length-after-removing-substrings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2800-minimum-string-length-after-removing-substrings) |
| [2846-robot-collisions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2846-robot-collisions) |
## Math
| |
| ------- |
| [0241-different-ways-to-add-parentheses](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0241-different-ways-to-add-parentheses) |
| [0264-ugly-number-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0264-ugly-number-ii) |
| [0273-integer-to-english-words](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0273-integer-to-english-words) |
| [0539-minimum-time-difference](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0539-minimum-time-difference) |
| [0564-find-the-closest-palindrome](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0564-find-the-closest-palindrome) |
| [0592-fraction-addition-and-subtraction](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0592-fraction-addition-and-subtraction) |
| [0650-2-keys-keyboard](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0650-2-keys-keyboard) |
| [0670-maximum-swap](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0670-maximum-swap) |
| [0870-magic-squares-in-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0870-magic-squares-in-grid) |
| [1240-stone-game-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1240-stone-game-ii) |
| [1642-water-bottles](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1642-water-bottles) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1951-find-the-winner-of-the-circular-game) |
| [2155-find-missing-observations](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2155-find-missing-observations) |
| [2645-pass-the-pillow](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2645-pass-the-pillow) |
| [2716-prime-subtraction-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2716-prime-subtraction-operation) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
## Recursion
| |
| ------- |
| [0241-different-ways-to-add-parentheses](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0241-different-ways-to-add-parentheses) |
| [0273-integer-to-english-words](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0273-integer-to-english-words) |
| [1197-parsing-a-boolean-expression](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1197-parsing-a-boolean-expression) |
| [1667-find-kth-bit-in-nth-binary-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1667-find-kth-bit-in-nth-binary-string) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1951-find-the-winner-of-the-circular-game) |
## Queue
| |
| ------- |
| [0859-design-circular-deque](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0859-design-circular-deque) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1951-find-the-winner-of-the-circular-game) |
## String
| |
| ------- |
| [0179-largest-number](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0179-largest-number) |
| [0214-shortest-palindrome](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0214-shortest-palindrome) |
| [0241-different-ways-to-add-parentheses](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0241-different-ways-to-add-parentheses) |
| [0273-integer-to-english-words](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0273-integer-to-english-words) |
| [0539-minimum-time-difference](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0539-minimum-time-difference) |
| [0564-find-the-closest-palindrome](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0564-find-the-closest-palindrome) |
| [0567-permutation-in-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0567-permutation-in-string) |
| [0592-fraction-addition-and-subtraction](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0592-fraction-addition-and-subtraction) |
| [0664-strange-printer](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0664-strange-printer) |
| [0726-number-of-atoms](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0726-number-of-atoms) |
| [0812-rotate-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0812-rotate-string) |
| [0920-uncommon-words-from-two-sentences](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0920-uncommon-words-from-two-sentences) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1197-parsing-a-boolean-expression](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1197-parsing-a-boolean-expression) |
| [1298-reverse-substrings-between-each-pair-of-parentheses](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1298-reverse-substrings-between-each-pair-of-parentheses) |
| [1302-delete-characters-to-make-fancy-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1302-delete-characters-to-make-fancy-string) |
| [1304-longest-happy-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1304-longest-happy-string) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1667-find-kth-bit-in-nth-binary-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1667-find-kth-bit-in-nth-binary-string) |
| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |
| [1720-crawler-log-folder](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1720-crawler-log-folder) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [1786-count-the-number-of-consistent-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1786-count-the-number-of-consistent-strings) |
| [1818-maximum-score-from-removing-substrings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1818-maximum-score-from-removing-substrings) |
| [1923-sentence-similarity-iii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1923-sentence-similarity-iii) |
| [2076-sum-of-digits-of-string-after-convert](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2076-sum-of-digits-of-string-after-convert) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2163-kth-distinct-string-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2163-kth-distinct-string-in-an-array) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [2502-sort-the-people](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2502-sort-the-people) |
| [2580-circular-sentence](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2580-circular-sentence) |
| [2727-number-of-senior-citizens](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2727-number-of-senior-citizens) |
| [2755-extra-characters-in-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2755-extra-characters-in-a-string) |
| [2800-minimum-string-length-after-removing-substrings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2800-minimum-string-length-after-removing-substrings) |
| [3174-minimum-number-of-changes-to-make-binary-string-beautiful](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3174-minimum-number-of-changes-to-make-binary-string-beautiful) |
| [3195-separate-black-and-white-balls](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3195-separate-black-and-white-balls) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3235-minimum-cost-to-convert-string-i) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3329-find-the-length-of-the-longest-common-prefix) |
| [3451-string-compression-iii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3451-string-compression-iii) |
## Stack
| |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [0726-number-of-atoms](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0726-number-of-atoms) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0776-n-ary-tree-postorder-traversal) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1002-maximum-width-ramp](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1002-maximum-width-ramp) |
| [1197-parsing-a-boolean-expression](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1197-parsing-a-boolean-expression) |
| [1298-reverse-substrings-between-each-pair-of-parentheses](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1298-reverse-substrings-between-each-pair-of-parentheses) |
| [1497-design-a-stack-with-increment-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1497-design-a-stack-with-increment-operation) |
| [1720-crawler-log-folder](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1720-crawler-log-folder) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [1818-maximum-score-from-removing-substrings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1818-maximum-score-from-removing-substrings) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2800-minimum-string-length-after-removing-substrings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2800-minimum-string-length-after-removing-substrings) |
| [2846-robot-collisions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2846-robot-collisions) |
## Tree
| |
| ------- |
| [0102-binary-tree-level-order-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0102-binary-tree-level-order-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0776-n-ary-tree-postorder-traversal) |
| [0789-kth-largest-element-in-a-stream](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0789-kth-largest-element-in-a-stream) |
| [0988-flip-equivalent-binary-trees](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0988-flip-equivalent-binary-trees) |
| [1207-delete-nodes-and-return-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |
| [1484-linked-list-in-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1484-linked-list-in-binary-tree) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2306-create-binary-tree-from-descriptions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2306-create-binary-tree-from-descriptions) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [2677-cousins-in-binary-tree-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2677-cousins-in-binary-tree-ii) |
## Binary Tree
| |
| ------- |
| [0102-binary-tree-level-order-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0102-binary-tree-level-order-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [0789-kth-largest-element-in-a-stream](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0789-kth-largest-element-in-a-stream) |
| [0988-flip-equivalent-binary-trees](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0988-flip-equivalent-binary-trees) |
| [1207-delete-nodes-and-return-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |
| [1484-linked-list-in-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1484-linked-list-in-binary-tree) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2306-create-binary-tree-from-descriptions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2306-create-binary-tree-from-descriptions) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [2677-cousins-in-binary-tree-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2677-cousins-in-binary-tree-ii) |
## Matrix
| |
| ------- |
| [0870-magic-squares-in-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0870-magic-squares-in-grid) |
| [0921-spiral-matrix-iii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0921-spiral-matrix-iii) |
| [0999-regions-cut-by-slashes](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0999-regions-cut-by-slashes) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1496-lucky-numbers-in-a-matrix](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1496-lucky-numbers-in-a-matrix) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |
| [2035-count-sub-islands](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2035-count-sub-islands) |
| [2132-convert-1d-array-into-2d-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2132-convert-1d-array-into-2d-array) |
| [2411-spiral-matrix-iv](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2411-spiral-matrix-iv) |
| [2472-build-a-matrix-with-conditions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2472-build-a-matrix-with-conditions) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2794-maximum-number-of-moves-in-a-grid) |
## Divide and Conquer
| |
| ------- |
| [0948-sort-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0948-sort-an-array) |
## Heap (Priority Queue)
| |
| ------- |
| [0264-ugly-number-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0264-ugly-number-ii) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0789-kth-largest-element-in-a-stream](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0789-kth-largest-element-in-a-stream) |
| [0948-sort-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0948-sort-an-array) |
| [1304-longest-happy-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1304-longest-happy-string) |
| [1325-path-with-maximum-probability](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1325-path-with-maximum-probability) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2803-modify-graph-edge-weights](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2803-modify-graph-edge-weights) |
## Merge Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0948-sort-an-array) |
## Bucket Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0948-sort-an-array) |
## Radix Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0948-sort-an-array) |
## Counting Sort
| |
| ------- |
| [0920-uncommon-words-from-two-sentences](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0920-uncommon-words-from-two-sentences) |
| [0948-sort-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0948-sort-an-array) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1786-count-the-number-of-consistent-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1786-count-the-number-of-consistent-strings) |
| [2163-kth-distinct-string-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2163-kth-distinct-string-in-an-array) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Dynamic Programming
| |
| ------- |
| [0241-different-ways-to-add-parentheses](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0241-different-ways-to-add-parentheses) |
| [0264-ugly-number-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0264-ugly-number-ii) |
| [0650-2-keys-keyboard](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0650-2-keys-keyboard) |
| [0664-strange-printer](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0664-strange-printer) |
| [1196-filling-bookcase-shelves](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1196-filling-bookcase-shelves) |
| [1240-stone-game-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1240-stone-game-ii) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [1511-count-number-of-teams](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1511-count-number-of-teams) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |
| [2067-maximum-number-of-points-with-cost](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2067-maximum-number-of-points-with-cost) |
| [2554-minimum-total-distance-traveled](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2554-minimum-total-distance-traveled) |
| [2586-longest-square-streak-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2586-longest-square-streak-in-an-array) |
| [2755-extra-characters-in-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2755-extra-characters-in-a-string) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2794-maximum-number-of-moves-in-a-grid) |
## Shortest Path
| |
| ------- |
| [1325-path-with-maximum-probability](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1325-path-with-maximum-probability) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [2171-second-minimum-time-to-reach-destination](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2171-second-minimum-time-to-reach-destination) |
| [2803-modify-graph-edge-weights](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2803-modify-graph-edge-weights) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3235-minimum-cost-to-convert-string-i) |
## Binary Indexed Tree
| |
| ------- |
| [1511-count-number-of-teams](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1511-count-number-of-teams) |
## Sliding Window
| |
| ------- |
| [0567-permutation-in-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0567-permutation-in-string) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |
## Strongly Connected Component
| |
| ------- |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
## Design
| |
| ------- |
| [0432-all-oone-data-structure](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0432-all-oone-data-structure) |
| [0729-my-calendar-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0731-my-calendar-ii) |
| [0789-kth-largest-element-in-a-stream](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0789-kth-largest-element-in-a-stream) |
| [0859-design-circular-deque](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0859-design-circular-deque) |
| [1497-design-a-stack-with-increment-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1497-design-a-stack-with-increment-operation) |
## Binary Search Tree
| |
| ------- |
| [0789-kth-largest-element-in-a-stream](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0789-kth-largest-element-in-a-stream) |
## Data Stream
| |
| ------- |
| [0789-kth-largest-element-in-a-stream](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0789-kth-largest-element-in-a-stream) |
## Backtracking
| |
| ------- |
| [0040-combination-sum-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0040-combination-sum-ii) |
| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
## Prefix Sum
| |
| ------- |
| [0731-my-calendar-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0731-my-calendar-ii) |
| [1240-stone-game-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1240-stone-game-ii) |
| [1435-xor-queries-of-a-subarray](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1435-xor-queries-of-a-subarray) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1694-make-sum-divisible-by-p](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1694-make-sum-divisible-by-p) |
| [1940-maximum-xor-for-each-query](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1940-maximum-xor-for-each-query) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
## Game Theory
| |
| ------- |
| [1240-stone-game-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1240-stone-game-ii) |
## Bit Manipulation
| |
| ------- |
| [0476-number-complement](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0476-number-complement) |
| [1435-xor-queries-of-a-subarray](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1435-xor-queries-of-a-subarray) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1786-count-the-number-of-consistent-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1786-count-the-number-of-consistent-strings) |
| [1940-maximum-xor-for-each-query](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1940-maximum-xor-for-each-query) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2323-minimum-bit-flips-to-convert-number](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2323-minimum-bit-flips-to-convert-number) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [3291-find-if-array-can-be-sorted](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3291-find-if-array-can-be-sorted) |
| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |
| [3394-minimum-array-end](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3394-minimum-array-end) |
## Number Theory
| |
| ------- |
| [2716-prime-subtraction-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2716-prime-subtraction-operation) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
## Brainteaser
| |
| ------- |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
## Memoization
| |
| ------- |
| [0241-different-ways-to-add-parentheses](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0241-different-ways-to-add-parentheses) |
## Rolling Hash
| |
| ------- |
| [0214-shortest-palindrome](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0214-shortest-palindrome) |
## String Matching
| |
| ------- |
| [0214-shortest-palindrome](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0214-shortest-palindrome) |
| [0812-rotate-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0812-rotate-string) |
## Hash Function
| |
| ------- |
| [0214-shortest-palindrome](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0214-shortest-palindrome) |
## Trie
| |
| ------- |
| [0386-lexicographical-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0386-lexicographical-numbers) |
| [0440-k-th-smallest-in-lexicographical-order](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0440-k-th-smallest-in-lexicographical-order) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [2755-extra-characters-in-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2755-extra-characters-in-a-string) |
| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3329-find-the-length-of-the-longest-common-prefix) |
## Segment Tree
| |
| ------- |
| [0729-my-calendar-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0731-my-calendar-ii) |
## Ordered Set
| |
| ------- |
| [0729-my-calendar-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0731-my-calendar-ii) |
## Doubly-Linked List
| |
| ------- |
| [0432-all-oone-data-structure](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0432-all-oone-data-structure) |
## Monotonic Stack
| |
| ------- |
| [1002-maximum-width-ramp](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1002-maximum-width-ramp) |
## Enumeration
| |
| ------- |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |