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: about 1 month 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 (almost 3 years ago)
• Default Branch: main
• Last Pushed: 2025-04-26T05:54:59.000Z (about 2 months ago)
• Last Synced: 2025-04-26T06:34:58.242Z (about 2 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: 1.81 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) |

| [0515-find-largest-value-in-each-tree-row](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0515-find-largest-value-in-each-tree-row) |

| [0684-redundant-connection](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0684-redundant-connection) |

| [0776-n-ary-tree-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0776-n-ary-tree-postorder-traversal) |

| [0820-find-eventual-safe-states](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0820-find-eventual-safe-states) |

| [0854-making-a-large-island](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0854-making-a-large-island) |

| [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) |

| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1093-recover-a-tree-from-preorder-traversal) |

| [1207-delete-nodes-and-return-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |

| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |

| [1350-remove-sub-folders-from-the-filesystem](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1350-remove-sub-folders-from-the-filesystem) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [1396-count-servers-that-communicate](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1396-count-servers-that-communicate) |

| [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) |

| [1558-course-schedule-iv](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1558-course-schedule-iv) |

| [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) |

| [2201-valid-arrangement-of-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2201-valid-arrangement-of-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) |

| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |

| [2493-reverse-odd-levels-of-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2493-reverse-odd-levels-of-binary-tree) |

| [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) |

| [2564-most-profitable-path-in-a-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2564-most-profitable-path-in-a-tree) |

| [2677-cousins-in-binary-tree-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2677-cousins-in-binary-tree-ii) |

| [2764-maximum-number-of-fish-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2764-maximum-number-of-fish-in-a-grid) |

| [2793-count-the-number-of-complete-components](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2793-count-the-number-of-complete-components) |

| [3058-maximum-number-of-k-divisible-components](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3058-maximum-number-of-k-divisible-components) |

| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |

## Breadth-First Search

|  |

| ------- |

| [0102-binary-tree-level-order-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0102-binary-tree-level-order-traversal) |

| [0407-trapping-rain-water-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0407-trapping-rain-water-ii) |

| [0515-find-largest-value-in-each-tree-row](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0515-find-largest-value-in-each-tree-row) |

| [0684-redundant-connection](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0684-redundant-connection) |

| [0787-sliding-puzzle](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0787-sliding-puzzle) |

| [0820-find-eventual-safe-states](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0820-find-eventual-safe-states) |

| [0854-making-a-large-island](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0854-making-a-large-island) |

| [0999-regions-cut-by-slashes](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0999-regions-cut-by-slashes) |

| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [1396-count-servers-that-communicate](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1396-count-servers-that-communicate) |

| [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) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [1558-course-schedule-iv](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1558-course-schedule-iv) |

| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1691-minimum-number-of-days-to-disconnect-island) |

| [1876-map-of-highest-peak](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1876-map-of-highest-peak) |

| [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) |

| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |

| [2493-reverse-odd-levels-of-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2493-reverse-odd-levels-of-binary-tree) |

| [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) |

| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |

| [2564-most-profitable-path-in-a-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2564-most-profitable-path-in-a-tree) |

| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |

| [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) |

| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |

| [2764-maximum-number-of-fish-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2764-maximum-number-of-fish-in-a-grid) |

| [2793-count-the-number-of-complete-components](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2793-count-the-number-of-complete-components) |

| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |

| [3517-shortest-distance-after-road-addition-queries-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3517-shortest-distance-after-road-addition-queries-i) |

## Graph

|  |

| ------- |

| [0684-redundant-connection](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0684-redundant-connection) |

| [0820-find-eventual-safe-states](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0820-find-eventual-safe-states) |

| [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) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [1558-course-schedule-iv](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1558-course-schedule-iv) |

| [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) |

| [2090-number-of-ways-to-arrive-at-destination](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2090-number-of-ways-to-arrive-at-destination) |

| [2171-second-minimum-time-to-reach-destination](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2171-second-minimum-time-to-reach-destination) |

| [2201-valid-arrangement-of-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2201-valid-arrangement-of-pairs) |

| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |

| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |

| [2472-build-a-matrix-with-conditions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2472-build-a-matrix-with-conditions) |

| [2564-most-profitable-path-in-a-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2564-most-profitable-path-in-a-tree) |

| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |

| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |

| [2793-count-the-number-of-complete-components](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2793-count-the-number-of-complete-components) |

| [2803-modify-graph-edge-weights](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2803-modify-graph-edge-weights) |

| [3189-find-champion-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3189-find-champion-ii) |

| [3235-minimum-cost-to-convert-string-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3235-minimum-cost-to-convert-string-i) |

| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3348-minimum-cost-walk-in-weighted-graph) |

| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |

