https://github.com/satya-supercluster/leetcode
Collection of LeetCode questions to ace the coding interview!
https://github.com/satya-supercluster/leetcode
cpp leetcode-solutions problem-solving
Last synced: 9 months ago
JSON representation
Collection of LeetCode questions to ace the coding interview!
- Host: GitHub
- URL: https://github.com/satya-supercluster/leetcode
- Owner: satya-supercluster
- Created: 2024-05-23T05:38:48.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2025-05-06T15:49:38.000Z (about 1 year ago)
- Last Synced: 2025-06-12T13:50:59.166Z (about 1 year ago)
- Topics: cpp, leetcode-solutions, problem-solving
- Language: C++
- Homepage:
- Size: 1.81 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Leetcode
Collection of LeetCode questions to ace the coding interview!
# Depth-First Search
| |
| ------- |
| [0133-clone-graph](https://github.com/satya-supercluster/Leetcode/tree/master/0133-clone-graph) |
| [0207-course-schedule](https://github.com/satya-supercluster/Leetcode/tree/master/0207-course-schedule) |
| [0547-number-of-provinces](https://github.com/satya-supercluster/Leetcode/tree/master/0547-number-of-provinces) |
| [0733-flood-fill](https://github.com/satya-supercluster/Leetcode/tree/master/0733-flood-fill) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/satya-supercluster/Leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/satya-supercluster/Leetcode/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
| [2582-minimum-score-of-a-path-between-two-cities](https://github.com/satya-supercluster/Leetcode/tree/master/2582-minimum-score-of-a-path-between-two-cities) |
# Breadth-First Search
| |
| ------- |
| [0133-clone-graph](https://github.com/satya-supercluster/Leetcode/tree/master/0133-clone-graph) |
| [0207-course-schedule](https://github.com/satya-supercluster/Leetcode/tree/master/0207-course-schedule) |
| [0547-number-of-provinces](https://github.com/satya-supercluster/Leetcode/tree/master/0547-number-of-provinces) |
| [0733-flood-fill](https://github.com/satya-supercluster/Leetcode/tree/master/0733-flood-fill) |
| [1036-rotting-oranges](https://github.com/satya-supercluster/Leetcode/tree/master/1036-rotting-oranges) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/satya-supercluster/Leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/satya-supercluster/Leetcode/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
| [2582-minimum-score-of-a-path-between-two-cities](https://github.com/satya-supercluster/Leetcode/tree/master/2582-minimum-score-of-a-path-between-two-cities) |
# Union Find
| |
| ------- |
| [0547-number-of-provinces](https://github.com/satya-supercluster/Leetcode/tree/master/0547-number-of-provinces) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/satya-supercluster/Leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |
| [2582-minimum-score-of-a-path-between-two-cities](https://github.com/satya-supercluster/Leetcode/tree/master/2582-minimum-score-of-a-path-between-two-cities) |
# Graph
| |
| ------- |
| [0133-clone-graph](https://github.com/satya-supercluster/Leetcode/tree/master/0133-clone-graph) |
| [0207-course-schedule](https://github.com/satya-supercluster/Leetcode/tree/master/0207-course-schedule) |
| [0547-number-of-provinces](https://github.com/satya-supercluster/Leetcode/tree/master/0547-number-of-provinces) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/satya-supercluster/Leetcode/tree/master/1442-number-of-operations-to-make-network-connected) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/satya-supercluster/Leetcode/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
| [2582-minimum-score-of-a-path-between-two-cities](https://github.com/satya-supercluster/Leetcode/tree/master/2582-minimum-score-of-a-path-between-two-cities) |
# Array
| |
| ------- |
| [0027-remove-element](https://github.com/satya-supercluster/Leetcode/tree/master/0027-remove-element) |
| [0064-minimum-path-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0064-minimum-path-sum) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0416-partition-equal-subset-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0416-partition-equal-subset-sum) |
| [0494-target-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0494-target-sum) |
| [0733-flood-fill](https://github.com/satya-supercluster/Leetcode/tree/master/0733-flood-fill) |
| [0967-minimum-falling-path-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0967-minimum-falling-path-sum) |
| [1036-rotting-oranges](https://github.com/satya-supercluster/Leetcode/tree/master/1036-rotting-oranges) |
# Matrix
| |
| ------- |
| [0064-minimum-path-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0064-minimum-path-sum) |
| [0733-flood-fill](https://github.com/satya-supercluster/Leetcode/tree/master/0733-flood-fill) |
| [0967-minimum-falling-path-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0967-minimum-falling-path-sum) |
| [1036-rotting-oranges](https://github.com/satya-supercluster/Leetcode/tree/master/1036-rotting-oranges) |
# Hash Table
| |
| ------- |
| [0133-clone-graph](https://github.com/satya-supercluster/Leetcode/tree/master/0133-clone-graph) |
# Two Pointers
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/satya-supercluster/Leetcode/tree/master/0005-longest-palindromic-substring) |
| [0027-remove-element](https://github.com/satya-supercluster/Leetcode/tree/master/0027-remove-element) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
# Topological Sort
| |
| ------- |
| [0207-course-schedule](https://github.com/satya-supercluster/Leetcode/tree/master/0207-course-schedule) |
# Dynamic Programming
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/satya-supercluster/Leetcode/tree/master/0005-longest-palindromic-substring) |
| [0064-minimum-path-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0064-minimum-path-sum) |
| [0416-partition-equal-subset-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0416-partition-equal-subset-sum) |
| [0494-target-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0494-target-sum) |
| [0967-minimum-falling-path-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0967-minimum-falling-path-sum) |
# Backtracking
| |
| ------- |
| [0494-target-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0494-target-sum) |
# String
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/satya-supercluster/Leetcode/tree/master/0005-longest-palindromic-substring) |
# LeetCode Topics
## Depth-First Search
| |
| ------- |
| [0112-path-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0113-path-sum-ii) |
| [0129-sum-root-to-leaf-numbers](https://github.com/satya-supercluster/Leetcode/tree/master/0129-sum-root-to-leaf-numbers) |
| [0210-course-schedule-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0210-course-schedule-ii) |
| [0211-design-add-and-search-words-data-structure](https://github.com/satya-supercluster/Leetcode/tree/master/0211-design-add-and-search-words-data-structure) |
| [0226-invert-binary-tree](https://github.com/satya-supercluster/Leetcode/tree/master/0226-invert-binary-tree) |
| [0257-binary-tree-paths](https://github.com/satya-supercluster/Leetcode/tree/master/0257-binary-tree-paths) |
| [0310-minimum-height-trees](https://github.com/satya-supercluster/Leetcode/tree/master/0310-minimum-height-trees) |
| [0332-reconstruct-itinerary](https://github.com/satya-supercluster/Leetcode/tree/master/0332-reconstruct-itinerary) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/satya-supercluster/Leetcode/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0684-redundant-connection](https://github.com/satya-supercluster/Leetcode/tree/master/0684-redundant-connection) |
| [0695-max-area-of-island](https://github.com/satya-supercluster/Leetcode/tree/master/0695-max-area-of-island) |
| [0801-is-graph-bipartite](https://github.com/satya-supercluster/Leetcode/tree/master/0801-is-graph-bipartite) |
| [0820-find-eventual-safe-states](https://github.com/satya-supercluster/Leetcode/tree/master/0820-find-eventual-safe-states) |
| [0854-making-a-large-island](https://github.com/satya-supercluster/Leetcode/tree/master/0854-making-a-large-island) |
| [0922-possible-bipartition](https://github.com/satya-supercluster/Leetcode/tree/master/0922-possible-bipartition) |
| [1011-flip-binary-tree-to-match-preorder-traversal](https://github.com/satya-supercluster/Leetcode/tree/master/1011-flip-binary-tree-to-match-preorder-traversal) |
| [1021-distribute-coins-in-binary-tree](https://github.com/satya-supercluster/Leetcode/tree/master/1021-distribute-coins-in-binary-tree) |
| [1030-smallest-string-starting-from-leaf](https://github.com/satya-supercluster/Leetcode/tree/master/1030-smallest-string-starting-from-leaf) |
| [1093-recover-a-tree-from-preorder-traversal](https://github.com/satya-supercluster/Leetcode/tree/master/1093-recover-a-tree-from-preorder-traversal) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/satya-supercluster/Leetcode/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [1396-count-servers-that-communicate](https://github.com/satya-supercluster/Leetcode/tree/master/1396-count-servers-that-communicate) |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/satya-supercluster/Leetcode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [1558-course-schedule-iv](https://github.com/satya-supercluster/Leetcode/tree/master/1558-course-schedule-iv) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/satya-supercluster/Leetcode/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
| [2201-valid-arrangement-of-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/2201-valid-arrangement-of-pairs) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/satya-supercluster/Leetcode/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/satya-supercluster/Leetcode/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |
| [2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph](https://github.com/satya-supercluster/Leetcode/tree/master/2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph) |
| [2438-find-closest-node-to-given-two-nodes](https://github.com/satya-supercluster/Leetcode/tree/master/2438-find-closest-node-to-given-two-nodes) |
| [2439-longest-cycle-in-a-graph](https://github.com/satya-supercluster/Leetcode/tree/master/2439-longest-cycle-in-a-graph) |
| [2493-reverse-odd-levels-of-binary-tree](https://github.com/satya-supercluster/Leetcode/tree/master/2493-reverse-odd-levels-of-binary-tree) |
| [2531-create-components-with-same-value](https://github.com/satya-supercluster/Leetcode/tree/master/2531-create-components-with-same-value) |
| [2564-most-profitable-path-in-a-tree](https://github.com/satya-supercluster/Leetcode/tree/master/2564-most-profitable-path-in-a-tree) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/satya-supercluster/Leetcode/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [2793-count-the-number-of-complete-components](https://github.com/satya-supercluster/Leetcode/tree/master/2793-count-the-number-of-complete-components) |
| [3058-maximum-number-of-k-divisible-components](https://github.com/satya-supercluster/Leetcode/tree/master/3058-maximum-number-of-k-divisible-components) |
| [3191-maximum-score-after-applying-operations-on-a-tree](https://github.com/satya-supercluster/Leetcode/tree/master/3191-maximum-score-after-applying-operations-on-a-tree) |
| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/satya-supercluster/Leetcode/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |
## Breadth-First Search
| |
| ------- |
| [0112-path-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0112-path-sum) |
| [0210-course-schedule-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0210-course-schedule-ii) |
| [0226-invert-binary-tree](https://github.com/satya-supercluster/Leetcode/tree/master/0226-invert-binary-tree) |
| [0310-minimum-height-trees](https://github.com/satya-supercluster/Leetcode/tree/master/0310-minimum-height-trees) |
| [0407-trapping-rain-water-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0407-trapping-rain-water-ii) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/satya-supercluster/Leetcode/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0684-redundant-connection](https://github.com/satya-supercluster/Leetcode/tree/master/0684-redundant-connection) |
| [0695-max-area-of-island](https://github.com/satya-supercluster/Leetcode/tree/master/0695-max-area-of-island) |
| [0801-is-graph-bipartite](https://github.com/satya-supercluster/Leetcode/tree/master/0801-is-graph-bipartite) |
| [0820-find-eventual-safe-states](https://github.com/satya-supercluster/Leetcode/tree/master/0820-find-eventual-safe-states) |
| [0854-making-a-large-island](https://github.com/satya-supercluster/Leetcode/tree/master/0854-making-a-large-island) |
| [0922-possible-bipartition](https://github.com/satya-supercluster/Leetcode/tree/master/0922-possible-bipartition) |
| [0945-snakes-and-ladders](https://github.com/satya-supercluster/Leetcode/tree/master/0945-snakes-and-ladders) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/satya-supercluster/Leetcode/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [1229-shortest-path-with-alternating-colors](https://github.com/satya-supercluster/Leetcode/tree/master/1229-shortest-path-with-alternating-colors) |
| [1396-count-servers-that-communicate](https://github.com/satya-supercluster/Leetcode/tree/master/1396-count-servers-that-communicate) |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/satya-supercluster/Leetcode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/satya-supercluster/Leetcode/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |
| [1558-course-schedule-iv](https://github.com/satya-supercluster/Leetcode/tree/master/1558-course-schedule-iv) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/satya-supercluster/Leetcode/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
| [1876-map-of-highest-peak](https://github.com/satya-supercluster/Leetcode/tree/master/1876-map-of-highest-peak) |
| [2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph](https://github.com/satya-supercluster/Leetcode/tree/master/2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph) |
| [2493-reverse-odd-levels-of-binary-tree](https://github.com/satya-supercluster/Leetcode/tree/master/2493-reverse-odd-levels-of-binary-tree) |
| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/satya-supercluster/Leetcode/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |
| [2564-most-profitable-path-in-a-tree](https://github.com/satya-supercluster/Leetcode/tree/master/2564-most-profitable-path-in-a-tree) |
| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/satya-supercluster/Leetcode/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/satya-supercluster/Leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/satya-supercluster/Leetcode/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [2793-count-the-number-of-complete-components](https://github.com/satya-supercluster/Leetcode/tree/master/2793-count-the-number-of-complete-components) |
| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/satya-supercluster/Leetcode/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/satya-supercluster/Leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0684-redundant-connection](https://github.com/satya-supercluster/Leetcode/tree/master/0684-redundant-connection) |
| [0695-max-area-of-island](https://github.com/satya-supercluster/Leetcode/tree/master/0695-max-area-of-island) |
| [0801-is-graph-bipartite](https://github.com/satya-supercluster/Leetcode/tree/master/0801-is-graph-bipartite) |
| [0854-making-a-large-island](https://github.com/satya-supercluster/Leetcode/tree/master/0854-making-a-large-island) |
| [0922-possible-bipartition](https://github.com/satya-supercluster/Leetcode/tree/master/0922-possible-bipartition) |
| [1396-count-servers-that-communicate](https://github.com/satya-supercluster/Leetcode/tree/master/1396-count-servers-that-communicate) |
| [2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph](https://github.com/satya-supercluster/Leetcode/tree/master/2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph) |
| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/satya-supercluster/Leetcode/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/satya-supercluster/Leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/satya-supercluster/Leetcode/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [2793-count-the-number-of-complete-components](https://github.com/satya-supercluster/Leetcode/tree/master/2793-count-the-number-of-complete-components) |
| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/satya-supercluster/Leetcode/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/satya-supercluster/Leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
## Graph
| |
| ------- |
| [0210-course-schedule-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0210-course-schedule-ii) |
| [0310-minimum-height-trees](https://github.com/satya-supercluster/Leetcode/tree/master/0310-minimum-height-trees) |
| [0332-reconstruct-itinerary](https://github.com/satya-supercluster/Leetcode/tree/master/0332-reconstruct-itinerary) |
| [0684-redundant-connection](https://github.com/satya-supercluster/Leetcode/tree/master/0684-redundant-connection) |
| [0801-is-graph-bipartite](https://github.com/satya-supercluster/Leetcode/tree/master/0801-is-graph-bipartite) |
| [0820-find-eventual-safe-states](https://github.com/satya-supercluster/Leetcode/tree/master/0820-find-eventual-safe-states) |
| [0922-possible-bipartition](https://github.com/satya-supercluster/Leetcode/tree/master/0922-possible-bipartition) |
| [1229-shortest-path-with-alternating-colors](https://github.com/satya-supercluster/Leetcode/tree/master/1229-shortest-path-with-alternating-colors) |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/satya-supercluster/Leetcode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/satya-supercluster/Leetcode/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |
| [1558-course-schedule-iv](https://github.com/satya-supercluster/Leetcode/tree/master/1558-course-schedule-iv) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/satya-supercluster/Leetcode/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
| [1696-strange-printer-ii](https://github.com/satya-supercluster/Leetcode/tree/master/1696-strange-printer-ii) |
| [2090-number-of-ways-to-arrive-at-destination](https://github.com/satya-supercluster/Leetcode/tree/master/2090-number-of-ways-to-arrive-at-destination) |
| [2201-valid-arrangement-of-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/2201-valid-arrangement-of-pairs) |
| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/satya-supercluster/Leetcode/tree/master/2220-find-all-possible-recipes-from-given-supplies) |
| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/satya-supercluster/Leetcode/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |
| [2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph](https://github.com/satya-supercluster/Leetcode/tree/master/2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph) |
| [2438-find-closest-node-to-given-two-nodes](https://github.com/satya-supercluster/Leetcode/tree/master/2438-find-closest-node-to-given-two-nodes) |
| [2439-longest-cycle-in-a-graph](https://github.com/satya-supercluster/Leetcode/tree/master/2439-longest-cycle-in-a-graph) |
| [2564-most-profitable-path-in-a-tree](https://github.com/satya-supercluster/Leetcode/tree/master/2564-most-profitable-path-in-a-tree) |
| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/satya-supercluster/Leetcode/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |
| [2717-collect-coins-in-a-tree](https://github.com/satya-supercluster/Leetcode/tree/master/2717-collect-coins-in-a-tree) |
| [2793-count-the-number-of-complete-components](https://github.com/satya-supercluster/Leetcode/tree/master/2793-count-the-number-of-complete-components) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/satya-supercluster/Leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/satya-supercluster/Leetcode/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |
## String
| |
| ------- |
| [0008-string-to-integer-atoi](https://github.com/satya-supercluster/Leetcode/tree/master/0008-string-to-integer-atoi) |
| [0010-regular-expression-matching](https://github.com/satya-supercluster/Leetcode/tree/master/0010-regular-expression-matching) |
| [0012-integer-to-roman](https://github.com/satya-supercluster/Leetcode/tree/master/0012-integer-to-roman) |
| [0014-longest-common-prefix](https://github.com/satya-supercluster/Leetcode/tree/master/0014-longest-common-prefix) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/satya-supercluster/Leetcode/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0022-generate-parentheses](https://github.com/satya-supercluster/Leetcode/tree/master/0022-generate-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/satya-supercluster/Leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0038-count-and-say](https://github.com/satya-supercluster/Leetcode/tree/master/0038-count-and-say) |
| [0044-wildcard-matching](https://github.com/satya-supercluster/Leetcode/tree/master/0044-wildcard-matching) |
| [0072-edit-distance](https://github.com/satya-supercluster/Leetcode/tree/master/0072-edit-distance) |
| [0208-implement-trie-prefix-tree](https://github.com/satya-supercluster/Leetcode/tree/master/0208-implement-trie-prefix-tree) |
| [0211-design-add-and-search-words-data-structure](https://github.com/satya-supercluster/Leetcode/tree/master/0211-design-add-and-search-words-data-structure) |
| [0257-binary-tree-paths](https://github.com/satya-supercluster/Leetcode/tree/master/0257-binary-tree-paths) |
| [0316-remove-duplicate-letters](https://github.com/satya-supercluster/Leetcode/tree/master/0316-remove-duplicate-letters) |
| [0344-reverse-string](https://github.com/satya-supercluster/Leetcode/tree/master/0344-reverse-string) |
| [0402-remove-k-digits](https://github.com/satya-supercluster/Leetcode/tree/master/0402-remove-k-digits) |
| [0556-next-greater-element-iii](https://github.com/satya-supercluster/Leetcode/tree/master/0556-next-greater-element-iii) |
| [0557-reverse-words-in-a-string-iii](https://github.com/satya-supercluster/Leetcode/tree/master/0557-reverse-words-in-a-string-iii) |
| [0639-decode-ways-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0639-decode-ways-ii) |
| [0726-number-of-atoms](https://github.com/satya-supercluster/Leetcode/tree/master/0726-number-of-atoms) |
| [0768-partition-labels](https://github.com/satya-supercluster/Leetcode/tree/master/0768-partition-labels) |
| [0868-push-dominoes](https://github.com/satya-supercluster/Leetcode/tree/master/0868-push-dominoes) |
| [0952-word-subsets](https://github.com/satya-supercluster/Leetcode/tree/master/0952-word-subsets) |
| [1030-smallest-string-starting-from-leaf](https://github.com/satya-supercluster/Leetcode/tree/master/1030-smallest-string-starting-from-leaf) |
| [1093-recover-a-tree-from-preorder-traversal](https://github.com/satya-supercluster/Leetcode/tree/master/1093-recover-a-tree-from-preorder-traversal) |
| [1160-letter-tile-possibilities](https://github.com/satya-supercluster/Leetcode/tree/master/1160-letter-tile-possibilities) |
| [1170-shortest-common-supersequence](https://github.com/satya-supercluster/Leetcode/tree/master/1170-shortest-common-supersequence) |
| [1250-longest-common-subsequence](https://github.com/satya-supercluster/Leetcode/tree/master/1250-longest-common-subsequence) |
| [1360-maximum-length-of-a-concatenated-string-with-unique-characters](https://github.com/satya-supercluster/Leetcode/tree/master/1360-maximum-length-of-a-concatenated-string-with-unique-characters) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/satya-supercluster/Leetcode/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1502-construct-k-palindrome-strings](https://github.com/satya-supercluster/Leetcode/tree/master/1502-construct-k-palindrome-strings) |
| [1512-design-underground-system](https://github.com/satya-supercluster/Leetcode/tree/master/1512-design-underground-system) |
| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/satya-supercluster/Leetcode/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |
| [1524-string-matching-in-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/1524-string-matching-in-an-array) |
| [1562-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list](https://github.com/satya-supercluster/Leetcode/tree/master/1562-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list) |
| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/satya-supercluster/Leetcode/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/satya-supercluster/Leetcode/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |
| [1644-maximum-number-of-non-overlapping-substrings](https://github.com/satya-supercluster/Leetcode/tree/master/1644-maximum-number-of-non-overlapping-substrings) |
| [1720-crawler-log-folder](https://github.com/satya-supercluster/Leetcode/tree/master/1720-crawler-log-folder) |
| [1744-number-of-ways-to-form-a-target-string-given-a-dictionary](https://github.com/satya-supercluster/Leetcode/tree/master/1744-number-of-ways-to-form-a-target-string-given-a-dictionary) |
| [1781-check-if-two-string-arrays-are-equivalent](https://github.com/satya-supercluster/Leetcode/tree/master/1781-check-if-two-string-arrays-are-equivalent) |
| [1818-maximum-score-from-removing-substrings](https://github.com/satya-supercluster/Leetcode/tree/master/1818-maximum-score-from-removing-substrings) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/satya-supercluster/Leetcode/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/satya-supercluster/Leetcode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [1933-number-of-different-integers-in-a-string](https://github.com/satya-supercluster/Leetcode/tree/master/1933-number-of-different-integers-in-a-string) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/satya-supercluster/Leetcode/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2093-check-if-string-is-a-prefix-of-array](https://github.com/satya-supercluster/Leetcode/tree/master/2093-check-if-string-is-a-prefix-of-array) |
| [2107-find-unique-binary-string](https://github.com/satya-supercluster/Leetcode/tree/master/2107-find-unique-binary-string) |
| [2149-remove-colored-pieces-if-both-neighbors-are-the-same-color](https://github.com/satya-supercluster/Leetcode/tree/master/2149-remove-colored-pieces-if-both-neighbors-are-the-same-color) |
| [2187-vowels-of-all-substrings](https://github.com/satya-supercluster/Leetcode/tree/master/2187-vowels-of-all-substrings) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/satya-supercluster/Leetcode/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/satya-supercluster/Leetcode/tree/master/2220-find-all-possible-recipes-from-given-supplies) |
| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/satya-supercluster/Leetcode/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |
| [2285-design-bitset](https://github.com/satya-supercluster/Leetcode/tree/master/2285-design-bitset) |
| [2292-counting-words-with-a-given-prefix](https://github.com/satya-supercluster/Leetcode/tree/master/2292-counting-words-with-a-given-prefix) |
| [2300-construct-string-with-repeat-limit](https://github.com/satya-supercluster/Leetcode/tree/master/2300-construct-string-with-repeat-limit) |
| [2337-remove-digit-from-number-to-maximize-result](https://github.com/satya-supercluster/Leetcode/tree/master/2337-remove-digit-from-number-to-maximize-result) |
| [2341-count-prefixes-of-a-given-string](https://github.com/satya-supercluster/Leetcode/tree/master/2341-count-prefixes-of-a-given-string) |
| [2456-construct-smallest-number-from-di-string](https://github.com/satya-supercluster/Leetcode/tree/master/2456-construct-smallest-number-from-di-string) |
| [2463-minimum-recolors-to-get-k-consecutive-black-blocks](https://github.com/satya-supercluster/Leetcode/tree/master/2463-minimum-recolors-to-get-k-consecutive-black-blocks) |
| [2465-shifting-letters-ii](https://github.com/satya-supercluster/Leetcode/tree/master/2465-shifting-letters-ii) |
| [2691-count-vowel-strings-in-ranges](https://github.com/satya-supercluster/Leetcode/tree/master/2691-count-vowel-strings-in-ranges) |
| [2701-subsequence-with-the-minimum-score](https://github.com/satya-supercluster/Leetcode/tree/master/2701-subsequence-with-the-minimum-score) |
| [2727-number-of-senior-citizens](https://github.com/satya-supercluster/Leetcode/tree/master/2727-number-of-senior-citizens) |
| [2800-minimum-string-length-after-removing-substrings](https://github.com/satya-supercluster/Leetcode/tree/master/2800-minimum-string-length-after-removing-substrings) |
| [3046-minimum-operations-to-make-a-special-number](https://github.com/satya-supercluster/Leetcode/tree/master/3046-minimum-operations-to-make-a-special-number) |
| [3243-count-the-number-of-powerful-integers](https://github.com/satya-supercluster/Leetcode/tree/master/3243-count-the-number-of-powerful-integers) |
| [3275-minimum-number-of-pushes-to-type-word-i](https://github.com/satya-supercluster/Leetcode/tree/master/3275-minimum-number-of-pushes-to-type-word-i) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/satya-supercluster/Leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |
| [3447-clear-digits](https://github.com/satya-supercluster/Leetcode/tree/master/3447-clear-digits) |
| [3455-minimum-length-of-string-after-operations](https://github.com/satya-supercluster/Leetcode/tree/master/3455-minimum-length-of-string-after-operations) |
| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
## Dynamic Programming
| |
| ------- |
| [0010-regular-expression-matching](https://github.com/satya-supercluster/Leetcode/tree/master/0010-regular-expression-matching) |
| [0022-generate-parentheses](https://github.com/satya-supercluster/Leetcode/tree/master/0022-generate-parentheses) |
| [0044-wildcard-matching](https://github.com/satya-supercluster/Leetcode/tree/master/0044-wildcard-matching) |
| [0045-jump-game-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/satya-supercluster/Leetcode/tree/master/0055-jump-game) |
| [0072-edit-distance](https://github.com/satya-supercluster/Leetcode/tree/master/0072-edit-distance) |
| [0085-maximal-rectangle](https://github.com/satya-supercluster/Leetcode/tree/master/0085-maximal-rectangle) |
| [0095-unique-binary-search-trees-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0095-unique-binary-search-trees-ii) |
| [0096-unique-binary-search-trees](https://github.com/satya-supercluster/Leetcode/tree/master/0096-unique-binary-search-trees) |
| [0119-pascals-triangle-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0119-pascals-triangle-ii) |
| [0120-triangle](https://github.com/satya-supercluster/Leetcode/tree/master/0120-triangle) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0152-maximum-product-subarray](https://github.com/satya-supercluster/Leetcode/tree/master/0152-maximum-product-subarray) |
| [0221-maximal-square](https://github.com/satya-supercluster/Leetcode/tree/master/0221-maximal-square) |
| [0300-longest-increasing-subsequence](https://github.com/satya-supercluster/Leetcode/tree/master/0300-longest-increasing-subsequence) |
| [0338-counting-bits](https://github.com/satya-supercluster/Leetcode/tree/master/0338-counting-bits) |
| [0368-largest-divisible-subset](https://github.com/satya-supercluster/Leetcode/tree/master/0368-largest-divisible-subset) |
| [0416-partition-equal-subset-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0416-partition-equal-subset-sum) |
| [0494-target-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0494-target-sum) |
| [0639-decode-ways-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0639-decode-ways-ii) |
| [0689-maximum-sum-of-3-non-overlapping-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/0689-maximum-sum-of-3-non-overlapping-subarrays) |
| [0806-domino-and-tromino-tiling](https://github.com/satya-supercluster/Leetcode/tree/master/0806-domino-and-tromino-tiling) |
| [0868-push-dominoes](https://github.com/satya-supercluster/Leetcode/tree/master/0868-push-dominoes) |
| [1025-minimum-cost-for-tickets](https://github.com/satya-supercluster/Leetcode/tree/master/1025-minimum-cost-for-tickets) |
| [1063-best-sightseeing-pair](https://github.com/satya-supercluster/Leetcode/tree/master/1063-best-sightseeing-pair) |
| [1170-shortest-common-supersequence](https://github.com/satya-supercluster/Leetcode/tree/master/1170-shortest-common-supersequence) |
| [1224-minimum-falling-path-sum-ii](https://github.com/satya-supercluster/Leetcode/tree/master/1224-minimum-falling-path-sum-ii) |
| [1250-longest-common-subsequence](https://github.com/satya-supercluster/Leetcode/tree/master/1250-longest-common-subsequence) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/satya-supercluster/Leetcode/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/satya-supercluster/Leetcode/tree/master/1744-number-of-ways-to-form-a-target-string-given-a-dictionary) |
| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/satya-supercluster/Leetcode/tree/master/1849-maximum-absolute-sum-of-any-subarray) |
| [2090-number-of-ways-to-arrive-at-destination](https://github.com/satya-supercluster/Leetcode/tree/master/2090-number-of-ways-to-arrive-at-destination) |
| [2187-vowels-of-all-substrings](https://github.com/satya-supercluster/Leetcode/tree/master/2187-vowels-of-all-substrings) |
| [2262-solving-questions-with-brainpower](https://github.com/satya-supercluster/Leetcode/tree/master/2262-solving-questions-with-brainpower) |
| [2415-count-the-number-of-ideal-arrays](https://github.com/satya-supercluster/Leetcode/tree/master/2415-count-the-number-of-ideal-arrays) |
| [2554-minimum-total-distance-traveled](https://github.com/satya-supercluster/Leetcode/tree/master/2554-minimum-total-distance-traveled) |
| [3191-maximum-score-after-applying-operations-on-a-tree](https://github.com/satya-supercluster/Leetcode/tree/master/3191-maximum-score-after-applying-operations-on-a-tree) |
| [3243-count-the-number-of-powerful-integers](https://github.com/satya-supercluster/Leetcode/tree/master/3243-count-the-number-of-powerful-integers) |
| [3307-find-the-maximum-sum-of-node-values](https://github.com/satya-supercluster/Leetcode/tree/master/3307-find-the-maximum-sum-of-node-values) |
| [3442-maximum-total-reward-using-operations-i](https://github.com/satya-supercluster/Leetcode/tree/master/3442-maximum-total-reward-using-operations-i) |
| [3460-count-the-number-of-inversions](https://github.com/satya-supercluster/Leetcode/tree/master/3460-count-the-number-of-inversions) |
| [3477-minimum-operations-to-make-binary-array-elements-equal-to-one-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3477-minimum-operations-to-make-binary-array-elements-equal-to-one-ii) |
| [3751-maximum-frequency-after-subarray-operation](https://github.com/satya-supercluster/Leetcode/tree/master/3751-maximum-frequency-after-subarray-operation) |
## Topological Sort
| |
| ------- |
| [0210-course-schedule-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0210-course-schedule-ii) |
| [0310-minimum-height-trees](https://github.com/satya-supercluster/Leetcode/tree/master/0310-minimum-height-trees) |
| [0820-find-eventual-safe-states](https://github.com/satya-supercluster/Leetcode/tree/master/0820-find-eventual-safe-states) |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/satya-supercluster/Leetcode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
| [1558-course-schedule-iv](https://github.com/satya-supercluster/Leetcode/tree/master/1558-course-schedule-iv) |
| [1696-strange-printer-ii](https://github.com/satya-supercluster/Leetcode/tree/master/1696-strange-printer-ii) |
| [2090-number-of-ways-to-arrive-at-destination](https://github.com/satya-supercluster/Leetcode/tree/master/2090-number-of-ways-to-arrive-at-destination) |
| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/satya-supercluster/Leetcode/tree/master/2220-find-all-possible-recipes-from-given-supplies) |
| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/satya-supercluster/Leetcode/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |
| [2439-longest-cycle-in-a-graph](https://github.com/satya-supercluster/Leetcode/tree/master/2439-longest-cycle-in-a-graph) |
| [2717-collect-coins-in-a-tree](https://github.com/satya-supercluster/Leetcode/tree/master/2717-collect-coins-in-a-tree) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/satya-supercluster/Leetcode/tree/master/0011-container-with-most-water) |
| [0044-wildcard-matching](https://github.com/satya-supercluster/Leetcode/tree/master/0044-wildcard-matching) |
| [0045-jump-game-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/satya-supercluster/Leetcode/tree/master/0055-jump-game) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0316-remove-duplicate-letters](https://github.com/satya-supercluster/Leetcode/tree/master/0316-remove-duplicate-letters) |
| [0402-remove-k-digits](https://github.com/satya-supercluster/Leetcode/tree/master/0402-remove-k-digits) |
| [0561-array-partition](https://github.com/satya-supercluster/Leetcode/tree/master/0561-array-partition) |
| [0659-split-array-into-consecutive-subsequences](https://github.com/satya-supercluster/Leetcode/tree/master/0659-split-array-into-consecutive-subsequences) |
| [0768-partition-labels](https://github.com/satya-supercluster/Leetcode/tree/master/0768-partition-labels) |
| [0779-max-chunks-to-make-sorted-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0779-max-chunks-to-make-sorted-ii) |
| [0780-max-chunks-to-make-sorted](https://github.com/satya-supercluster/Leetcode/tree/master/0780-max-chunks-to-make-sorted) |
| [0797-rabbits-in-forest](https://github.com/satya-supercluster/Leetcode/tree/master/0797-rabbits-in-forest) |
| [0890-lemonade-change](https://github.com/satya-supercluster/Leetcode/tree/master/0890-lemonade-change) |
| [1049-minimum-domino-rotations-for-equal-row](https://github.com/satya-supercluster/Leetcode/tree/master/1049-minimum-domino-rotations-for-equal-row) |
| [1329-minimum-cost-to-move-chips-to-the-same-position](https://github.com/satya-supercluster/Leetcode/tree/master/1329-minimum-cost-to-move-chips-to-the-same-position) |
| [1422-divide-array-in-sets-of-k-consecutive-numbers](https://github.com/satya-supercluster/Leetcode/tree/master/1422-divide-array-in-sets-of-k-consecutive-numbers) |
| [1502-construct-k-palindrome-strings](https://github.com/satya-supercluster/Leetcode/tree/master/1502-construct-k-palindrome-strings) |
| [1644-maximum-number-of-non-overlapping-substrings](https://github.com/satya-supercluster/Leetcode/tree/master/1644-maximum-number-of-non-overlapping-substrings) |
| [1818-maximum-score-from-removing-substrings](https://github.com/satya-supercluster/Leetcode/tree/master/1818-maximum-score-from-removing-substrings) |
| [1917-maximum-average-pass-ratio](https://github.com/satya-supercluster/Leetcode/tree/master/1917-maximum-average-pass-ratio) |
| [2149-remove-colored-pieces-if-both-neighbors-are-the-same-color](https://github.com/satya-supercluster/Leetcode/tree/master/2149-remove-colored-pieces-if-both-neighbors-are-the-same-color) |
| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/satya-supercluster/Leetcode/tree/master/2180-maximum-number-of-tasks-you-can-assign) |
| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/satya-supercluster/Leetcode/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |
| [2300-construct-string-with-repeat-limit](https://github.com/satya-supercluster/Leetcode/tree/master/2300-construct-string-with-repeat-limit) |
| [2337-remove-digit-from-number-to-maximize-result](https://github.com/satya-supercluster/Leetcode/tree/master/2337-remove-digit-from-number-to-maximize-result) |
| [2456-construct-smallest-number-from-di-string](https://github.com/satya-supercluster/Leetcode/tree/master/2456-construct-smallest-number-from-di-string) |
| [2509-minimize-xor](https://github.com/satya-supercluster/Leetcode/tree/master/2509-minimize-xor) |
| [2650-split-with-minimum-sum](https://github.com/satya-supercluster/Leetcode/tree/master/2650-split-with-minimum-sum) |
| [2681-put-marbles-in-bags](https://github.com/satya-supercluster/Leetcode/tree/master/2681-put-marbles-in-bags) |
| [3001-apply-operations-to-maximize-score](https://github.com/satya-supercluster/Leetcode/tree/master/3001-apply-operations-to-maximize-score) |
| [3046-minimum-operations-to-make-a-special-number](https://github.com/satya-supercluster/Leetcode/tree/master/3046-minimum-operations-to-make-a-special-number) |
| [3275-minimum-number-of-pushes-to-type-word-i](https://github.com/satya-supercluster/Leetcode/tree/master/3275-minimum-number-of-pushes-to-type-word-i) |
| [3307-find-the-maximum-sum-of-node-values](https://github.com/satya-supercluster/Leetcode/tree/master/3307-find-the-maximum-sum-of-node-values) |
| [3477-minimum-operations-to-make-binary-array-elements-equal-to-one-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3477-minimum-operations-to-make-binary-array-elements-equal-to-one-ii) |
| [3751-maximum-frequency-after-subarray-operation](https://github.com/satya-supercluster/Leetcode/tree/master/3751-maximum-frequency-after-subarray-operation) |
## Array
| |
| ------- |
| [0011-container-with-most-water](https://github.com/satya-supercluster/Leetcode/tree/master/0011-container-with-most-water) |
| [0045-jump-game-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0045-jump-game-ii) |
| [0046-permutations](https://github.com/satya-supercluster/Leetcode/tree/master/0046-permutations) |
| [0055-jump-game](https://github.com/satya-supercluster/Leetcode/tree/master/0055-jump-game) |
| [0078-subsets](https://github.com/satya-supercluster/Leetcode/tree/master/0078-subsets) |
| [0085-maximal-rectangle](https://github.com/satya-supercluster/Leetcode/tree/master/0085-maximal-rectangle) |
| [0088-merge-sorted-array](https://github.com/satya-supercluster/Leetcode/tree/master/0088-merge-sorted-array) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/satya-supercluster/Leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0119-pascals-triangle-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0119-pascals-triangle-ii) |
| [0120-triangle](https://github.com/satya-supercluster/Leetcode/tree/master/0120-triangle) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0128-longest-consecutive-sequence](https://github.com/satya-supercluster/Leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0152-maximum-product-subarray](https://github.com/satya-supercluster/Leetcode/tree/master/0152-maximum-product-subarray) |
| [0189-rotate-array](https://github.com/satya-supercluster/Leetcode/tree/master/0189-rotate-array) |
| [0215-kth-largest-element-in-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/0215-kth-largest-element-in-an-array) |
| [0221-maximal-square](https://github.com/satya-supercluster/Leetcode/tree/master/0221-maximal-square) |
| [0239-sliding-window-maximum](https://github.com/satya-supercluster/Leetcode/tree/master/0239-sliding-window-maximum) |
| [0260-single-number-iii](https://github.com/satya-supercluster/Leetcode/tree/master/0260-single-number-iii) |
| [0300-longest-increasing-subsequence](https://github.com/satya-supercluster/Leetcode/tree/master/0300-longest-increasing-subsequence) |
| [0303-range-sum-query-immutable](https://github.com/satya-supercluster/Leetcode/tree/master/0303-range-sum-query-immutable) |
| [0307-range-sum-query-mutable](https://github.com/satya-supercluster/Leetcode/tree/master/0307-range-sum-query-mutable) |
| [0368-largest-divisible-subset](https://github.com/satya-supercluster/Leetcode/tree/master/0368-largest-divisible-subset) |
| [0407-trapping-rain-water-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0407-trapping-rain-water-ii) |
| [0416-partition-equal-subset-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0416-partition-equal-subset-sum) |
| [0485-max-consecutive-ones](https://github.com/satya-supercluster/Leetcode/tree/master/0485-max-consecutive-ones) |
| [0493-reverse-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/0493-reverse-pairs) |
| [0494-target-sum](https://github.com/satya-supercluster/Leetcode/tree/master/0494-target-sum) |
| [0496-next-greater-element-i](https://github.com/satya-supercluster/Leetcode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0503-next-greater-element-ii) |
| [0561-array-partition](https://github.com/satya-supercluster/Leetcode/tree/master/0561-array-partition) |
| [0659-split-array-into-consecutive-subsequences](https://github.com/satya-supercluster/Leetcode/tree/master/0659-split-array-into-consecutive-subsequences) |
| [0689-maximum-sum-of-3-non-overlapping-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/0689-maximum-sum-of-3-non-overlapping-subarrays) |
| [0695-max-area-of-island](https://github.com/satya-supercluster/Leetcode/tree/master/0695-max-area-of-island) |
| [0779-max-chunks-to-make-sorted-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0779-max-chunks-to-make-sorted-ii) |
| [0780-max-chunks-to-make-sorted](https://github.com/satya-supercluster/Leetcode/tree/master/0780-max-chunks-to-make-sorted) |
| [0797-rabbits-in-forest](https://github.com/satya-supercluster/Leetcode/tree/master/0797-rabbits-in-forest) |
| [0854-making-a-large-island](https://github.com/satya-supercluster/Leetcode/tree/master/0854-making-a-large-island) |
| [0861-flipping-an-image](https://github.com/satya-supercluster/Leetcode/tree/master/0861-flipping-an-image) |
| [0890-lemonade-change](https://github.com/satya-supercluster/Leetcode/tree/master/0890-lemonade-change) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/satya-supercluster/Leetcode/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [0919-projection-area-of-3d-shapes](https://github.com/satya-supercluster/Leetcode/tree/master/0919-projection-area-of-3d-shapes) |
| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/satya-supercluster/Leetcode/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |
| [0941-sort-array-by-parity](https://github.com/satya-supercluster/Leetcode/tree/master/0941-sort-array-by-parity) |
| [0945-snakes-and-ladders](https://github.com/satya-supercluster/Leetcode/tree/master/0945-snakes-and-ladders) |
| [0951-partition-array-into-disjoint-intervals](https://github.com/satya-supercluster/Leetcode/tree/master/0951-partition-array-into-disjoint-intervals) |
| [0952-word-subsets](https://github.com/satya-supercluster/Leetcode/tree/master/0952-word-subsets) |
| [0958-sort-array-by-parity-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0958-sort-array-by-parity-ii) |
| [1025-minimum-cost-for-tickets](https://github.com/satya-supercluster/Leetcode/tree/master/1025-minimum-cost-for-tickets) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/satya-supercluster/Leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1046-max-consecutive-ones-iii](https://github.com/satya-supercluster/Leetcode/tree/master/1046-max-consecutive-ones-iii) |
| [1049-minimum-domino-rotations-for-equal-row](https://github.com/satya-supercluster/Leetcode/tree/master/1049-minimum-domino-rotations-for-equal-row) |
| [1063-best-sightseeing-pair](https://github.com/satya-supercluster/Leetcode/tree/master/1063-best-sightseeing-pair) |
| [1138-grumpy-bookstore-owner](https://github.com/satya-supercluster/Leetcode/tree/master/1138-grumpy-bookstore-owner) |
| [1206-corporate-flight-bookings](https://github.com/satya-supercluster/Leetcode/tree/master/1206-corporate-flight-bookings) |
| [1224-minimum-falling-path-sum-ii](https://github.com/satya-supercluster/Leetcode/tree/master/1224-minimum-falling-path-sum-ii) |
| [1329-minimum-cost-to-move-chips-to-the-same-position](https://github.com/satya-supercluster/Leetcode/tree/master/1329-minimum-cost-to-move-chips-to-the-same-position) |
| [1335-maximum-candies-allocated-to-k-children](https://github.com/satya-supercluster/Leetcode/tree/master/1335-maximum-candies-allocated-to-k-children) |
| [1360-maximum-length-of-a-concatenated-string-with-unique-characters](https://github.com/satya-supercluster/Leetcode/tree/master/1360-maximum-length-of-a-concatenated-string-with-unique-characters) |
| [1364-tuple-with-same-product](https://github.com/satya-supercluster/Leetcode/tree/master/1364-tuple-with-same-product) |
| [1370-count-number-of-nice-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/1370-count-number-of-nice-subarrays) |
| [1378-cells-with-odd-values-in-a-matrix](https://github.com/satya-supercluster/Leetcode/tree/master/1378-cells-with-odd-values-in-a-matrix) |
| [1396-count-servers-that-communicate](https://github.com/satya-supercluster/Leetcode/tree/master/1396-count-servers-that-communicate) |
| [1421-find-numbers-with-even-number-of-digits](https://github.com/satya-supercluster/Leetcode/tree/master/1421-find-numbers-with-even-number-of-digits) |
| [1422-divide-array-in-sets-of-k-consecutive-numbers](https://github.com/satya-supercluster/Leetcode/tree/master/1422-divide-array-in-sets-of-k-consecutive-numbers) |
| [1476-count-negative-numbers-in-a-sorted-matrix](https://github.com/satya-supercluster/Leetcode/tree/master/1476-count-negative-numbers-in-a-sorted-matrix) |
| [1477-product-of-the-last-k-numbers](https://github.com/satya-supercluster/Leetcode/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/satya-supercluster/Leetcode/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |
| [1524-string-matching-in-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/1524-string-matching-in-an-array) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/satya-supercluster/Leetcode/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/satya-supercluster/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |
| [1562-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list](https://github.com/satya-supercluster/Leetcode/tree/master/1562-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list) |
| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/satya-supercluster/Leetcode/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/satya-supercluster/Leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [1656-count-good-triplets](https://github.com/satya-supercluster/Leetcode/tree/master/1656-count-good-triplets) |
| [1677-matrix-diagonal-sum](https://github.com/satya-supercluster/Leetcode/tree/master/1677-matrix-diagonal-sum) |
| [1696-strange-printer-ii](https://github.com/satya-supercluster/Leetcode/tree/master/1696-strange-printer-ii) |
| [1720-crawler-log-folder](https://github.com/satya-supercluster/Leetcode/tree/master/1720-crawler-log-folder) |
| [1744-number-of-ways-to-form-a-target-string-given-a-dictionary](https://github.com/satya-supercluster/Leetcode/tree/master/1744-number-of-ways-to-form-a-target-string-given-a-dictionary) |
| [1781-check-if-two-string-arrays-are-equivalent](https://github.com/satya-supercluster/Leetcode/tree/master/1781-check-if-two-string-arrays-are-equivalent) |
| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/satya-supercluster/Leetcode/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |
| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/satya-supercluster/Leetcode/tree/master/1849-maximum-absolute-sum-of-any-subarray) |
| [1876-map-of-highest-peak](https://github.com/satya-supercluster/Leetcode/tree/master/1876-map-of-highest-peak) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/satya-supercluster/Leetcode/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/satya-supercluster/Leetcode/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [1917-maximum-average-pass-ratio](https://github.com/satya-supercluster/Leetcode/tree/master/1917-maximum-average-pass-ratio) |
| [1927-maximum-ascending-subarray-sum](https://github.com/satya-supercluster/Leetcode/tree/master/1927-maximum-ascending-subarray-sum) |
| [1993-sum-of-all-subset-xor-totals](https://github.com/satya-supercluster/Leetcode/tree/master/1993-sum-of-all-subset-xor-totals) |
| [2048-build-array-from-permutation](https://github.com/satya-supercluster/Leetcode/tree/master/2048-build-array-from-permutation) |
| [2093-check-if-string-is-a-prefix-of-array](https://github.com/satya-supercluster/Leetcode/tree/master/2093-check-if-string-is-a-prefix-of-array) |
| [2107-find-unique-binary-string](https://github.com/satya-supercluster/Leetcode/tree/master/2107-find-unique-binary-string) |
| [2138-sum-of-beauty-in-the-array](https://github.com/satya-supercluster/Leetcode/tree/master/2138-sum-of-beauty-in-the-array) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/satya-supercluster/Leetcode/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/satya-supercluster/Leetcode/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/satya-supercluster/Leetcode/tree/master/2180-maximum-number-of-tasks-you-can-assign) |
| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/satya-supercluster/Leetcode/tree/master/2220-find-all-possible-recipes-from-given-supplies) |
| [2227-sum-of-subarray-ranges](https://github.com/satya-supercluster/Leetcode/tree/master/2227-sum-of-subarray-ranges) |
| [2249-count-the-hidden-sequences](https://github.com/satya-supercluster/Leetcode/tree/master/2249-count-the-hidden-sequences) |
| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/satya-supercluster/Leetcode/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/satya-supercluster/Leetcode/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
| [2262-solving-questions-with-brainpower](https://github.com/satya-supercluster/Leetcode/tree/master/2262-solving-questions-with-brainpower) |
| [2265-partition-array-according-to-given-pivot](https://github.com/satya-supercluster/Leetcode/tree/master/2265-partition-array-according-to-given-pivot) |
| [2277-count-equal-and-divisible-pairs-in-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/2277-count-equal-and-divisible-pairs-in-an-array) |
| [2280-count-good-triplets-in-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/2280-count-good-triplets-in-an-array) |
| [2285-design-bitset](https://github.com/satya-supercluster/Leetcode/tree/master/2285-design-bitset) |
| [2292-counting-words-with-a-given-prefix](https://github.com/satya-supercluster/Leetcode/tree/master/2292-counting-words-with-a-given-prefix) |
| [2308-divide-array-into-equal-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/2308-divide-array-into-equal-pairs) |
| [2341-count-prefixes-of-a-given-string](https://github.com/satya-supercluster/Leetcode/tree/master/2341-count-prefixes-of-a-given-string) |
| [2358-number-of-ways-to-split-array](https://github.com/satya-supercluster/Leetcode/tree/master/2358-number-of-ways-to-split-array) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/satya-supercluster/Leetcode/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2398-check-if-matrix-is-x-matrix](https://github.com/satya-supercluster/Leetcode/tree/master/2398-check-if-matrix-is-x-matrix) |
| [2448-count-number-of-bad-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/2448-count-number-of-bad-pairs) |
| [2465-shifting-letters-ii](https://github.com/satya-supercluster/Leetcode/tree/master/2465-shifting-letters-ii) |
| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/satya-supercluster/Leetcode/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |
| [2478-longest-nice-subarray](https://github.com/satya-supercluster/Leetcode/tree/master/2478-longest-nice-subarray) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/satya-supercluster/Leetcode/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/satya-supercluster/Leetcode/tree/master/2527-count-subarrays-with-fixed-bounds) |
| [2531-create-components-with-same-value](https://github.com/satya-supercluster/Leetcode/tree/master/2531-create-components-with-same-value) |
| [2533-bitwise-xor-of-all-pairings](https://github.com/satya-supercluster/Leetcode/tree/master/2533-bitwise-xor-of-all-pairings) |
| [2551-apply-operations-to-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/2551-apply-operations-to-an-array) |
| [2554-minimum-total-distance-traveled](https://github.com/satya-supercluster/Leetcode/tree/master/2554-minimum-total-distance-traveled) |
| [2564-most-profitable-path-in-a-tree](https://github.com/satya-supercluster/Leetcode/tree/master/2564-most-profitable-path-in-a-tree) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/satya-supercluster/Leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/satya-supercluster/Leetcode/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [2626-count-the-number-of-good-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/2626-count-the-number-of-good-subarrays) |
| [2665-minimum-time-to-repair-cars](https://github.com/satya-supercluster/Leetcode/tree/master/2665-minimum-time-to-repair-cars) |
| [2681-put-marbles-in-bags](https://github.com/satya-supercluster/Leetcode/tree/master/2681-put-marbles-in-bags) |
| [2685-first-completely-painted-row-or-column](https://github.com/satya-supercluster/Leetcode/tree/master/2685-first-completely-painted-row-or-column) |
| [2690-house-robber-iv](https://github.com/satya-supercluster/Leetcode/tree/master/2690-house-robber-iv) |
| [2691-count-vowel-strings-in-ranges](https://github.com/satya-supercluster/Leetcode/tree/master/2691-count-vowel-strings-in-ranges) |
| [2692-take-gifts-from-the-richest-pile](https://github.com/satya-supercluster/Leetcode/tree/master/2692-take-gifts-from-the-richest-pile) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/satya-supercluster/Leetcode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2698-find-the-array-concatenation-value](https://github.com/satya-supercluster/Leetcode/tree/master/2698-find-the-array-concatenation-value) |
| [2699-count-the-number-of-fair-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/2699-count-the-number-of-fair-pairs) |
| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/satya-supercluster/Leetcode/tree/master/2707-merge-two-2d-arrays-by-summing-values) |
| [2717-collect-coins-in-a-tree](https://github.com/satya-supercluster/Leetcode/tree/master/2717-collect-coins-in-a-tree) |
| [2727-number-of-senior-citizens](https://github.com/satya-supercluster/Leetcode/tree/master/2727-number-of-senior-citizens) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/satya-supercluster/Leetcode/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/satya-supercluster/Leetcode/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |
| [2792-neighboring-bitwise-xor](https://github.com/satya-supercluster/Leetcode/tree/master/2792-neighboring-bitwise-xor) |
| [2856-count-complete-subarrays-in-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/2856-count-complete-subarrays-in-an-array) |
| [2868-continuous-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/2868-continuous-subarrays) |
| [2888-minimum-index-of-a-valid-split](https://github.com/satya-supercluster/Leetcode/tree/master/2888-minimum-index-of-a-valid-split) |
| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/satya-supercluster/Leetcode/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |
| [2915-count-of-interesting-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/2915-count-of-interesting-subarrays) |
| [3001-apply-operations-to-maximize-score](https://github.com/satya-supercluster/Leetcode/tree/master/3001-apply-operations-to-maximize-score) |
| [3152-maximum-value-of-an-ordered-triplet-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3152-maximum-value-of-an-ordered-triplet-ii) |
| [3154-maximum-value-of-an-ordered-triplet-i](https://github.com/satya-supercluster/Leetcode/tree/master/3154-maximum-value-of-an-ordered-triplet-i) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/satya-supercluster/Leetcode/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3186-minimum-sum-of-mountain-triplets-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3186-minimum-sum-of-mountain-triplets-ii) |
| [3213-count-subarrays-where-max-element-appears-at-least-k-times](https://github.com/satya-supercluster/Leetcode/tree/master/3213-count-subarrays-where-max-element-appears-at-least-k-times) |
| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/satya-supercluster/Leetcode/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |
| [3227-find-missing-and-repeated-values](https://github.com/satya-supercluster/Leetcode/tree/master/3227-find-missing-and-repeated-values) |
| [3263-divide-an-array-into-subarrays-with-minimum-cost-i](https://github.com/satya-supercluster/Leetcode/tree/master/3263-divide-an-array-into-subarrays-with-minimum-cost-i) |
| [3307-find-the-maximum-sum-of-node-values](https://github.com/satya-supercluster/Leetcode/tree/master/3307-find-the-maximum-sum-of-node-values) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/satya-supercluster/Leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |
| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/satya-supercluster/Leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/satya-supercluster/Leetcode/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |
| [3429-special-array-i](https://github.com/satya-supercluster/Leetcode/tree/master/3429-special-array-i) |
| [3430-count-days-without-meetings](https://github.com/satya-supercluster/Leetcode/tree/master/3430-count-days-without-meetings) |
| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/satya-supercluster/Leetcode/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |
| [3442-maximum-total-reward-using-operations-i](https://github.com/satya-supercluster/Leetcode/tree/master/3442-maximum-total-reward-using-operations-i) |
| [3460-count-the-number-of-inversions](https://github.com/satya-supercluster/Leetcode/tree/master/3460-count-the-number-of-inversions) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/satya-supercluster/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
| [3477-minimum-operations-to-make-binary-array-elements-equal-to-one-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3477-minimum-operations-to-make-binary-array-elements-equal-to-one-ii) |
| [3483-alternating-groups-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3483-alternating-groups-ii) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/satya-supercluster/Leetcode/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
| [3621-minimum-operations-to-make-array-values-equal-to-k](https://github.com/satya-supercluster/Leetcode/tree/master/3621-minimum-operations-to-make-array-values-equal-to-k) |
| [3643-zero-array-transformation-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3643-zero-array-transformation-ii) |
| [3656-minimum-number-of-operations-to-make-elements-in-array-distinct](https://github.com/satya-supercluster/Leetcode/tree/master/3656-minimum-number-of-operations-to-make-elements-in-array-distinct) |
| [3657-check-if-grid-can-be-cut-into-sections](https://github.com/satya-supercluster/Leetcode/tree/master/3657-check-if-grid-can-be-cut-into-sections) |
| [3702-maximum-subarray-with-equal-products](https://github.com/satya-supercluster/Leetcode/tree/master/3702-maximum-subarray-with-equal-products) |
| [3751-maximum-frequency-after-subarray-operation](https://github.com/satya-supercluster/Leetcode/tree/master/3751-maximum-frequency-after-subarray-operation) |
## Binary Search
| |
| ------- |
| [0300-longest-increasing-subsequence](https://github.com/satya-supercluster/Leetcode/tree/master/0300-longest-increasing-subsequence) |
| [0493-reverse-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/0493-reverse-pairs) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/satya-supercluster/Leetcode/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1046-max-consecutive-ones-iii](https://github.com/satya-supercluster/Leetcode/tree/master/1046-max-consecutive-ones-iii) |
| [1335-maximum-candies-allocated-to-k-children](https://github.com/satya-supercluster/Leetcode/tree/master/1335-maximum-candies-allocated-to-k-children) |
| [1476-count-negative-numbers-in-a-sorted-matrix](https://github.com/satya-supercluster/Leetcode/tree/master/1476-count-negative-numbers-in-a-sorted-matrix) |
| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/satya-supercluster/Leetcode/tree/master/2180-maximum-number-of-tasks-you-can-assign) |
| [2280-count-good-triplets-in-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/2280-count-good-triplets-in-an-array) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/satya-supercluster/Leetcode/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/satya-supercluster/Leetcode/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [2665-minimum-time-to-repair-cars](https://github.com/satya-supercluster/Leetcode/tree/master/2665-minimum-time-to-repair-cars) |
| [2690-house-robber-iv](https://github.com/satya-supercluster/Leetcode/tree/master/2690-house-robber-iv) |
| [2699-count-the-number-of-fair-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/2699-count-the-number-of-fair-pairs) |
| [2701-subsequence-with-the-minimum-score](https://github.com/satya-supercluster/Leetcode/tree/master/2701-subsequence-with-the-minimum-score) |
| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/satya-supercluster/Leetcode/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/satya-supercluster/Leetcode/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3643-zero-array-transformation-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3643-zero-array-transformation-ii) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/satya-supercluster/Leetcode/tree/master/0014-longest-common-prefix) |
| [0208-implement-trie-prefix-tree](https://github.com/satya-supercluster/Leetcode/tree/master/0208-implement-trie-prefix-tree) |
| [0211-design-add-and-search-words-data-structure](https://github.com/satya-supercluster/Leetcode/tree/master/0211-design-add-and-search-words-data-structure) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/satya-supercluster/Leetcode/tree/master/3309-count-prefix-and-suffix-pairs-i) |
## Recursion
| |
| ------- |
| [0010-regular-expression-matching](https://github.com/satya-supercluster/Leetcode/tree/master/0010-regular-expression-matching) |
| [0024-swap-nodes-in-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/0024-swap-nodes-in-pairs) |
| [0044-wildcard-matching](https://github.com/satya-supercluster/Leetcode/tree/master/0044-wildcard-matching) |
| [0060-permutation-sequence](https://github.com/satya-supercluster/Leetcode/tree/master/0060-permutation-sequence) |
| [0231-power-of-two](https://github.com/satya-supercluster/Leetcode/tree/master/0231-power-of-two) |
| [0234-palindrome-linked-list](https://github.com/satya-supercluster/Leetcode/tree/master/0234-palindrome-linked-list) |
| [2050-count-good-numbers](https://github.com/satya-supercluster/Leetcode/tree/master/2050-count-good-numbers) |
## Two Pointers
| |
| ------- |
| [0011-container-with-most-water](https://github.com/satya-supercluster/Leetcode/tree/master/0011-container-with-most-water) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/satya-supercluster/Leetcode/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/satya-supercluster/Leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0088-merge-sorted-array](https://github.com/satya-supercluster/Leetcode/tree/master/0088-merge-sorted-array) |
| [0148-sort-list](https://github.com/satya-supercluster/Leetcode/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/satya-supercluster/Leetcode/tree/master/0160-intersection-of-two-linked-lists) |
| [0189-rotate-array](https://github.com/satya-supercluster/Leetcode/tree/master/0189-rotate-array) |
| [0234-palindrome-linked-list](https://github.com/satya-supercluster/Leetcode/tree/master/0234-palindrome-linked-list) |
| [0344-reverse-string](https://github.com/satya-supercluster/Leetcode/tree/master/0344-reverse-string) |
| [0556-next-greater-element-iii](https://github.com/satya-supercluster/Leetcode/tree/master/0556-next-greater-element-iii) |
| [0557-reverse-words-in-a-string-iii](https://github.com/satya-supercluster/Leetcode/tree/master/0557-reverse-words-in-a-string-iii) |
| [0768-partition-labels](https://github.com/satya-supercluster/Leetcode/tree/master/0768-partition-labels) |
| [0861-flipping-an-image](https://github.com/satya-supercluster/Leetcode/tree/master/0861-flipping-an-image) |
| [0868-push-dominoes](https://github.com/satya-supercluster/Leetcode/tree/master/0868-push-dominoes) |
| [0908-middle-of-the-linked-list](https://github.com/satya-supercluster/Leetcode/tree/master/0908-middle-of-the-linked-list) |
| [0941-sort-array-by-parity](https://github.com/satya-supercluster/Leetcode/tree/master/0941-sort-array-by-parity) |
| [0958-sort-array-by-parity-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0958-sort-array-by-parity-ii) |
| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/satya-supercluster/Leetcode/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
| [2093-check-if-string-is-a-prefix-of-array](https://github.com/satya-supercluster/Leetcode/tree/master/2093-check-if-string-is-a-prefix-of-array) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/satya-supercluster/Leetcode/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
| [2265-partition-array-according-to-given-pivot](https://github.com/satya-supercluster/Leetcode/tree/master/2265-partition-array-according-to-given-pivot) |
| [2551-apply-operations-to-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/2551-apply-operations-to-an-array) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/satya-supercluster/Leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2698-find-the-array-concatenation-value](https://github.com/satya-supercluster/Leetcode/tree/master/2698-find-the-array-concatenation-value) |
| [2699-count-the-number-of-fair-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/2699-count-the-number-of-fair-pairs) |
| [2701-subsequence-with-the-minimum-score](https://github.com/satya-supercluster/Leetcode/tree/master/2701-subsequence-with-the-minimum-score) |
| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/satya-supercluster/Leetcode/tree/master/2707-merge-two-2d-arrays-by-summing-values) |
## Matrix
| |
| ------- |
| [0085-maximal-rectangle](https://github.com/satya-supercluster/Leetcode/tree/master/0085-maximal-rectangle) |
| [0221-maximal-square](https://github.com/satya-supercluster/Leetcode/tree/master/0221-maximal-square) |
| [0407-trapping-rain-water-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0407-trapping-rain-water-ii) |
| [0695-max-area-of-island](https://github.com/satya-supercluster/Leetcode/tree/master/0695-max-area-of-island) |
| [0854-making-a-large-island](https://github.com/satya-supercluster/Leetcode/tree/master/0854-making-a-large-island) |
| [0861-flipping-an-image](https://github.com/satya-supercluster/Leetcode/tree/master/0861-flipping-an-image) |
| [0919-projection-area-of-3d-shapes](https://github.com/satya-supercluster/Leetcode/tree/master/0919-projection-area-of-3d-shapes) |
| [0945-snakes-and-ladders](https://github.com/satya-supercluster/Leetcode/tree/master/0945-snakes-and-ladders) |
| [1224-minimum-falling-path-sum-ii](https://github.com/satya-supercluster/Leetcode/tree/master/1224-minimum-falling-path-sum-ii) |
| [1396-count-servers-that-communicate](https://github.com/satya-supercluster/Leetcode/tree/master/1396-count-servers-that-communicate) |
| [1476-count-negative-numbers-in-a-sorted-matrix](https://github.com/satya-supercluster/Leetcode/tree/master/1476-count-negative-numbers-in-a-sorted-matrix) |
| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/satya-supercluster/Leetcode/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |
| [1677-matrix-diagonal-sum](https://github.com/satya-supercluster/Leetcode/tree/master/1677-matrix-diagonal-sum) |
| [1696-strange-printer-ii](https://github.com/satya-supercluster/Leetcode/tree/master/1696-strange-printer-ii) |
| [1876-map-of-highest-peak](https://github.com/satya-supercluster/Leetcode/tree/master/1876-map-of-highest-peak) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/satya-supercluster/Leetcode/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/satya-supercluster/Leetcode/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |
| [2398-check-if-matrix-is-x-matrix](https://github.com/satya-supercluster/Leetcode/tree/master/2398-check-if-matrix-is-x-matrix) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/satya-supercluster/Leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2685-first-completely-painted-row-or-column](https://github.com/satya-supercluster/Leetcode/tree/master/2685-first-completely-painted-row-or-column) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/satya-supercluster/Leetcode/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [3227-find-missing-and-repeated-values](https://github.com/satya-supercluster/Leetcode/tree/master/3227-find-missing-and-repeated-values) |
## Stack
| |
| ------- |
| [0085-maximal-rectangle](https://github.com/satya-supercluster/Leetcode/tree/master/0085-maximal-rectangle) |
| [0155-min-stack](https://github.com/satya-supercluster/Leetcode/tree/master/0155-min-stack) |
| [0234-palindrome-linked-list](https://github.com/satya-supercluster/Leetcode/tree/master/0234-palindrome-linked-list) |
| [0316-remove-duplicate-letters](https://github.com/satya-supercluster/Leetcode/tree/master/0316-remove-duplicate-letters) |
| [0402-remove-k-digits](https://github.com/satya-supercluster/Leetcode/tree/master/0402-remove-k-digits) |
| [0496-next-greater-element-i](https://github.com/satya-supercluster/Leetcode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0503-next-greater-element-ii) |
| [0726-number-of-atoms](https://github.com/satya-supercluster/Leetcode/tree/master/0726-number-of-atoms) |
| [0779-max-chunks-to-make-sorted-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0779-max-chunks-to-make-sorted-ii) |
| [0780-max-chunks-to-make-sorted](https://github.com/satya-supercluster/Leetcode/tree/master/0780-max-chunks-to-make-sorted) |
| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/satya-supercluster/Leetcode/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |
| [1720-crawler-log-folder](https://github.com/satya-supercluster/Leetcode/tree/master/1720-crawler-log-folder) |
| [1818-maximum-score-from-removing-substrings](https://github.com/satya-supercluster/Leetcode/tree/master/1818-maximum-score-from-removing-substrings) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/satya-supercluster/Leetcode/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/satya-supercluster/Leetcode/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |
| [2227-sum-of-subarray-ranges](https://github.com/satya-supercluster/Leetcode/tree/master/2227-sum-of-subarray-ranges) |
| [2456-construct-smallest-number-from-di-string](https://github.com/satya-supercluster/Leetcode/tree/master/2456-construct-smallest-number-from-di-string) |
| [2800-minimum-string-length-after-removing-substrings](https://github.com/satya-supercluster/Leetcode/tree/master/2800-minimum-string-length-after-removing-substrings) |
| [3001-apply-operations-to-maximize-score](https://github.com/satya-supercluster/Leetcode/tree/master/3001-apply-operations-to-maximize-score) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/satya-supercluster/Leetcode/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3447-clear-digits](https://github.com/satya-supercluster/Leetcode/tree/master/3447-clear-digits) |
## Bit Manipulation
| |
| ------- |
| [0078-subsets](https://github.com/satya-supercluster/Leetcode/tree/master/0078-subsets) |
| [0191-number-of-1-bits](https://github.com/satya-supercluster/Leetcode/tree/master/0191-number-of-1-bits) |
| [0231-power-of-two](https://github.com/satya-supercluster/Leetcode/tree/master/0231-power-of-two) |
| [0260-single-number-iii](https://github.com/satya-supercluster/Leetcode/tree/master/0260-single-number-iii) |
| [0338-counting-bits](https://github.com/satya-supercluster/Leetcode/tree/master/0338-counting-bits) |
| [0861-flipping-an-image](https://github.com/satya-supercluster/Leetcode/tree/master/0861-flipping-an-image) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/satya-supercluster/Leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1360-maximum-length-of-a-concatenated-string-with-unique-characters](https://github.com/satya-supercluster/Leetcode/tree/master/1360-maximum-length-of-a-concatenated-string-with-unique-characters) |
| [1441-minimum-flips-to-make-a-or-b-equal-to-c](https://github.com/satya-supercluster/Leetcode/tree/master/1441-minimum-flips-to-make-a-or-b-equal-to-c) |
| [1993-sum-of-all-subset-xor-totals](https://github.com/satya-supercluster/Leetcode/tree/master/1993-sum-of-all-subset-xor-totals) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/satya-supercluster/Leetcode/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2308-divide-array-into-equal-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/2308-divide-array-into-equal-pairs) |
| [2478-longest-nice-subarray](https://github.com/satya-supercluster/Leetcode/tree/master/2478-longest-nice-subarray) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/satya-supercluster/Leetcode/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [2509-minimize-xor](https://github.com/satya-supercluster/Leetcode/tree/master/2509-minimize-xor) |
| [2533-bitwise-xor-of-all-pairings](https://github.com/satya-supercluster/Leetcode/tree/master/2533-bitwise-xor-of-all-pairings) |
| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/satya-supercluster/Leetcode/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |
| [2792-neighboring-bitwise-xor](https://github.com/satya-supercluster/Leetcode/tree/master/2792-neighboring-bitwise-xor) |
| [3307-find-the-maximum-sum-of-node-values](https://github.com/satya-supercluster/Leetcode/tree/master/3307-find-the-maximum-sum-of-node-values) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/satya-supercluster/Leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/satya-supercluster/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
## Queue
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/satya-supercluster/Leetcode/tree/master/0239-sliding-window-maximum) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/satya-supercluster/Leetcode/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/satya-supercluster/Leetcode/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/satya-supercluster/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/satya-supercluster/Leetcode/tree/master/2180-maximum-number-of-tasks-you-can-assign) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/satya-supercluster/Leetcode/tree/master/2527-count-subarrays-with-fixed-bounds) |
| [2868-continuous-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/2868-continuous-subarrays) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/satya-supercluster/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
## Sliding Window
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/satya-supercluster/Leetcode/tree/master/0239-sliding-window-maximum) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/satya-supercluster/Leetcode/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/satya-supercluster/Leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1046-max-consecutive-ones-iii](https://github.com/satya-supercluster/Leetcode/tree/master/1046-max-consecutive-ones-iii) |
| [1138-grumpy-bookstore-owner](https://github.com/satya-supercluster/Leetcode/tree/master/1138-grumpy-bookstore-owner) |
| [1370-count-number-of-nice-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/1370-count-number-of-nice-subarrays) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/satya-supercluster/Leetcode/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/satya-supercluster/Leetcode/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/satya-supercluster/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/satya-supercluster/Leetcode/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/satya-supercluster/Leetcode/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/satya-supercluster/Leetcode/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2463-minimum-recolors-to-get-k-consecutive-black-blocks](https://github.com/satya-supercluster/Leetcode/tree/master/2463-minimum-recolors-to-get-k-consecutive-black-blocks) |
| [2478-longest-nice-subarray](https://github.com/satya-supercluster/Leetcode/tree/master/2478-longest-nice-subarray) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/satya-supercluster/Leetcode/tree/master/2527-count-subarrays-with-fixed-bounds) |
| [2626-count-the-number-of-good-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/2626-count-the-number-of-good-subarrays) |
| [2856-count-complete-subarrays-in-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/2856-count-complete-subarrays-in-an-array) |
| [2868-continuous-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/2868-continuous-subarrays) |
| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/satya-supercluster/Leetcode/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |
| [3213-count-subarrays-where-max-element-appears-at-least-k-times](https://github.com/satya-supercluster/Leetcode/tree/master/3213-count-subarrays-where-max-element-appears-at-least-k-times) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/satya-supercluster/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
| [3483-alternating-groups-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3483-alternating-groups-ii) |
| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
| [3702-maximum-subarray-with-equal-products](https://github.com/satya-supercluster/Leetcode/tree/master/3702-maximum-subarray-with-equal-products) |
## Prefix Sum
| |
| ------- |
| [0303-range-sum-query-immutable](https://github.com/satya-supercluster/Leetcode/tree/master/0303-range-sum-query-immutable) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/satya-supercluster/Leetcode/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/satya-supercluster/Leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1046-max-consecutive-ones-iii](https://github.com/satya-supercluster/Leetcode/tree/master/1046-max-consecutive-ones-iii) |
| [1206-corporate-flight-bookings](https://github.com/satya-supercluster/Leetcode/tree/master/1206-corporate-flight-bookings) |
| [1477-product-of-the-last-k-numbers](https://github.com/satya-supercluster/Leetcode/tree/master/1477-product-of-the-last-k-numbers) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/satya-supercluster/Leetcode/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/satya-supercluster/Leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/satya-supercluster/Leetcode/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [2249-count-the-hidden-sequences](https://github.com/satya-supercluster/Leetcode/tree/master/2249-count-the-hidden-sequences) |
| [2358-number-of-ways-to-split-array](https://github.com/satya-supercluster/Leetcode/tree/master/2358-number-of-ways-to-split-array) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/satya-supercluster/Leetcode/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2465-shifting-letters-ii](https://github.com/satya-supercluster/Leetcode/tree/master/2465-shifting-letters-ii) |
| [2691-count-vowel-strings-in-ranges](https://github.com/satya-supercluster/Leetcode/tree/master/2691-count-vowel-strings-in-ranges) |
| [2915-count-of-interesting-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/2915-count-of-interesting-subarrays) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/satya-supercluster/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
| [3643-zero-array-transformation-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3643-zero-array-transformation-ii) |
| [3751-maximum-frequency-after-subarray-operation](https://github.com/satya-supercluster/Leetcode/tree/master/3751-maximum-frequency-after-subarray-operation) |
## Heap (Priority Queue)
| |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/0215-kth-largest-element-in-an-array) |
| [0239-sliding-window-maximum](https://github.com/satya-supercluster/Leetcode/tree/master/0239-sliding-window-maximum) |
| [0407-trapping-rain-water-ii](https://github.com/satya-supercluster/Leetcode/tree/master/0407-trapping-rain-water-ii) |
| [0659-split-array-into-consecutive-subsequences](https://github.com/satya-supercluster/Leetcode/tree/master/0659-split-array-into-consecutive-subsequences) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/satya-supercluster/Leetcode/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/satya-supercluster/Leetcode/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/satya-supercluster/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [1917-maximum-average-pass-ratio](https://github.com/satya-supercluster/Leetcode/tree/master/1917-maximum-average-pass-ratio) |
| [2300-construct-string-with-repeat-limit](https://github.com/satya-supercluster/Leetcode/tree/master/2300-construct-string-with-repeat-limit) |
| [2434-design-a-number-container-system](https://github.com/satya-supercluster/Leetcode/tree/master/2434-design-a-number-container-system) |
| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/satya-supercluster/Leetcode/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/satya-supercluster/Leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2681-put-marbles-in-bags](https://github.com/satya-supercluster/Leetcode/tree/master/2681-put-marbles-in-bags) |
| [2692-take-gifts-from-the-richest-pile](https://github.com/satya-supercluster/Leetcode/tree/master/2692-take-gifts-from-the-richest-pile) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/satya-supercluster/Leetcode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2868-continuous-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/2868-continuous-subarrays) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/satya-supercluster/Leetcode/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/satya-supercluster/Leetcode/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/satya-supercluster/Leetcode/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Ordered Set
| |
| ------- |
| [0493-reverse-pairs](https://github.com/satya-supercluster/Leetcode/tree/master/0493-reverse-pairs) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/satya-supercluster/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [2280-count-good-triplets-in-an-array](https://github.com/satya-supercluster/Leetcode/tree/master/2280-count-good-triplets-in-an-array) |
| [2434-design-a-number-container-system](https://github.com/satya-supercluster/Leetcode/tree/master/2434-design-a-number-container-system) |
| [2868-continuous-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/2868-continuous-subarrays) |
## Monotonic Queue
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/satya-supercluster/Leetcode/tree/master/0239-sliding-window-maximum) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/satya-supercluster/Leetcode/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/satya-supercluster/Leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/satya-supercluster/Leetcode/tree/master/2180-maximum-number-of-tasks-you-can-assign) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/satya-supercluster/Leetcode/tree/master/2527-count-subarrays-with-fixed-bounds) |
| [2868-continuous-subarrays](https://github.com/satya-supercluster/Leetcode/tree/master/2868-continuous-subarrays) |
## Hash Table
| |
| ------- |
| [0012-integer-to-roman](https://github.com/satya-supercluster/Leetcode/tree/master/0012-integer-to-roman) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/satya-supercluster/Leetcode/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0128-longest-consecutive-sequence](https://github.com/satya-supercluster/Leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0138-copy-list-with-random-pointer](https://github.com/satya-supercluster/Leetcode/tree/master/0138-copy-list-with-random-pointer) |
| [0146-lru-cache](https://github.com/satya-supercluster/Leetcode/tree/master/0146-lru-cache) |
| [0160-intersection-of-two-linked-lists](https://github.com/satya-supercluster/Leetcode/tree/master/0160-intersection-of-two-linked-lists) |
| [0208-implement-trie-prefix-tree](https://github.com/satya-supercluster/Leetcode/tree/master/0208-implement-trie-prefix-tree) |
| [0496-next-greater-element-i](https://github.com/satya-supercluster/Leetcode/tree/master/0496-next-greater-element-i) |
| [0659-split-array-into-consecutive-subsequences](https://github.com/satya-supercluster/Leetcode/tree/master/0659-split-array-into-consecutive-subsequences) |
| [0726-number-of-atoms](https://github.com/satya-supercluster/Leetcode/tree/ma