| [3517-shortest-distance-after-road-addition-queries-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3517-shortest-distance-after-road-addition-queries-i) |

## Topological Sort

|  |

| ------- |

| [0820-find-eventual-safe-states](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0820-find-eventual-safe-states) |

| [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) |

| [1558-course-schedule-iv](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1558-course-schedule-iv) |

| [2090-number-of-ways-to-arrive-at-destination](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2090-number-of-ways-to-arrive-at-destination) |

| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |

| [2472-build-a-matrix-with-conditions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2472-build-a-matrix-with-conditions) |

## Union Find

|  |

| ------- |

| [0684-redundant-connection](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0684-redundant-connection) |

| [0854-making-a-large-island](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0854-making-a-large-island) |

| [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) |

| [1396-count-servers-that-communicate](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1396-count-servers-that-communicate) |

| [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) |

| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |

| [2764-maximum-number-of-fish-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2764-maximum-number-of-fish-in-a-grid) |

| [2793-count-the-number-of-complete-components](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2793-count-the-number-of-complete-components) |

| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |

| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3348-minimum-cost-walk-in-weighted-graph) |

## 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) |

| [0368-largest-divisible-subset](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0368-largest-divisible-subset) |

| [0407-trapping-rain-water-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0407-trapping-rain-water-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) |

| [0689-maximum-sum-of-3-non-overlapping-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0689-maximum-sum-of-3-non-overlapping-subarrays) |

| [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) |

| [0780-max-chunks-to-make-sorted](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0780-max-chunks-to-make-sorted) |

| [0787-sliding-puzzle](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0787-sliding-puzzle) |

| [0797-rabbits-in-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0797-rabbits-in-forest) |

| [0854-making-a-large-island](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0854-making-a-large-island) |

| [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) |

| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0892-shortest-subarray-with-sum-at-least-k) |

| [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) |

| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |

| [0948-sort-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0948-sort-an-array) |

| [0952-word-subsets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0952-word-subsets) |

| [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) |

| [1025-minimum-cost-for-tickets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1025-minimum-cost-for-tickets) |

| [1063-best-sightseeing-pair](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1063-best-sightseeing-pair) |

| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |

| [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) |

| [1335-maximum-candies-allocated-to-k-children](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1335-maximum-candies-allocated-to-k-children) |

| [1350-remove-sub-folders-from-the-filesystem](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1350-remove-sub-folders-from-the-filesystem) |

| [1364-tuple-with-same-product](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1364-tuple-with-same-product) |

| [1396-count-servers-that-communicate](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1396-count-servers-that-communicate) |

| [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) |

| [1468-check-if-n-and-its-double-exist](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1468-check-if-n-and-its-double-exist) |

| [1477-product-of-the-last-k-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1477-product-of-the-last-k-numbers) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [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) |

| [1524-string-matching-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1524-string-matching-in-an-array) |

| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |

| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |

| [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) |

| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1631-number-of-sub-arrays-with-odd-sum) |

| [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) |

| [1744-number-of-ways-to-form-a-target-string-given-a-dictionary](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1744-number-of-ways-to-form-a-target-string-given-a-dictionary) |

| [1755-defuse-the-bomb](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1755-defuse-the-bomb) |

| [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) |

| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |

| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1849-maximum-absolute-sum-of-any-subarray) |

| [1876-map-of-highest-peak](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1876-map-of-highest-peak) |

| [1878-check-if-array-is-sorted-and-rotated](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1878-check-if-array-is-sorted-and-rotated) |

| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |

| [1917-maximum-average-pass-ratio](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1917-maximum-average-pass-ratio) |

| [1923-sentence-similarity-iii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1923-sentence-similarity-iii) |

| [1927-maximum-ascending-subarray-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1927-maximum-ascending-subarray-sum) |

| [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) |

| [1972-rotating-the-box](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1972-rotating-the-box) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1993-sum-of-all-subset-xor-totals) |

| [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) |

| [2089-maximum-matrix-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2089-maximum-matrix-sum) |

| [2107-find-unique-binary-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2107-find-unique-binary-string) |

| [2132-convert-1d-array-into-2d-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2132-convert-1d-array-into-2d-array) |

| [2145-grid-game](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2145-grid-game) |

| [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) |

| [2164-two-best-non-overlapping-events](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2164-two-best-non-overlapping-events) |

| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |

| [2179-most-beautiful-item-for-each-query](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2179-most-beautiful-item-for-each-query) |

| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |

| [2232-adding-spaces-to-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2232-adding-spaces-to-a-string) |

| [2249-count-the-hidden-sequences](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2249-count-the-hidden-sequences) |

| [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) |

| [2262-solving-questions-with-brainpower](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2262-solving-questions-with-brainpower) |

| [2280-count-good-triplets-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2280-count-good-triplets-in-an-array) |

| [2292-counting-words-with-a-given-prefix](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2292-counting-words-with-a-given-prefix) |

| [2306-create-binary-tree-from-descriptions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2306-create-binary-tree-from-descriptions) |

| [2343-count-unguarded-cells-in-the-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2343-count-unguarded-cells-in-the-grid) |

| [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) |

| [2358-number-of-ways-to-split-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2358-number-of-ways-to-split-array) |

| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |

| [2411-spiral-matrix-iv](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2411-spiral-matrix-iv) |

| [2448-count-number-of-bad-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2448-count-number-of-bad-pairs) |

| [2465-shifting-letters-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2465-shifting-letters-ii) |

| [2472-build-a-matrix-with-conditions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2472-build-a-matrix-with-conditions) |

| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |

| [2478-longest-nice-subarray](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2478-longest-nice-subarray) |

| [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) |

| [2527-count-subarrays-with-fixed-bounds](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2527-count-subarrays-with-fixed-bounds) |

| [2533-bitwise-xor-of-all-pairings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2533-bitwise-xor-of-all-pairings) |

| [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) |

| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |

| [2554-minimum-total-distance-traveled](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2554-minimum-total-distance-traveled) |

| [2564-most-profitable-path-in-a-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2564-most-profitable-path-in-a-tree) |

| [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) |

| [2626-count-the-number-of-good-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2626-count-the-number-of-good-subarrays) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2665-minimum-time-to-repair-cars](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2665-minimum-time-to-repair-cars) |

| [2681-put-marbles-in-bags](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2681-put-marbles-in-bags) |

| [2685-first-completely-painted-row-or-column](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2685-first-completely-painted-row-or-column) |

| [2690-house-robber-iv](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2690-house-robber-iv) |

| [2691-count-vowel-strings-in-ranges](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2691-count-vowel-strings-in-ranges) |

| [2692-take-gifts-from-the-richest-pile](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2692-take-gifts-from-the-richest-pile) |

| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |

| [2699-count-the-number-of-fair-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2699-count-the-number-of-fair-pairs) |

| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |

| [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) |

| [2764-maximum-number-of-fish-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2764-maximum-number-of-fish-in-a-grid) |

| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |

| [2792-neighboring-bitwise-xor](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2792-neighboring-bitwise-xor) |

| [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) |

| [2868-continuous-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2868-continuous-subarrays) |

| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |

| [2915-count-of-interesting-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2915-count-of-interesting-subarrays) |

| [3001-apply-operations-to-maximize-score](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3001-apply-operations-to-maximize-score) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |

| [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) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3309-count-prefix-and-suffix-pairs-i) |

| [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) |

| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |

| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3348-minimum-cost-walk-in-weighted-graph) |

| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |

| [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) |

| [3427-special-array-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3427-special-array-ii) |

| [3429-special-array-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3429-special-array-i) |

| [3430-count-days-without-meetings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3430-count-days-without-meetings) |

| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |

| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |

| [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) |

| [3517-shortest-distance-after-road-addition-queries-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3517-shortest-distance-after-road-addition-queries-i) |

| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3522-find-the-power-of-k-size-subarrays-i) |

| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |

| [3643-zero-array-transformation-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3643-zero-array-transformation-ii) |

## 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) |

| [0797-rabbits-in-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0797-rabbits-in-forest) |

| [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) |

| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |

| [0952-word-subsets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0952-word-subsets) |

| [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) |

| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |

| [1160-letter-tile-possibilities](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1160-letter-tile-possibilities) |

| [1207-delete-nodes-and-return-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |

| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |

| [1256-rank-transform-of-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1256-rank-transform-of-an-array) |

| [1364-tuple-with-same-product](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1364-tuple-with-same-product) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [1468-check-if-n-and-its-double-exist](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1468-check-if-n-and-its-double-exist) |

| [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) |

| [1502-construct-k-palindrome-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1502-construct-k-palindrome-strings) |

| [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) |

| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |

| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |

| [2059-unique-length-3-palindromic-subsequences](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |

| [2107-find-unique-binary-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2107-find-unique-binary-string) |

| [2163-kth-distinct-string-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2163-kth-distinct-string-in-an-array) |

| [2300-construct-string-with-repeat-limit](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2300-construct-string-with-repeat-limit) |

| [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) |

| [2434-design-a-number-container-system](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2434-design-a-number-container-system) |

| [2448-count-number-of-bad-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2448-count-number-of-bad-pairs) |

| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |

| [2502-sort-the-people](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2502-sort-the-people) |

| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |

| [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) |

| [2599-take-k-of-each-character-from-left-and-right](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2599-take-k-of-each-character-from-left-and-right) |

| [2626-count-the-number-of-good-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2626-count-the-number-of-good-subarrays) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2677-cousins-in-binary-tree-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2677-cousins-in-binary-tree-ii) |

| [2685-first-completely-painted-row-or-column](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2685-first-completely-painted-row-or-column) |

| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |

| [2755-extra-characters-in-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2755-extra-characters-in-a-string) |

| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |

| [2915-count-of-interesting-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2915-count-of-interesting-subarrays) |

| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3267-find-longest-special-substring-that-occurs-thrice-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) |

| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |

| [3455-minimum-length-of-string-after-operations](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3455-minimum-length-of-string-after-operations) |

| [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) |

| [3548-find-the-count-of-good-integers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3548-find-the-count-of-good-integers) |

## 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) |

| [1468-check-if-n-and-its-double-exist](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1468-check-if-n-and-its-double-exist) |

| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |

| [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) |

| [1972-rotating-the-box](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1972-rotating-the-box) |

| [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) |

| [2232-adding-spaces-to-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2232-adding-spaces-to-a-string) |

| [2414-move-pieces-to-obtain-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2414-move-pieces-to-obtain-a-string) |

| [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) |

| [2699-count-the-number-of-fair-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2699-count-the-number-of-fair-pairs) |

| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |

| [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) |

| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0892-shortest-subarray-with-sum-at-least-k) |

| [1335-maximum-candies-allocated-to-k-children](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1335-maximum-candies-allocated-to-k-children) |

| [1468-check-if-n-and-its-double-exist](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1468-check-if-n-and-its-double-exist) |

| [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) |

| [2164-two-best-non-overlapping-events](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2164-two-best-non-overlapping-events) |

| [2179-most-beautiful-item-for-each-query](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2179-most-beautiful-item-for-each-query) |

| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |

| [2280-count-good-triplets-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2280-count-good-triplets-in-an-array) |

| [2586-longest-square-streak-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2586-longest-square-streak-in-an-array) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2665-minimum-time-to-repair-cars](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2665-minimum-time-to-repair-cars) |

| [2690-house-robber-iv](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2690-house-robber-iv) |

| [2699-count-the-number-of-fair-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2699-count-the-number-of-fair-pairs) |

| [2716-prime-subtraction-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2716-prime-subtraction-operation) |

| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |

| [3427-special-array-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3427-special-array-ii) |

| [3643-zero-array-transformation-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3643-zero-array-transformation-ii) |

## 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) |

| [0368-largest-divisible-subset](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0368-largest-divisible-subset) |

| [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) |

| [0780-max-chunks-to-make-sorted](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0780-max-chunks-to-make-sorted) |

| [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) |

| [1468-check-if-n-and-its-double-exist](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1468-check-if-n-and-its-double-exist) |

| [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) |

| [2164-two-best-non-overlapping-events](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2164-two-best-non-overlapping-events) |

| [2179-most-beautiful-item-for-each-query](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2179-most-beautiful-item-for-each-query) |

| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |

| [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) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2646-kth-largest-sum-in-a-binary-tree) |

| [2681-put-marbles-in-bags](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2681-put-marbles-in-bags) |

| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |

| [2699-count-the-number-of-fair-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2699-count-the-number-of-fair-pairs) |

| [2846-robot-collisions](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2846-robot-collisions) |

| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |

| [3001-apply-operations-to-maximize-score](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3001-apply-operations-to-maximize-score) |

| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |

| [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) |

| [3430-count-days-without-meetings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3430-count-days-without-meetings) |

## 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) |

| [0780-max-chunks-to-make-sorted](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0780-max-chunks-to-make-sorted) |

| [0797-rabbits-in-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0797-rabbits-in-forest) |

| [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) |

| [1502-construct-k-palindrome-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1502-construct-k-palindrome-strings) |

| [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) |

| [1917-maximum-average-pass-ratio](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1917-maximum-average-pass-ratio) |

| [2089-maximum-matrix-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2089-maximum-matrix-sum) |

| [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) |

| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |

| [2300-construct-string-with-repeat-limit](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2300-construct-string-with-repeat-limit) |

| [2456-construct-smallest-number-from-di-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2456-construct-smallest-number-from-di-string) |

| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |

| [2509-minimize-xor](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2509-minimize-xor) |

| [2616-maximal-score-after-applying-k-operations](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2616-maximal-score-after-applying-k-operations) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2681-put-marbles-in-bags](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2681-put-marbles-in-bags) |

| [2716-prime-subtraction-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2716-prime-subtraction-operation) |

| [3001-apply-operations-to-maximize-score](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3001-apply-operations-to-maximize-score) |

| [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) |

| [2021-remove-all-occurrences-of-a-substring](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2021-remove-all-occurrences-of-a-substring) |

| [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) |

| [2232-adding-spaces-to-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2232-adding-spaces-to-a-string) |

| [2299-merge-nodes-in-between-zeros](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2299-merge-nodes-in-between-zeros) |

| [2343-count-unguarded-cells-in-the-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2343-count-unguarded-cells-in-the-grid) |

| [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) |

| [2692-take-gifts-from-the-richest-pile](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2692-take-gifts-from-the-richest-pile) |

| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |

| [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) |

| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |

| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |

| [3447-clear-digits](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3447-clear-digits) |

| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |

## 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) |

| [0368-largest-divisible-subset](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0368-largest-divisible-subset) |

| [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) |

| [0797-rabbits-in-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0797-rabbits-in-forest) |

| [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) |

| [1477-product-of-the-last-k-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1477-product-of-the-last-k-numbers) |

| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1631-number-of-sub-arrays-with-odd-sum) |

| [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) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2050-count-good-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2050-count-good-numbers) |

| [2155-find-missing-observations](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2155-find-missing-observations) |

| [2415-count-the-number-of-ideal-arrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2415-count-the-number-of-ideal-arrays) |

| [2448-count-number-of-bad-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2448-count-number-of-bad-pairs) |

| [2645-pass-the-pillow](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2645-pass-the-pillow) |

| [2649-count-total-number-of-colored-cells](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2649-count-total-number-of-colored-cells) |

| [2716-prime-subtraction-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2716-prime-subtraction-operation) |

| [2802-find-the-punishment-number-of-an-integer](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2802-find-the-punishment-number-of-an-integer) |

| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |

| [3001-apply-operations-to-maximize-score](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3001-apply-operations-to-maximize-score) |

| [3243-count-the-number-of-powerful-integers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3243-count-the-number-of-powerful-integers) |

| [3548-find-the-count-of-good-integers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3548-find-the-count-of-good-integers) |

| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |

## 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) |

| [2050-count-good-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2050-count-good-numbers) |

## Queue

|  |

| ------- |

| [0859-design-circular-deque](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0859-design-circular-deque) |

| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0892-shortest-subarray-with-sum-at-least-k) |

| [1951-find-the-winner-of-the-circular-game](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1951-find-the-winner-of-the-circular-game) |

| [2527-count-subarrays-with-fixed-bounds](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2527-count-subarrays-with-fixed-bounds) |

| [2868-continuous-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2868-continuous-subarrays) |

| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |

## String

|  |

| ------- |

| [0038-count-and-say](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0038-count-and-say) |

| [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) |

| [0952-word-subsets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0952-word-subsets) |

| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0957-minimum-add-to-make-parentheses-valid) |

| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1093-recover-a-tree-from-preorder-traversal) |

| [1160-letter-tile-possibilities](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1160-letter-tile-possibilities) |

| [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) |

| [1502-construct-k-palindrome-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1502-construct-k-palindrome-strings) |

| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |

| [1524-string-matching-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1524-string-matching-in-an-array) |

| [1537-maximum-score-after-splitting-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1537-maximum-score-after-splitting-a-string) |

| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |

| [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) |

| [1744-number-of-ways-to-form-a-target-string-given-a-dictionary](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1744-number-of-ways-to-form-a-target-string-given-a-dictionary) |

| [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) |

| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |

| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |

| [1923-sentence-similarity-iii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1923-sentence-similarity-iii) |

| [2021-remove-all-occurrences-of-a-substring](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2021-remove-all-occurrences-of-a-substring) |

| [2059-unique-length-3-palindromic-subsequences](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |

| [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) |

| [2107-find-unique-binary-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2107-find-unique-binary-string) |

| [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) |

| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |

| [2232-adding-spaces-to-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2232-adding-spaces-to-a-string) |

| [2292-counting-words-with-a-given-prefix](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2292-counting-words-with-a-given-prefix) |

| [2300-construct-string-with-repeat-limit](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2300-construct-string-with-repeat-limit) |

| [2414-move-pieces-to-obtain-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2414-move-pieces-to-obtain-a-string) |

| [2456-construct-smallest-number-from-di-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2456-construct-smallest-number-from-di-string) |

| [2465-shifting-letters-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2465-shifting-letters-ii) |

| [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) |

| [2599-take-k-of-each-character-from-left-and-right](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2599-take-k-of-each-character-from-left-and-right) |

| [2691-count-vowel-strings-in-ranges](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2691-count-vowel-strings-in-ranges) |

| [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) |

| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |

| [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) |

| [3243-count-the-number-of-powerful-integers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3243-count-the-number-of-powerful-integers) |

| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3267-find-longest-special-substring-that-occurs-thrice-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) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3309-count-prefix-and-suffix-pairs-i) |

| [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) |

| [3447-clear-digits](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3447-clear-digits) |

| [3451-string-compression-iii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3451-string-compression-iii) |

| [3455-minimum-length-of-string-after-operations](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3455-minimum-length-of-string-after-operations) |

## 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) |

| [0780-max-chunks-to-make-sorted](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0780-max-chunks-to-make-sorted) |

| [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) |

| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |

| [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) |

| [2021-remove-all-occurrences-of-a-substring](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2021-remove-all-occurrences-of-a-substring) |

| [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) |

| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |

| [2456-construct-smallest-number-from-di-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2456-construct-smallest-number-from-di-string) |

| [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) |

| [3001-apply-operations-to-maximize-score](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3001-apply-operations-to-maximize-score) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

| [3447-clear-digits](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3447-clear-digits) |

## 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) |

| [0515-find-largest-value-in-each-tree-row](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0515-find-largest-value-in-each-tree-row) |

| [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) |

| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |

| [0988-flip-equivalent-binary-trees](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0988-flip-equivalent-binary-trees) |

| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1093-recover-a-tree-from-preorder-traversal) |

| [1207-delete-nodes-and-return-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |

| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [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) |

| [2493-reverse-odd-levels-of-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2493-reverse-odd-levels-of-binary-tree) |

| [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) |

| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |

| [2564-most-profitable-path-in-a-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2564-most-profitable-path-in-a-tree) |

| [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) |

| [3058-maximum-number-of-k-divisible-components](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3058-maximum-number-of-k-divisible-components) |

| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |

## 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) |

| [0515-find-largest-value-in-each-tree-row](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0515-find-largest-value-in-each-tree-row) |

| [0789-kth-largest-element-in-a-stream](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0789-kth-largest-element-in-a-stream) |

| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |

| [0988-flip-equivalent-binary-trees](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0988-flip-equivalent-binary-trees) |

| [1093-recover-a-tree-from-preorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1093-recover-a-tree-from-preorder-traversal) |

| [1207-delete-nodes-and-return-forest](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |

| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [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) |

| [2493-reverse-odd-levels-of-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2493-reverse-odd-levels-of-binary-tree) |

| [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) |

| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |

| [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

|  |

| ------- |

| [0407-trapping-rain-water-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0407-trapping-rain-water-ii) |

| [0787-sliding-puzzle](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0787-sliding-puzzle) |

| [0854-making-a-large-island](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0854-making-a-large-island) |

| [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) |

| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |

| [1396-count-servers-that-communicate](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1396-count-servers-that-communicate) |

| [1402-count-square-submatrices-with-all-ones](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1402-count-square-submatrices-with-all-ones) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [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) |

| [1876-map-of-highest-peak](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1876-map-of-highest-peak) |

| [1972-rotating-the-box](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1972-rotating-the-box) |

| [2035-count-sub-islands](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2035-count-sub-islands) |

| [2089-maximum-matrix-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2089-maximum-matrix-sum) |

| [2132-convert-1d-array-into-2d-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2132-convert-1d-array-into-2d-array) |

| [2145-grid-game](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2145-grid-game) |

| [2343-count-unguarded-cells-in-the-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2343-count-unguarded-cells-in-the-grid) |

| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |

| [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) |

| [2685-first-completely-painted-row-or-column](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2685-first-completely-painted-row-or-column) |

| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |

| [2764-maximum-number-of-fish-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2764-maximum-number-of-fish-in-a-grid) |

| [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

|  |

| ------- |

| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |

| [0948-sort-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0948-sort-an-array) |

| [2280-count-good-triplets-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2280-count-good-triplets-in-an-array) |

## Heap (Priority Queue)

|  |

| ------- |

| [0264-ugly-number-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0264-ugly-number-ii) |

| [0407-trapping-rain-water-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0407-trapping-rain-water-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) |

| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0892-shortest-subarray-with-sum-at-least-k) |

| [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) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [1917-maximum-average-pass-ratio](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1917-maximum-average-pass-ratio) |

| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |

| [2164-two-best-non-overlapping-events](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2164-two-best-non-overlapping-events) |

| [2300-construct-string-with-repeat-limit](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2300-construct-string-with-repeat-limit) |

| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |

| [2434-design-a-number-container-system](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2434-design-a-number-container-system) |

| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |

| [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) |

| [2681-put-marbles-in-bags](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2681-put-marbles-in-bags) |

| [2692-take-gifts-from-the-richest-pile](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2692-take-gifts-from-the-richest-pile) |

| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |

| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |

| [2803-modify-graph-edge-weights](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2803-modify-graph-edge-weights) |

| [2868-continuous-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2868-continuous-subarrays) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |

| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |

## Merge Sort

|  |

| ------- |

| [0948-sort-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0948-sort-an-array) |

| [2280-count-good-triplets-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2280-count-good-triplets-in-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) |

| [1160-letter-tile-possibilities](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1160-letter-tile-possibilities) |

| [1364-tuple-with-same-product](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1364-tuple-with-same-product) |

| [1396-count-servers-that-communicate](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1396-count-servers-that-communicate) |

| [1502-construct-k-palindrome-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1502-construct-k-palindrome-strings) |

| [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) |

| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |

| [2163-kth-distinct-string-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2163-kth-distinct-string-in-an-array) |

| [2300-construct-string-with-repeat-limit](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2300-construct-string-with-repeat-limit) |

| [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) |

| [2448-count-number-of-bad-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2448-count-number-of-bad-pairs) |

| [2494-sum-of-prefix-scores-of-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2494-sum-of-prefix-scores-of-strings) |

| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3267-find-longest-special-substring-that-occurs-thrice-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) |

| [3455-minimum-length-of-string-after-operations](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3455-minimum-length-of-string-after-operations) |

## 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) |

| [0368-largest-divisible-subset](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0368-largest-divisible-subset) |

| [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) |

| [0689-maximum-sum-of-3-non-overlapping-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0689-maximum-sum-of-3-non-overlapping-subarrays) |

| [1025-minimum-cost-for-tickets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1025-minimum-cost-for-tickets) |

| [1063-best-sightseeing-pair](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1063-best-sightseeing-pair) |

| [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) |

| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1631-number-of-sub-arrays-with-odd-sum) |

| [1744-number-of-ways-to-form-a-target-string-given-a-dictionary](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1744-number-of-ways-to-form-a-target-string-given-a-dictionary) |

| [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) |

| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1849-maximum-absolute-sum-of-any-subarray) |

| [2067-maximum-number-of-points-with-cost](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2067-maximum-number-of-points-with-cost) |

| [2090-number-of-ways-to-arrive-at-destination](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2090-number-of-ways-to-arrive-at-destination) |

| [2164-two-best-non-overlapping-events](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2164-two-best-non-overlapping-events) |

| [2262-solving-questions-with-brainpower](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2262-solving-questions-with-brainpower) |

| [2415-count-the-number-of-ideal-arrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2415-count-the-number-of-ideal-arrays) |

| [2554-minimum-total-distance-traveled](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2554-minimum-total-distance-traveled) |

| [2562-count-ways-to-build-good-strings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2562-count-ways-to-build-good-strings) |

| [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) |

| [3243-count-the-number-of-powerful-integers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3243-count-the-number-of-powerful-integers) |

## 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) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [2090-number-of-ways-to-arrive-at-destination](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2090-number-of-ways-to-arrive-at-destination) |

| [2171-second-minimum-time-to-reach-destination](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2171-second-minimum-time-to-reach-destination) |

| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |

| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |

| [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) |

| [2280-count-good-triplets-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2280-count-good-triplets-in-an-array) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

## 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) |

| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0892-shortest-subarray-with-sum-at-least-k) |

| [1755-defuse-the-bomb](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1755-defuse-the-bomb) |

| [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) |

| [2478-longest-nice-subarray](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2478-longest-nice-subarray) |

| [2527-count-subarrays-with-fixed-bounds](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2527-count-subarrays-with-fixed-bounds) |

| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |

| [2599-take-k-of-each-character-from-left-and-right](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2599-take-k-of-each-character-from-left-and-right) |

| [2626-count-the-number-of-good-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2626-count-the-number-of-good-subarrays) |

| [2868-continuous-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2868-continuous-subarrays) |

| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |

| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |

| [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) |

| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |

| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3522-find-the-power-of-k-size-subarrays-i) |

## 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) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [1477-product-of-the-last-k-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1477-product-of-the-last-k-numbers) |

| [1497-design-a-stack-with-increment-operation](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1497-design-a-stack-with-increment-operation) |

| [2434-design-a-number-container-system](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2434-design-a-number-container-system) |

## 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) |

| [1477-product-of-the-last-k-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1477-product-of-the-last-k-numbers) |

## Backtracking

|  |

| ------- |

| [0040-combination-sum-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0040-combination-sum-ii) |

| [1160-letter-tile-possibilities](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1160-letter-tile-possibilities) |

| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |

| [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) |

| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2107-find-unique-binary-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2107-find-unique-binary-string) |

| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |

| [2456-construct-smallest-number-from-di-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2456-construct-smallest-number-from-di-string) |

| [2802-find-the-punishment-number-of-an-integer](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2802-find-the-punishment-number-of-an-integer) |

## Prefix Sum

|  |

| ------- |

| [0731-my-calendar-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0731-my-calendar-ii) |

| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0892-shortest-subarray-with-sum-at-least-k) |

| [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) |

| [1477-product-of-the-last-k-numbers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1477-product-of-the-last-k-numbers) |

| [1537-maximum-score-after-splitting-a-string](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1537-maximum-score-after-splitting-a-string) |

| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1631-number-of-sub-arrays-with-odd-sum) |

| [1694-make-sum-divisible-by-p](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1694-make-sum-divisible-by-p) |

| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |

| [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) |

| [2059-unique-length-3-palindromic-subsequences](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |

| [2145-grid-game](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2145-grid-game) |

| [2249-count-the-hidden-sequences](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2249-count-the-hidden-sequences) |

| [2358-number-of-ways-to-split-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2358-number-of-ways-to-split-array) |

| [2465-shifting-letters-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2465-shifting-letters-ii) |

| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |

| [2691-count-vowel-strings-in-ranges](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2691-count-vowel-strings-in-ranges) |

| [2915-count-of-interesting-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2915-count-of-interesting-subarrays) |

| [3427-special-array-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3427-special-array-ii) |

| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |

| [3643-zero-array-transformation-ii](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3643-zero-array-transformation-ii) |

## 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) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2059-unique-length-3-palindromic-subsequences](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2059-unique-length-3-palindromic-subsequences) |

| [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) |

| [2478-longest-nice-subarray](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2478-longest-nice-subarray) |

| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |

| [2509-minimize-xor](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2509-minimize-xor) |

| [2533-bitwise-xor-of-all-pairings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2533-bitwise-xor-of-all-pairings) |

| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |

| [2792-neighboring-bitwise-xor](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2792-neighboring-bitwise-xor) |

| [3291-find-if-array-can-be-sorted](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3291-find-if-array-can-be-sorted) |

| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3348-minimum-cost-walk-in-weighted-graph) |

| [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) |

| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |

## Number Theory

|  |

| ------- |

| [2415-count-the-number-of-ideal-arrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2415-count-the-number-of-ideal-arrays) |

| [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) |

| [3001-apply-operations-to-maximize-score](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3001-apply-operations-to-maximize-score) |

## Brainteaser

|  |

| ------- |

| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |

| [2533-bitwise-xor-of-all-pairings](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2533-bitwise-xor-of-all-pairings) |

## 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) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3309-count-prefix-and-suffix-pairs-i) |

## 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) |

| [1524-string-matching-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1524-string-matching-in-an-array) |

| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |

| [2292-counting-words-with-a-given-prefix](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2292-counting-words-with-a-given-prefix) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3309-count-prefix-and-suffix-pairs-i) |

## Hash Function

|  |

| ------- |

| [0214-shortest-palindrome](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0214-shortest-palindrome) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3309-count-prefix-and-suffix-pairs-i) |

## 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) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3309-count-prefix-and-suffix-pairs-i) |

| [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) |

| [2280-count-good-triplets-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2280-count-good-triplets-in-an-array) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

## 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) |

| [2280-count-good-triplets-in-an-array](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2280-count-good-triplets-in-an-array) |

| [2434-design-a-number-container-system](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2434-design-a-number-container-system) |

| [2868-continuous-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2868-continuous-subarrays) |

## Doubly-Linked List

|  |

| ------- |

| [0432-all-oone-data-structure](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0432-all-oone-data-structure) |

## Monotonic Stack

|  |

| ------- |

| [0780-max-chunks-to-make-sorted](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0780-max-chunks-to-make-sorted) |

| [1002-maximum-width-ramp](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1002-maximum-width-ramp) |

| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |

| [3001-apply-operations-to-maximize-score](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3001-apply-operations-to-maximize-score) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

## Enumeration

|  |

| ------- |

| [1993-sum-of-all-subset-xor-totals](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |

| [3548-find-the-count-of-good-integers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3548-find-the-count-of-good-integers) |

## Monotonic Queue

|  |

| ------- |

| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/Pritz69/LeetCode-Solutions/tree/master/0892-shortest-subarray-with-sum-at-least-k) |

| [2527-count-subarrays-with-fixed-bounds](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2527-count-subarrays-with-fixed-bounds) |

| [2868-continuous-subarrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2868-continuous-subarrays) |

## Eulerian Circuit

|  |

| ------- |

| [2201-valid-arrangement-of-pairs](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2201-valid-arrangement-of-pairs) |

## Combinatorics

|  |

| ------- |

| [1993-sum-of-all-subset-xor-totals](https://github.com/Pritz69/LeetCode-Solutions/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2415-count-the-number-of-ideal-arrays](https://github.com/Pritz69/LeetCode-Solutions/tree/master/2415-count-the-number-of-ideal-arrays) |

| [3548-find-the-count-of-good-integers](https://github.com/Pritz69/LeetCode-Solutions/tree/master/3548-find-the-count-of-good-integers) |