https://github.com/sahilsrivastava25/dsa
A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
https://github.com/sahilsrivastava25/dsa
cpp java leetcode-solutions
Last synced: 2 months ago
JSON representation
A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
- Host: GitHub
- URL: https://github.com/sahilsrivastava25/dsa
- Owner: sahilsrivastava25
- Created: 2024-06-25T07:06:25.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2025-06-11T17:03:23.000Z (about 1 year ago)
- Last Synced: 2025-06-11T18:15:14.496Z (about 1 year ago)
- Topics: cpp, java, leetcode-solutions
- Language: C++
- Homepage:
- Size: 1.03 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# DSA
A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
# Array
| |
| ------- |
| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
| [1528-kids-with-the-greatest-number-of-candies](https://github.com/sahilsrivastava25/DSA/tree/master/1528-kids-with-the-greatest-number-of-candies) |
| [1580-shuffle-the-array](https://github.com/sahilsrivastava25/DSA/tree/master/1580-shuffle-the-array) |
# Hash Table
| |
| ------- |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
# Math
| |
| ------- |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
# Binary Search
| |
| ------- |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
# Bit Manipulation
| |
| ------- |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
# Sorting
| |
| ------- |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
# Matrix
| |
| ------- |
| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |
# Simulation
| |
| ------- |
| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |
# LeetCode Topics
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/0002-add-two-numbers) |
| [0048-rotate-image](https://github.com/sahilsrivastava25/DSA/tree/master/0048-rotate-image) |
| [0189-rotate-array](https://github.com/sahilsrivastava25/DSA/tree/master/0189-rotate-array) |
| [0231-power-of-two](https://github.com/sahilsrivastava25/DSA/tree/master/0231-power-of-two) |
| [0241-different-ways-to-add-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0241-different-ways-to-add-parentheses) |
| [0264-ugly-number-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0264-ugly-number-ii) |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
| [0273-integer-to-english-words](https://github.com/sahilsrivastava25/DSA/tree/master/0273-integer-to-english-words) |
| [0412-fizz-buzz](https://github.com/sahilsrivastava25/DSA/tree/master/0412-fizz-buzz) |
| [0539-minimum-time-difference](https://github.com/sahilsrivastava25/DSA/tree/master/0539-minimum-time-difference) |
| [0564-find-the-closest-palindrome](https://github.com/sahilsrivastava25/DSA/tree/master/0564-find-the-closest-palindrome) |
| [0592-fraction-addition-and-subtraction](https://github.com/sahilsrivastava25/DSA/tree/master/0592-fraction-addition-and-subtraction) |
| [0650-2-keys-keyboard](https://github.com/sahilsrivastava25/DSA/tree/master/0650-2-keys-keyboard) |
| [0670-maximum-swap](https://github.com/sahilsrivastava25/DSA/tree/master/0670-maximum-swap) |
| [0870-magic-squares-in-grid](https://github.com/sahilsrivastava25/DSA/tree/master/0870-magic-squares-in-grid) |
| [1240-stone-game-ii](https://github.com/sahilsrivastava25/DSA/tree/master/1240-stone-game-ii) |
| [1642-water-bottles](https://github.com/sahilsrivastava25/DSA/tree/master/1642-water-bottles) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/sahilsrivastava25/DSA/tree/master/1951-find-the-winner-of-the-circular-game) |
| [2155-find-missing-observations](https://github.com/sahilsrivastava25/DSA/tree/master/2155-find-missing-observations) |
| [2571-find-the-pivot-integer](https://github.com/sahilsrivastava25/DSA/tree/master/2571-find-the-pivot-integer) |
| [2610-closest-prime-numbers-in-range](https://github.com/sahilsrivastava25/DSA/tree/master/2610-closest-prime-numbers-in-range) |
| [2645-pass-the-pillow](https://github.com/sahilsrivastava25/DSA/tree/master/2645-pass-the-pillow) |
| [2716-prime-subtraction-operation](https://github.com/sahilsrivastava25/DSA/tree/master/2716-prime-subtraction-operation) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/sahilsrivastava25/DSA/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Bit Manipulation
| |
| ------- |
| [0136-single-number](https://github.com/sahilsrivastava25/DSA/tree/master/0136-single-number) |
| [0231-power-of-two](https://github.com/sahilsrivastava25/DSA/tree/master/0231-power-of-two) |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
| [0476-number-complement](https://github.com/sahilsrivastava25/DSA/tree/master/0476-number-complement) |
| [1435-xor-queries-of-a-subarray](https://github.com/sahilsrivastava25/DSA/tree/master/1435-xor-queries-of-a-subarray) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/sahilsrivastava25/DSA/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1786-count-the-number-of-consistent-strings](https://github.com/sahilsrivastava25/DSA/tree/master/1786-count-the-number-of-consistent-strings) |
| [1940-maximum-xor-for-each-query](https://github.com/sahilsrivastava25/DSA/tree/master/1940-maximum-xor-for-each-query) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/sahilsrivastava25/DSA/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2323-minimum-bit-flips-to-convert-number](https://github.com/sahilsrivastava25/DSA/tree/master/2323-minimum-bit-flips-to-convert-number) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/sahilsrivastava25/DSA/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/sahilsrivastava25/DSA/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [3291-find-if-array-can-be-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/3291-find-if-array-can-be-sorted) |
| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |
| [3394-minimum-array-end](https://github.com/sahilsrivastava25/DSA/tree/master/3394-minimum-array-end) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/0002-add-two-numbers) |
| [0021-merge-two-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0021-merge-two-sorted-lists) |
| [0025-reverse-nodes-in-k-group](https://github.com/sahilsrivastava25/DSA/tree/master/0025-reverse-nodes-in-k-group) |
| [0206-reverse-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0206-reverse-linked-list) |
| [0231-power-of-two](https://github.com/sahilsrivastava25/DSA/tree/master/0231-power-of-two) |
| [0234-palindrome-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0234-palindrome-linked-list) |
| [0241-different-ways-to-add-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0241-different-ways-to-add-parentheses) |
| [0273-integer-to-english-words](https://github.com/sahilsrivastava25/DSA/tree/master/0273-integer-to-english-words) |
| [1197-parsing-a-boolean-expression](https://github.com/sahilsrivastava25/DSA/tree/master/1197-parsing-a-boolean-expression) |
| [1667-find-kth-bit-in-nth-binary-string](https://github.com/sahilsrivastava25/DSA/tree/master/1667-find-kth-bit-in-nth-binary-string) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/sahilsrivastava25/DSA/tree/master/1951-find-the-winner-of-the-circular-game) |
| [2573-remove-nodes-from-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2573-remove-nodes-from-linked-list) |
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0004-median-of-two-sorted-arrays) |
| [0015-3sum](https://github.com/sahilsrivastava25/DSA/tree/master/0015-3sum) |
| [0018-4sum](https://github.com/sahilsrivastava25/DSA/tree/master/0018-4sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0031-next-permutation](https://github.com/sahilsrivastava25/DSA/tree/master/0031-next-permutation) |
| [0033-search-in-rotated-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/sahilsrivastava25/DSA/tree/master/0035-search-insert-position) |
| [0040-combination-sum-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0040-combination-sum-ii) |
| [0048-rotate-image](https://github.com/sahilsrivastava25/DSA/tree/master/0048-rotate-image) |
| [0053-maximum-subarray](https://github.com/sahilsrivastava25/DSA/tree/master/0053-maximum-subarray) |
| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |
| [0073-set-matrix-zeroes](https://github.com/sahilsrivastava25/DSA/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0074-search-a-2d-matrix) |
| [0075-sort-colors](https://github.com/sahilsrivastava25/DSA/tree/master/0075-sort-colors) |
| [0118-pascals-triangle](https://github.com/sahilsrivastava25/DSA/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/sahilsrivastava25/DSA/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0128-longest-consecutive-sequence](https://github.com/sahilsrivastava25/DSA/tree/master/0128-longest-consecutive-sequence) |
| [0136-single-number](https://github.com/sahilsrivastava25/DSA/tree/master/0136-single-number) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/sahilsrivastava25/DSA/tree/master/0162-find-peak-element) |
| [0169-majority-element](https://github.com/sahilsrivastava25/DSA/tree/master/0169-majority-element) |
| [0179-largest-number](https://github.com/sahilsrivastava25/DSA/tree/master/0179-largest-number) |
| [0189-rotate-array](https://github.com/sahilsrivastava25/DSA/tree/master/0189-rotate-array) |
| [0229-majority-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0229-majority-element-ii) |
| [0238-product-of-array-except-self](https://github.com/sahilsrivastava25/DSA/tree/master/0238-product-of-array-except-self) |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
| [0283-move-zeroes](https://github.com/sahilsrivastava25/DSA/tree/master/0283-move-zeroes) |
| [0349-intersection-of-two-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0350-intersection-of-two-arrays-ii) |
| [0485-max-consecutive-ones](https://github.com/sahilsrivastava25/DSA/tree/master/0485-max-consecutive-ones) |
| [0494-target-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0494-target-sum) |
| [0496-next-greater-element-i](https://github.com/sahilsrivastava25/DSA/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0503-next-greater-element-ii) |
| [0532-k-diff-pairs-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0532-k-diff-pairs-in-an-array) |
| [0539-minimum-time-difference](https://github.com/sahilsrivastava25/DSA/tree/master/0539-minimum-time-difference) |
| [0540-single-element-in-a-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0540-single-element-in-a-sorted-array) |
| [0560-subarray-sum-equals-k](https://github.com/sahilsrivastava25/DSA/tree/master/0560-subarray-sum-equals-k) |
| [0624-maximum-distance-in-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0624-maximum-distance-in-arrays) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/sahilsrivastava25/DSA/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0729-my-calendar-i](https://github.com/sahilsrivastava25/DSA/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0731-my-calendar-ii) |
| [0780-max-chunks-to-make-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/0780-max-chunks-to-make-sorted) |
| [0787-sliding-puzzle](https://github.com/sahilsrivastava25/DSA/tree/master/0787-sliding-puzzle) |
| [0792-binary-search](https://github.com/sahilsrivastava25/DSA/tree/master/0792-binary-search) |
| [0802-k-th-smallest-prime-fraction](https://github.com/sahilsrivastava25/DSA/tree/master/0802-k-th-smallest-prime-fraction) |
| [0859-design-circular-deque](https://github.com/sahilsrivastava25/DSA/tree/master/0859-design-circular-deque) |
| [0870-magic-squares-in-grid](https://github.com/sahilsrivastava25/DSA/tree/master/0870-magic-squares-in-grid) |
| [0890-lemonade-change](https://github.com/sahilsrivastava25/DSA/tree/master/0890-lemonade-change) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/sahilsrivastava25/DSA/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [0906-walking-robot-simulation](https://github.com/sahilsrivastava25/DSA/tree/master/0906-walking-robot-simulation) |
| [0921-spiral-matrix-iii](https://github.com/sahilsrivastava25/DSA/tree/master/0921-spiral-matrix-iii) |
| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |
| [0966-binary-subarrays-with-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0966-binary-subarrays-with-sum) |
| [0985-bag-of-tokens](https://github.com/sahilsrivastava25/DSA/tree/master/0985-bag-of-tokens) |
| [0999-regions-cut-by-slashes](https://github.com/sahilsrivastava25/DSA/tree/master/0999-regions-cut-by-slashes) |
| [1002-maximum-width-ramp](https://github.com/sahilsrivastava25/DSA/tree/master/1002-maximum-width-ramp) |
| [1025-minimum-cost-for-tickets](https://github.com/sahilsrivastava25/DSA/tree/master/1025-minimum-cost-for-tickets) |
| [1063-best-sightseeing-pair](https://github.com/sahilsrivastava25/DSA/tree/master/1063-best-sightseeing-pair) |
| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/sahilsrivastava25/DSA/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |
| [1196-filling-bookcase-shelves](https://github.com/sahilsrivastava25/DSA/tree/master/1196-filling-bookcase-shelves) |
| [1207-delete-nodes-and-return-forest](https://github.com/sahilsrivastava25/DSA/tree/master/1207-delete-nodes-and-return-forest) |
| [1240-stone-game-ii](https://github.com/sahilsrivastava25/DSA/tree/master/1240-stone-game-ii) |
| [1256-rank-transform-of-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/1256-rank-transform-of-an-array) |
| [1293-three-consecutive-odds](https://github.com/sahilsrivastava25/DSA/tree/master/1293-three-consecutive-odds) |
| [1325-path-with-maximum-probability](https://github.com/sahilsrivastava25/DSA/tree/master/1325-path-with-maximum-probability) |
| [1333-sort-the-jumbled-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/1333-sort-the-jumbled-numbers) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/sahilsrivastava25/DSA/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/sahilsrivastava25/DSA/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1435-xor-queries-of-a-subarray](https://github.com/sahilsrivastava25/DSA/tree/master/1435-xor-queries-of-a-subarray) |
| [1496-lucky-numbers-in-a-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/1496-lucky-numbers-in-a-matrix) |
| [1497-design-a-stack-with-increment-operation](https://github.com/sahilsrivastava25/DSA/tree/master/1497-design-a-stack-with-increment-operation) |
| [1511-count-number-of-teams](https://github.com/sahilsrivastava25/DSA/tree/master/1511-count-number-of-teams) |
| [1524-string-matching-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/1524-string-matching-in-an-array) |
| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |
| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/sahilsrivastava25/DSA/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |
| [1582-design-browser-history](https://github.com/sahilsrivastava25/DSA/tree/master/1582-design-browser-history) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/sahilsrivastava25/DSA/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/sahilsrivastava25/DSA/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/sahilsrivastava25/DSA/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [1694-make-sum-divisible-by-p](https://github.com/sahilsrivastava25/DSA/tree/master/1694-make-sum-divisible-by-p) |
| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |
| [1720-crawler-log-folder](https://github.com/sahilsrivastava25/DSA/tree/master/1720-crawler-log-folder) |
| [1741-sort-array-by-increasing-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/1741-sort-array-by-increasing-frequency) |
| [1755-defuse-the-bomb](https://github.com/sahilsrivastava25/DSA/tree/master/1755-defuse-the-bomb) |
| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/sahilsrivastava25/DSA/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |
| [1786-count-the-number-of-consistent-strings](https://github.com/sahilsrivastava25/DSA/tree/master/1786-count-the-number-of-consistent-strings) |
| [1803-average-waiting-time](https://github.com/sahilsrivastava25/DSA/tree/master/1803-average-waiting-time) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/sahilsrivastava25/DSA/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [1886-minimum-limit-of-balls-in-a-bag](https://github.com/sahilsrivastava25/DSA/tree/master/1886-minimum-limit-of-balls-in-a-bag) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/sahilsrivastava25/DSA/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [1917-maximum-average-pass-ratio](https://github.com/sahilsrivastava25/DSA/tree/master/1917-maximum-average-pass-ratio) |
| [1923-sentence-similarity-iii](https://github.com/sahilsrivastava25/DSA/tree/master/1923-sentence-similarity-iii) |
| [1940-maximum-xor-for-each-query](https://github.com/sahilsrivastava25/DSA/tree/master/1940-maximum-xor-for-each-query) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/sahilsrivastava25/DSA/tree/master/1951-find-the-winner-of-the-circular-game) |
| [1972-rotating-the-box](https://github.com/sahilsrivastava25/DSA/tree/master/1972-rotating-the-box) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/sahilsrivastava25/DSA/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2035-count-sub-islands](https://github.com/sahilsrivastava25/DSA/tree/master/2035-count-sub-islands) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/sahilsrivastava25/DSA/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2067-maximum-number-of-points-with-cost](https://github.com/sahilsrivastava25/DSA/tree/master/2067-maximum-number-of-points-with-cost) |
| [2089-maximum-matrix-sum](https://github.com/sahilsrivastava25/DSA/tree/master/2089-maximum-matrix-sum) |
| [2132-convert-1d-array-into-2d-array](https://github.com/sahilsrivastava25/DSA/tree/master/2132-convert-1d-array-into-2d-array) |
| [2155-find-missing-observations](https://github.com/sahilsrivastava25/DSA/tree/master/2155-find-missing-observations) |
| [2163-kth-distinct-string-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2163-kth-distinct-string-in-an-array) |
| [2164-two-best-non-overlapping-events](https://github.com/sahilsrivastava25/DSA/tree/master/2164-two-best-non-overlapping-events) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/sahilsrivastava25/DSA/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2179-most-beautiful-item-for-each-query](https://github.com/sahilsrivastava25/DSA/tree/master/2179-most-beautiful-item-for-each-query) |
| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/sahilsrivastava25/DSA/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |
| [2232-adding-spaces-to-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2232-adding-spaces-to-a-string) |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
| [2271-rearrange-array-elements-by-sign](https://github.com/sahilsrivastava25/DSA/tree/master/2271-rearrange-array-elements-by-sign) |
| [2306-create-binary-tree-from-descriptions](https://github.com/sahilsrivastava25/DSA/tree/master/2306-create-binary-tree-from-descriptions) |
| [2343-count-unguarded-cells-in-the-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2343-count-unguarded-cells-in-the-grid) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/sahilsrivastava25/DSA/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/sahilsrivastava25/DSA/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |
| [2411-spiral-matrix-iv](https://github.com/sahilsrivastava25/DSA/tree/master/2411-spiral-matrix-iv) |
| [2465-shifting-letters-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2465-shifting-letters-ii) |
| [2472-build-a-matrix-with-conditions](https://github.com/sahilsrivastava25/DSA/tree/master/2472-build-a-matrix-with-conditions) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/sahilsrivastava25/DSA/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/sahilsrivastava25/DSA/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [2502-sort-the-people](https://github.com/sahilsrivastava25/DSA/tree/master/2502-sort-the-people) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/sahilsrivastava25/DSA/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/sahilsrivastava25/DSA/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/sahilsrivastava25/DSA/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |
| [2554-minimum-total-distance-traveled](https://github.com/sahilsrivastava25/DSA/tree/master/2554-minimum-total-distance-traveled) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/sahilsrivastava25/DSA/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2586-longest-square-streak-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2586-longest-square-streak-in-an-array) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/sahilsrivastava25/DSA/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2634-minimum-common-value](https://github.com/sahilsrivastava25/DSA/tree/master/2634-minimum-common-value) |
| [2691-count-vowel-strings-in-ranges](https://github.com/sahilsrivastava25/DSA/tree/master/2691-count-vowel-strings-in-ranges) |
| [2692-take-gifts-from-the-richest-pile](https://github.com/sahilsrivastava25/DSA/tree/master/2692-take-gifts-from-the-richest-pile) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/sahilsrivastava25/DSA/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2699-count-the-number-of-fair-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2699-count-the-number-of-fair-pairs) |
| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |
| [2716-prime-subtraction-operation](https://github.com/sahilsrivastava25/DSA/tree/master/2716-prime-subtraction-operation) |
| [2727-number-of-senior-citizens](https://github.com/sahilsrivastava25/DSA/tree/master/2727-number-of-senior-citizens) |
| [2755-extra-characters-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2755-extra-characters-in-a-string) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2794-maximum-number-of-moves-in-a-grid) |
| [2846-robot-collisions](https://github.com/sahilsrivastava25/DSA/tree/master/2846-robot-collisions) |
| [2868-continuous-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/2868-continuous-subarrays) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/sahilsrivastava25/DSA/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/sahilsrivastava25/DSA/tree/master/3235-minimum-cost-to-convert-string-i) |
| [3242-count-elements-with-maximum-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/3242-count-elements-with-maximum-frequency) |
| [3291-find-if-array-can-be-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/3291-find-if-array-can-be-sorted) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/sahilsrivastava25/DSA/tree/master/3309-count-prefix-and-suffix-pairs-i) |
| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/sahilsrivastava25/DSA/tree/master/3329-find-the-length-of-the-longest-common-prefix) |
| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |
| [3427-special-array-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3427-special-array-ii) |
| [3429-special-array-i](https://github.com/sahilsrivastava25/DSA/tree/master/3429-special-array-i) |
| [3469-maximum-height-of-a-triangle](https://github.com/sahilsrivastava25/DSA/tree/master/3469-maximum-height-of-a-triangle) |
| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/sahilsrivastava25/DSA/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/sahilsrivastava25/DSA/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
| [3517-shortest-distance-after-road-addition-queries-i](https://github.com/sahilsrivastava25/DSA/tree/master/3517-shortest-distance-after-road-addition-queries-i) |
| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/sahilsrivastava25/DSA/tree/master/3522-find-the-power-of-k-size-subarrays-i) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/sahilsrivastava25/DSA/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Dynamic Programming
| |
| ------- |
| [0053-maximum-subarray](https://github.com/sahilsrivastava25/DSA/tree/master/0053-maximum-subarray) |
| [0118-pascals-triangle](https://github.com/sahilsrivastava25/DSA/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/sahilsrivastava25/DSA/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0241-different-ways-to-add-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0241-different-ways-to-add-parentheses) |
| [0264-ugly-number-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0264-ugly-number-ii) |
| [0494-target-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0494-target-sum) |
| [0650-2-keys-keyboard](https://github.com/sahilsrivastava25/DSA/tree/master/0650-2-keys-keyboard) |
| [0664-strange-printer](https://github.com/sahilsrivastava25/DSA/tree/master/0664-strange-printer) |
| [0863-sum-of-distances-in-tree](https://github.com/sahilsrivastava25/DSA/tree/master/0863-sum-of-distances-in-tree) |
| [1025-minimum-cost-for-tickets](https://github.com/sahilsrivastava25/DSA/tree/master/1025-minimum-cost-for-tickets) |
| [1063-best-sightseeing-pair](https://github.com/sahilsrivastava25/DSA/tree/master/1063-best-sightseeing-pair) |
| [1196-filling-bookcase-shelves](https://github.com/sahilsrivastava25/DSA/tree/master/1196-filling-bookcase-shelves) |
| [1240-stone-game-ii](https://github.com/sahilsrivastava25/DSA/tree/master/1240-stone-game-ii) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/sahilsrivastava25/DSA/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/sahilsrivastava25/DSA/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [1511-count-number-of-teams](https://github.com/sahilsrivastava25/DSA/tree/master/1511-count-number-of-teams) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/sahilsrivastava25/DSA/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |
| [2067-maximum-number-of-points-with-cost](https://github.com/sahilsrivastava25/DSA/tree/master/2067-maximum-number-of-points-with-cost) |
| [2164-two-best-non-overlapping-events](https://github.com/sahilsrivastava25/DSA/tree/master/2164-two-best-non-overlapping-events) |
| [2554-minimum-total-distance-traveled](https://github.com/sahilsrivastava25/DSA/tree/master/2554-minimum-total-distance-traveled) |
| [2562-count-ways-to-build-good-strings](https://github.com/sahilsrivastava25/DSA/tree/master/2562-count-ways-to-build-good-strings) |
| [2586-longest-square-streak-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2586-longest-square-streak-in-an-array) |
| [2755-extra-characters-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2755-extra-characters-in-a-string) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2794-maximum-number-of-moves-in-a-grid) |
| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/sahilsrivastava25/DSA/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |
## Two Pointers
| |
| ------- |
| [0015-3sum](https://github.com/sahilsrivastava25/DSA/tree/master/0015-3sum) |
| [0018-4sum](https://github.com/sahilsrivastava25/DSA/tree/master/0018-4sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/sahilsrivastava25/DSA/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0031-next-permutation](https://github.com/sahilsrivastava25/DSA/tree/master/0031-next-permutation) |
| [0061-rotate-list](https://github.com/sahilsrivastava25/DSA/tree/master/0061-rotate-list) |
| [0075-sort-colors](https://github.com/sahilsrivastava25/DSA/tree/master/0075-sort-colors) |
| [0141-linked-list-cycle](https://github.com/sahilsrivastava25/DSA/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0142-linked-list-cycle-ii) |
| [0148-sort-list](https://github.com/sahilsrivastava25/DSA/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0160-intersection-of-two-linked-lists) |
| [0189-rotate-array](https://github.com/sahilsrivastava25/DSA/tree/master/0189-rotate-array) |
| [0234-palindrome-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0234-palindrome-linked-list) |
| [0283-move-zeroes](https://github.com/sahilsrivastava25/DSA/tree/master/0283-move-zeroes) |
| [0344-reverse-string](https://github.com/sahilsrivastava25/DSA/tree/master/0344-reverse-string) |
| [0349-intersection-of-two-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0350-intersection-of-two-arrays-ii) |
| [0532-k-diff-pairs-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0532-k-diff-pairs-in-an-array) |
| [0567-permutation-in-string](https://github.com/sahilsrivastava25/DSA/tree/master/0567-permutation-in-string) |
| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/sahilsrivastava25/DSA/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0802-k-th-smallest-prime-fraction](https://github.com/sahilsrivastava25/DSA/tree/master/0802-k-th-smallest-prime-fraction) |
| [0908-middle-of-the-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0908-middle-of-the-linked-list) |
| [0985-bag-of-tokens](https://github.com/sahilsrivastava25/DSA/tree/master/0985-bag-of-tokens) |
| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/sahilsrivastava25/DSA/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |
| [1850-minimum-length-of-string-after-deleting-similar-ends](https://github.com/sahilsrivastava25/DSA/tree/master/1850-minimum-length-of-string-after-deleting-similar-ends) |
| [1923-sentence-similarity-iii](https://github.com/sahilsrivastava25/DSA/tree/master/1923-sentence-similarity-iii) |
| [1972-rotating-the-box](https://github.com/sahilsrivastava25/DSA/tree/master/1972-rotating-the-box) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
| [2232-adding-spaces-to-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2232-adding-spaces-to-a-string) |
| [2271-rearrange-array-elements-by-sign](https://github.com/sahilsrivastava25/DSA/tree/master/2271-rearrange-array-elements-by-sign) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/sahilsrivastava25/DSA/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/sahilsrivastava25/DSA/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2634-minimum-common-value](https://github.com/sahilsrivastava25/DSA/tree/master/2634-minimum-common-value) |
| [2699-count-the-number-of-fair-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2699-count-the-number-of-fair-pairs) |
| [3195-separate-black-and-white-balls](https://github.com/sahilsrivastava25/DSA/tree/master/3195-separate-black-and-white-balls) |
## Simulation
| |
| ------- |
| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |
| [0412-fizz-buzz](https://github.com/sahilsrivastava25/DSA/tree/master/0412-fizz-buzz) |
| [0592-fraction-addition-and-subtraction](https://github.com/sahilsrivastava25/DSA/tree/master/0592-fraction-addition-and-subtraction) |
| [0906-walking-robot-simulation](https://github.com/sahilsrivastava25/DSA/tree/master/0906-walking-robot-simulation) |
| [0921-spiral-matrix-iii](https://github.com/sahilsrivastava25/DSA/tree/master/0921-spiral-matrix-iii) |
| [1642-water-bottles](https://github.com/sahilsrivastava25/DSA/tree/master/1642-water-bottles) |
| [1667-find-kth-bit-in-nth-binary-string](https://github.com/sahilsrivastava25/DSA/tree/master/1667-find-kth-bit-in-nth-binary-string) |
| [1803-average-waiting-time](https://github.com/sahilsrivastava25/DSA/tree/master/1803-average-waiting-time) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/sahilsrivastava25/DSA/tree/master/1951-find-the-winner-of-the-circular-game) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/sahilsrivastava25/DSA/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2076-sum-of-digits-of-string-after-convert](https://github.com/sahilsrivastava25/DSA/tree/master/2076-sum-of-digits-of-string-after-convert) |
| [2132-convert-1d-array-into-2d-array](https://github.com/sahilsrivastava25/DSA/tree/master/2132-convert-1d-array-into-2d-array) |
| [2155-find-missing-observations](https://github.com/sahilsrivastava25/DSA/tree/master/2155-find-missing-observations) |
| [2232-adding-spaces-to-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2232-adding-spaces-to-a-string) |
| [2271-rearrange-array-elements-by-sign](https://github.com/sahilsrivastava25/DSA/tree/master/2271-rearrange-array-elements-by-sign) |
| [2299-merge-nodes-in-between-zeros](https://github.com/sahilsrivastava25/DSA/tree/master/2299-merge-nodes-in-between-zeros) |
| [2343-count-unguarded-cells-in-the-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2343-count-unguarded-cells-in-the-grid) |
| [2411-spiral-matrix-iv](https://github.com/sahilsrivastava25/DSA/tree/master/2411-spiral-matrix-iv) |
| [2645-pass-the-pillow](https://github.com/sahilsrivastava25/DSA/tree/master/2645-pass-the-pillow) |
| [2692-take-gifts-from-the-richest-pile](https://github.com/sahilsrivastava25/DSA/tree/master/2692-take-gifts-from-the-richest-pile) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/sahilsrivastava25/DSA/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2800-minimum-string-length-after-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/2800-minimum-string-length-after-removing-substrings) |
| [2846-robot-collisions](https://github.com/sahilsrivastava25/DSA/tree/master/2846-robot-collisions) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/sahilsrivastava25/DSA/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0001-two-sum) |
| [0073-set-matrix-zeroes](https://github.com/sahilsrivastava25/DSA/tree/master/0073-set-matrix-zeroes) |
| [0128-longest-consecutive-sequence](https://github.com/sahilsrivastava25/DSA/tree/master/0128-longest-consecutive-sequence) |
| [0138-copy-list-with-random-pointer](https://github.com/sahilsrivastava25/DSA/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/sahilsrivastava25/DSA/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0142-linked-list-cycle-ii) |
| [0160-intersection-of-two-linked-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0160-intersection-of-two-linked-lists) |
| [0169-majority-element](https://github.com/sahilsrivastava25/DSA/tree/master/0169-majority-element) |
| [0229-majority-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0229-majority-element-ii) |
| [0264-ugly-number-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0264-ugly-number-ii) |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
| [0349-intersection-of-two-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0350-intersection-of-two-arrays-ii) |
| [0432-all-oone-data-structure](https://github.com/sahilsrivastava25/DSA/tree/master/0432-all-oone-data-structure) |
| [0496-next-greater-element-i](https://github.com/sahilsrivastava25/DSA/tree/master/0496-next-greater-element-i) |
| [0532-k-diff-pairs-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0532-k-diff-pairs-in-an-array) |
| [0560-subarray-sum-equals-k](https://github.com/sahilsrivastava25/DSA/tree/master/0560-subarray-sum-equals-k) |
| [0567-permutation-in-string](https://github.com/sahilsrivastava25/DSA/tree/master/0567-permutation-in-string) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0726-number-of-atoms](https://github.com/sahilsrivastava25/DSA/tree/master/0726-number-of-atoms) |
| [0807-custom-sort-string](https://github.com/sahilsrivastava25/DSA/tree/master/0807-custom-sort-string) |
| [0870-magic-squares-in-grid](https://github.com/sahilsrivastava25/DSA/tree/master/0870-magic-squares-in-grid) |
| [0906-walking-robot-simulation](https://github.com/sahilsrivastava25/DSA/tree/master/0906-walking-robot-simulation) |
| [0920-uncommon-words-from-two-sentences](https://github.com/sahilsrivastava25/DSA/tree/master/0920-uncommon-words-from-two-sentences) |
| [0966-binary-subarrays-with-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0966-binary-subarrays-with-sum) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/sahilsrivastava25/DSA/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [0999-regions-cut-by-slashes](https://github.com/sahilsrivastava25/DSA/tree/master/0999-regions-cut-by-slashes) |
| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/sahilsrivastava25/DSA/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |
| [1207-delete-nodes-and-return-forest](https://github.com/sahilsrivastava25/DSA/tree/master/1207-delete-nodes-and-return-forest) |
| [1256-rank-transform-of-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/1256-rank-transform-of-an-array) |
| [1267-remove-zero-sum-consecutive-nodes-from-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/1267-remove-zero-sum-consecutive-nodes-from-linked-list) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/sahilsrivastava25/DSA/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/sahilsrivastava25/DSA/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1694-make-sum-divisible-by-p](https://github.com/sahilsrivastava25/DSA/tree/master/1694-make-sum-divisible-by-p) |
| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |
| [1741-sort-array-by-increasing-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/1741-sort-array-by-increasing-frequency) |
| [1786-count-the-number-of-consistent-strings](https://github.com/sahilsrivastava25/DSA/tree/master/1786-count-the-number-of-consistent-strings) |
| [1904-second-largest-digit-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/1904-second-largest-digit-in-a-string) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/sahilsrivastava25/DSA/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2163-kth-distinct-string-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2163-kth-distinct-string-in-an-array) |
| [2300-construct-string-with-repeat-limit](https://github.com/sahilsrivastava25/DSA/tree/master/2300-construct-string-with-repeat-limit) |
| [2306-create-binary-tree-from-descriptions](https://github.com/sahilsrivastava25/DSA/tree/master/2306-create-binary-tree-from-descriptions) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/sahilsrivastava25/DSA/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2502-sort-the-people](https://github.com/sahilsrivastava25/DSA/tree/master/2502-sort-the-people) |
| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/sahilsrivastava25/DSA/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/sahilsrivastava25/DSA/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2586-longest-square-streak-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2586-longest-square-streak-in-an-array) |
| [2599-take-k-of-each-character-from-left-and-right](https://github.com/sahilsrivastava25/DSA/tree/master/2599-take-k-of-each-character-from-left-and-right) |
| [2634-minimum-common-value](https://github.com/sahilsrivastava25/DSA/tree/master/2634-minimum-common-value) |
| [2677-cousins-in-binary-tree-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2677-cousins-in-binary-tree-ii) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/sahilsrivastava25/DSA/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2755-extra-characters-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2755-extra-characters-in-a-string) |
| [3242-count-elements-with-maximum-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/3242-count-elements-with-maximum-frequency) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/sahilsrivastava25/DSA/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/sahilsrivastava25/DSA/tree/master/3329-find-the-length-of-the-longest-common-prefix) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/sahilsrivastava25/DSA/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/sahilsrivastava25/DSA/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |
## Binary Search
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0004-median-of-two-sorted-arrays) |
| [0033-search-in-rotated-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/sahilsrivastava25/DSA/tree/master/0035-search-insert-position) |
| [0074-search-a-2d-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0074-search-a-2d-matrix) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/sahilsrivastava25/DSA/tree/master/0162-find-peak-element) |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
| [0349-intersection-of-two-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0350-intersection-of-two-arrays-ii) |
| [0532-k-diff-pairs-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0532-k-diff-pairs-in-an-array) |
| [0540-single-element-in-a-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0540-single-element-in-a-sorted-array) |
| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/sahilsrivastava25/DSA/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0729-my-calendar-i](https://github.com/sahilsrivastava25/DSA/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0731-my-calendar-ii) |
| [0792-binary-search](https://github.com/sahilsrivastava25/DSA/tree/master/0792-binary-search) |
| [0802-k-th-smallest-prime-fraction](https://github.com/sahilsrivastava25/DSA/tree/master/0802-k-th-smallest-prime-fraction) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/sahilsrivastava25/DSA/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |
| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/sahilsrivastava25/DSA/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |
| [1886-minimum-limit-of-balls-in-a-bag](https://github.com/sahilsrivastava25/DSA/tree/master/1886-minimum-limit-of-balls-in-a-bag) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/sahilsrivastava25/DSA/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2164-two-best-non-overlapping-events](https://github.com/sahilsrivastava25/DSA/tree/master/2164-two-best-non-overlapping-events) |
| [2179-most-beautiful-item-for-each-query](https://github.com/sahilsrivastava25/DSA/tree/master/2179-most-beautiful-item-for-each-query) |
| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/sahilsrivastava25/DSA/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |
| [2586-longest-square-streak-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2586-longest-square-streak-in-an-array) |
| [2634-minimum-common-value](https://github.com/sahilsrivastava25/DSA/tree/master/2634-minimum-common-value) |
| [2699-count-the-number-of-fair-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2699-count-the-number-of-fair-pairs) |
| [2716-prime-subtraction-operation](https://github.com/sahilsrivastava25/DSA/tree/master/2716-prime-subtraction-operation) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/sahilsrivastava25/DSA/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/sahilsrivastava25/DSA/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3427-special-array-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3427-special-array-ii) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/sahilsrivastava25/DSA/tree/master/0015-3sum) |
| [0018-4sum](https://github.com/sahilsrivastava25/DSA/tree/master/0018-4sum) |
| [0075-sort-colors](https://github.com/sahilsrivastava25/DSA/tree/master/0075-sort-colors) |
| [0148-sort-list](https://github.com/sahilsrivastava25/DSA/tree/master/0148-sort-list) |
| [0169-majority-element](https://github.com/sahilsrivastava25/DSA/tree/master/0169-majority-element) |
| [0179-largest-number](https://github.com/sahilsrivastava25/DSA/tree/master/0179-largest-number) |
| [0229-majority-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0229-majority-element-ii) |
| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |
| [0349-intersection-of-two-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0350-intersection-of-two-arrays-ii) |
| [0532-k-diff-pairs-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0532-k-diff-pairs-in-an-array) |
| [0539-minimum-time-difference](https://github.com/sahilsrivastava25/DSA/tree/master/0539-minimum-time-difference) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/sahilsrivastava25/DSA/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0726-number-of-atoms](https://github.com/sahilsrivastava25/DSA/tree/master/0726-number-of-atoms) |
| [0780-max-chunks-to-make-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/0780-max-chunks-to-make-sorted) |
| [0802-k-th-smallest-prime-fraction](https://github.com/sahilsrivastava25/DSA/tree/master/0802-k-th-smallest-prime-fraction) |
| [0807-custom-sort-string](https://github.com/sahilsrivastava25/DSA/tree/master/0807-custom-sort-string) |
| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |
| [0985-bag-of-tokens](https://github.com/sahilsrivastava25/DSA/tree/master/0985-bag-of-tokens) |
| [1256-rank-transform-of-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/1256-rank-transform-of-an-array) |
| [1333-sort-the-jumbled-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/1333-sort-the-jumbled-numbers) |
| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/sahilsrivastava25/DSA/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
| [1741-sort-array-by-increasing-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/1741-sort-array-by-increasing-frequency) |
| [2164-two-best-non-overlapping-events](https://github.com/sahilsrivastava25/DSA/tree/master/2164-two-best-non-overlapping-events) |
| [2179-most-beautiful-item-for-each-query](https://github.com/sahilsrivastava25/DSA/tree/master/2179-most-beautiful-item-for-each-query) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/sahilsrivastava25/DSA/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2502-sort-the-people](https://github.com/sahilsrivastava25/DSA/tree/master/2502-sort-the-people) |
| [2554-minimum-total-distance-traveled](https://github.com/sahilsrivastava25/DSA/tree/master/2554-minimum-total-distance-traveled) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/sahilsrivastava25/DSA/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2586-longest-square-streak-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2586-longest-square-streak-in-an-array) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/sahilsrivastava25/DSA/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2699-count-the-number-of-fair-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2699-count-the-number-of-fair-pairs) |
| [2846-robot-collisions](https://github.com/sahilsrivastava25/DSA/tree/master/2846-robot-collisions) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3291-find-if-array-can-be-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/3291-find-if-array-can-be-sorted) |
## Greedy
| |
| ------- |
| [0179-largest-number](https://github.com/sahilsrivastava25/DSA/tree/master/0179-largest-number) |
| [0624-maximum-distance-in-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0624-maximum-distance-in-arrays) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0670-maximum-swap](https://github.com/sahilsrivastava25/DSA/tree/master/0670-maximum-swap) |
| [0780-max-chunks-to-make-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/0780-max-chunks-to-make-sorted) |
| [0890-lemonade-change](https://github.com/sahilsrivastava25/DSA/tree/master/0890-lemonade-change) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/sahilsrivastava25/DSA/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [0985-bag-of-tokens](https://github.com/sahilsrivastava25/DSA/tree/master/0985-bag-of-tokens) |
| [1304-longest-happy-string](https://github.com/sahilsrivastava25/DSA/tree/master/1304-longest-happy-string) |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/sahilsrivastava25/DSA/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |
| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/sahilsrivastava25/DSA/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |
| [1818-maximum-score-from-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/1818-maximum-score-from-removing-substrings) |
| [1917-maximum-average-pass-ratio](https://github.com/sahilsrivastava25/DSA/tree/master/1917-maximum-average-pass-ratio) |
| [2089-maximum-matrix-sum](https://github.com/sahilsrivastava25/DSA/tree/master/2089-maximum-matrix-sum) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2300-construct-string-with-repeat-limit](https://github.com/sahilsrivastava25/DSA/tree/master/2300-construct-string-with-repeat-limit) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/sahilsrivastava25/DSA/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/sahilsrivastava25/DSA/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2716-prime-subtraction-operation](https://github.com/sahilsrivastava25/DSA/tree/master/2716-prime-subtraction-operation) |
| [3195-separate-black-and-white-balls](https://github.com/sahilsrivastava25/DSA/tree/master/3195-separate-black-and-white-balls) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/sahilsrivastava25/DSA/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0021-merge-two-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0021-merge-two-sorted-lists) |
| [0023-merge-k-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0023-merge-k-sorted-lists) |
| [0025-reverse-nodes-in-k-group](https://github.com/sahilsrivastava25/DSA/tree/master/0025-reverse-nodes-in-k-group) |
| [0061-rotate-list](https://github.com/sahilsrivastava25/DSA/tree/master/0061-rotate-list) |
| [0138-copy-list-with-random-pointer](https://github.com/sahilsrivastava25/DSA/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/sahilsrivastava25/DSA/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0142-linked-list-cycle-ii) |
| [0148-sort-list](https://github.com/sahilsrivastava25/DSA/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0160-intersection-of-two-linked-lists) |
| [0206-reverse-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0234-palindrome-linked-list) |
| [0237-delete-node-in-a-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0237-delete-node-in-a-linked-list) |
| [0328-odd-even-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0328-odd-even-linked-list) |
| [0432-all-oone-data-structure](https://github.com/sahilsrivastava25/DSA/tree/master/0432-all-oone-data-structure) |
| [0725-split-linked-list-in-parts](https://github.com/sahilsrivastava25/DSA/tree/master/0725-split-linked-list-in-parts) |
| [0859-design-circular-deque](https://github.com/sahilsrivastava25/DSA/tree/master/0859-design-circular-deque) |
| [0908-middle-of-the-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0908-middle-of-the-linked-list) |
| [1267-remove-zero-sum-consecutive-nodes-from-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/1267-remove-zero-sum-consecutive-nodes-from-linked-list) |
| [1484-linked-list-in-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/1484-linked-list-in-binary-tree) |
| [1582-design-browser-history](https://github.com/sahilsrivastava25/DSA/tree/master/1582-design-browser-history) |
| [2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points](https://github.com/sahilsrivastava25/DSA/tree/master/2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
| [2299-merge-nodes-in-between-zeros](https://github.com/sahilsrivastava25/DSA/tree/master/2299-merge-nodes-in-between-zeros) |
| [2411-spiral-matrix-iv](https://github.com/sahilsrivastava25/DSA/tree/master/2411-spiral-matrix-iv) |
| [2573-remove-nodes-from-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2573-remove-nodes-from-linked-list) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/sahilsrivastava25/DSA/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
## Matrix
| |
| ------- |
| [0048-rotate-image](https://github.com/sahilsrivastava25/DSA/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |
| [0073-set-matrix-zeroes](https://github.com/sahilsrivastava25/DSA/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0074-search-a-2d-matrix) |
| [0787-sliding-puzzle](https://github.com/sahilsrivastava25/DSA/tree/master/0787-sliding-puzzle) |
| [0870-magic-squares-in-grid](https://github.com/sahilsrivastava25/DSA/tree/master/0870-magic-squares-in-grid) |
| [0921-spiral-matrix-iii](https://github.com/sahilsrivastava25/DSA/tree/master/0921-spiral-matrix-iii) |
| [0999-regions-cut-by-slashes](https://github.com/sahilsrivastava25/DSA/tree/master/0999-regions-cut-by-slashes) |
| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/sahilsrivastava25/DSA/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/sahilsrivastava25/DSA/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1496-lucky-numbers-in-a-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/1496-lucky-numbers-in-a-matrix) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/sahilsrivastava25/DSA/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |
| [1972-rotating-the-box](https://github.com/sahilsrivastava25/DSA/tree/master/1972-rotating-the-box) |
| [2035-count-sub-islands](https://github.com/sahilsrivastava25/DSA/tree/master/2035-count-sub-islands) |
| [2089-maximum-matrix-sum](https://github.com/sahilsrivastava25/DSA/tree/master/2089-maximum-matrix-sum) |
| [2132-convert-1d-array-into-2d-array](https://github.com/sahilsrivastava25/DSA/tree/master/2132-convert-1d-array-into-2d-array) |
| [2343-count-unguarded-cells-in-the-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2343-count-unguarded-cells-in-the-grid) |
| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/sahilsrivastava25/DSA/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |
| [2411-spiral-matrix-iv](https://github.com/sahilsrivastava25/DSA/tree/master/2411-spiral-matrix-iv) |
| [2472-build-a-matrix-with-conditions](https://github.com/sahilsrivastava25/DSA/tree/master/2472-build-a-matrix-with-conditions) |
| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2794-maximum-number-of-moves-in-a-grid) |
## Enumeration
| |
| ------- |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/sahilsrivastava25/DSA/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [3469-maximum-height-of-a-triangle](https://github.com/sahilsrivastava25/DSA/tree/master/3469-maximum-height-of-a-triangle) |
| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |
## Queue
| |
| ------- |
| [0225-implement-stack-using-queues](https://github.com/sahilsrivastava25/DSA/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/sahilsrivastava25/DSA/tree/master/0232-implement-queue-using-stacks) |
| [0859-design-circular-deque](https://github.com/sahilsrivastava25/DSA/tree/master/0859-design-circular-deque) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/sahilsrivastava25/DSA/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/sahilsrivastava25/DSA/tree/master/1951-find-the-winner-of-the-circular-game) |
| [2868-continuous-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/2868-continuous-subarrays) |
## String
| |
| ------- |
| [0020-valid-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0020-valid-parentheses) |
| [0179-largest-number](https://github.com/sahilsrivastava25/DSA/tree/master/0179-largest-number) |
| [0214-shortest-palindrome](https://github.com/sahilsrivastava25/DSA/tree/master/0214-shortest-palindrome) |
| [0241-different-ways-to-add-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0241-different-ways-to-add-parentheses) |
| [0273-integer-to-english-words](https://github.com/sahilsrivastava25/DSA/tree/master/0273-integer-to-english-words) |
| [0344-reverse-string](https://github.com/sahilsrivastava25/DSA/tree/master/0344-reverse-string) |
| [0412-fizz-buzz](https://github.com/sahilsrivastava25/DSA/tree/master/0412-fizz-buzz) |
| [0539-minimum-time-difference](https://github.com/sahilsrivastava25/DSA/tree/master/0539-minimum-time-difference) |
| [0564-find-the-closest-palindrome](https://github.com/sahilsrivastava25/DSA/tree/master/0564-find-the-closest-palindrome) |
| [0567-permutation-in-string](https://github.com/sahilsrivastava25/DSA/tree/master/0567-permutation-in-string) |
| [0592-fraction-addition-and-subtraction](https://github.com/sahilsrivastava25/DSA/tree/master/0592-fraction-addition-and-subtraction) |
| [0664-strange-printer](https://github.com/sahilsrivastava25/DSA/tree/master/0664-strange-printer) |
| [0726-number-of-atoms](https://github.com/sahilsrivastava25/DSA/tree/master/0726-number-of-atoms) |
| [0807-custom-sort-string](https://github.com/sahilsrivastava25/DSA/tree/master/0807-custom-sort-string) |
| [0812-rotate-string](https://github.com/sahilsrivastava25/DSA/tree/master/0812-rotate-string) |
| [0920-uncommon-words-from-two-sentences](https://github.com/sahilsrivastava25/DSA/tree/master/0920-uncommon-words-from-two-sentences) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/sahilsrivastava25/DSA/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1197-parsing-a-boolean-expression](https://github.com/sahilsrivastava25/DSA/tree/master/1197-parsing-a-boolean-expression) |
| [1298-reverse-substrings-between-each-pair-of-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/1298-reverse-substrings-between-each-pair-of-parentheses) |
| [1302-delete-characters-to-make-fancy-string](https://github.com/sahilsrivastava25/DSA/tree/master/1302-delete-characters-to-make-fancy-string) |
| [1304-longest-happy-string](https://github.com/sahilsrivastava25/DSA/tree/master/1304-longest-happy-string) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/sahilsrivastava25/DSA/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/sahilsrivastava25/DSA/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1524-string-matching-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/1524-string-matching-in-an-array) |
| [1537-maximum-score-after-splitting-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/1537-maximum-score-after-splitting-a-string) |
| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/sahilsrivastava25/DSA/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
| [1667-find-kth-bit-in-nth-binary-string](https://github.com/sahilsrivastava25/DSA/tree/master/1667-find-kth-bit-in-nth-binary-string) |
| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |
| [1720-crawler-log-folder](https://github.com/sahilsrivastava25/DSA/tree/master/1720-crawler-log-folder) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [1786-count-the-number-of-consistent-strings](https://github.com/sahilsrivastava25/DSA/tree/master/1786-count-the-number-of-consistent-strings) |
| [1818-maximum-score-from-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/1818-maximum-score-from-removing-substrings) |
| [1850-minimum-length-of-string-after-deleting-similar-ends](https://github.com/sahilsrivastava25/DSA/tree/master/1850-minimum-length-of-string-after-deleting-similar-ends) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/sahilsrivastava25/DSA/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [1904-second-largest-digit-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/1904-second-largest-digit-in-a-string) |
| [1923-sentence-similarity-iii](https://github.com/sahilsrivastava25/DSA/tree/master/1923-sentence-similarity-iii) |
| [2076-sum-of-digits-of-string-after-convert](https://github.com/sahilsrivastava25/DSA/tree/master/2076-sum-of-digits-of-string-after-convert) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2163-kth-distinct-string-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2163-kth-distinct-string-in-an-array) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/sahilsrivastava25/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2232-adding-spaces-to-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2232-adding-spaces-to-a-string) |
| [2300-construct-string-with-repeat-limit](https://github.com/sahilsrivastava25/DSA/tree/master/2300-construct-string-with-repeat-limit) |
| [2465-shifting-letters-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2465-shifting-letters-ii) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/sahilsrivastava25/DSA/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [2502-sort-the-people](https://github.com/sahilsrivastava25/DSA/tree/master/2502-sort-the-people) |
| [2580-circular-sentence](https://github.com/sahilsrivastava25/DSA/tree/master/2580-circular-sentence) |
| [2599-take-k-of-each-character-from-left-and-right](https://github.com/sahilsrivastava25/DSA/tree/master/2599-take-k-of-each-character-from-left-and-right) |
| [2691-count-vowel-strings-in-ranges](https://github.com/sahilsrivastava25/DSA/tree/master/2691-count-vowel-strings-in-ranges) |
| [2727-number-of-senior-citizens](https://github.com/sahilsrivastava25/DSA/tree/master/2727-number-of-senior-citizens) |
| [2755-extra-characters-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2755-extra-characters-in-a-string) |
| [2800-minimum-string-length-after-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/2800-minimum-string-length-after-removing-substrings) |
| [3174-minimum-number-of-changes-to-make-binary-string-beautiful](https://github.com/sahilsrivastava25/DSA/tree/master/3174-minimum-number-of-changes-to-make-binary-string-beautiful) |
| [3195-separate-black-and-white-balls](https://github.com/sahilsrivastava25/DSA/tree/master/3195-separate-black-and-white-balls) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/sahilsrivastava25/DSA/tree/master/3235-minimum-cost-to-convert-string-i) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/sahilsrivastava25/DSA/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/sahilsrivastava25/DSA/tree/master/3309-count-prefix-and-suffix-pairs-i) |
| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/sahilsrivastava25/DSA/tree/master/3329-find-the-length-of-the-longest-common-prefix) |
| [3451-string-compression-iii](https://github.com/sahilsrivastava25/DSA/tree/master/3451-string-compression-iii) |
| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/sahilsrivastava25/DSA/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |
| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0020-valid-parentheses) |
| [0145-binary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0145-binary-tree-postorder-traversal) |
| [0155-min-stack](https://github.com/sahilsrivastava25/DSA/tree/master/0155-min-stack) |
| [0225-implement-stack-using-queues](https://github.com/sahilsrivastava25/DSA/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/sahilsrivastava25/DSA/tree/master/0232-implement-queue-using-stacks) |
| [0234-palindrome-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0234-palindrome-linked-list) |
| [0496-next-greater-element-i](https://github.com/sahilsrivastava25/DSA/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0503-next-greater-element-ii) |
| [0726-number-of-atoms](https://github.com/sahilsrivastava25/DSA/tree/master/0726-number-of-atoms) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0776-n-ary-tree-postorder-traversal) |
| [0780-max-chunks-to-make-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/0780-max-chunks-to-make-sorted) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/sahilsrivastava25/DSA/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1002-maximum-width-ramp](https://github.com/sahilsrivastava25/DSA/tree/master/1002-maximum-width-ramp) |
| [1197-parsing-a-boolean-expression](https://github.com/sahilsrivastava25/DSA/tree/master/1197-parsing-a-boolean-expression) |
| [1298-reverse-substrings-between-each-pair-of-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/1298-reverse-substrings-between-each-pair-of-parentheses) |
| [1497-design-a-stack-with-increment-operation](https://github.com/sahilsrivastava25/DSA/tree/master/1497-design-a-stack-with-increment-operation) |
| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/sahilsrivastava25/DSA/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |
| [1582-design-browser-history](https://github.com/sahilsrivastava25/DSA/tree/master/1582-design-browser-history) |
| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |
| [1720-crawler-log-folder](https://github.com/sahilsrivastava25/DSA/tree/master/1720-crawler-log-folder) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [1818-maximum-score-from-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/1818-maximum-score-from-removing-substrings) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2573-remove-nodes-from-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2573-remove-nodes-from-linked-list) |
| [2800-minimum-string-length-after-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/2800-minimum-string-length-after-removing-substrings) |
| [2846-robot-collisions](https://github.com/sahilsrivastava25/DSA/tree/master/2846-robot-collisions) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/sahilsrivastava25/DSA/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
## Sliding Window
| |
| ------- |
| [0567-permutation-in-string](https://github.com/sahilsrivastava25/DSA/tree/master/0567-permutation-in-string) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/sahilsrivastava25/DSA/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [0966-binary-subarrays-with-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0966-binary-subarrays-with-sum) |
| [1755-defuse-the-bomb](https://github.com/sahilsrivastava25/DSA/tree/master/1755-defuse-the-bomb) |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/sahilsrivastava25/DSA/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |
| [2599-take-k-of-each-character-from-left-and-right](https://github.com/sahilsrivastava25/DSA/tree/master/2599-take-k-of-each-character-from-left-and-right) |
| [2868-continuous-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/2868-continuous-subarrays) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/sahilsrivastava25/DSA/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |
| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/sahilsrivastava25/DSA/tree/master/3522-find-the-power-of-k-size-subarrays-i) |
| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |
## Heap (Priority Queue)
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0023-merge-k-sorted-lists) |
| [0264-ugly-number-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0264-ugly-number-ii) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |
| [0789-kth-largest-element-in-a-stream](https://github.com/sahilsrivastava25/DSA/tree/master/0789-kth-largest-element-in-a-stream) |
| [0802-k-th-smallest-prime-fraction](https://github.com/sahilsrivastava25/DSA/tree/master/0802-k-th-smallest-prime-fraction) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/sahilsrivastava25/DSA/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |
| [1304-longest-happy-string](https://github.com/sahilsrivastava25/DSA/tree/master/1304-longest-happy-string) |
| [1325-path-with-maximum-probability](https://github.com/sahilsrivastava25/DSA/tree/master/1325-path-with-maximum-probability) |
| [1917-maximum-average-pass-ratio](https://github.com/sahilsrivastava25/DSA/tree/master/1917-maximum-average-pass-ratio) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/sahilsrivastava25/DSA/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2164-two-best-non-overlapping-events](https://github.com/sahilsrivastava25/DSA/tree/master/2164-two-best-non-overlapping-events) |
| [2300-construct-string-with-repeat-limit](https://github.com/sahilsrivastava25/DSA/tree/master/2300-construct-string-with-repeat-limit) |
| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/sahilsrivastava25/DSA/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/sahilsrivastava25/DSA/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/sahilsrivastava25/DSA/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2692-take-gifts-from-the-richest-pile](https://github.com/sahilsrivastava25/DSA/tree/master/2692-take-gifts-from-the-richest-pile) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/sahilsrivastava25/DSA/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |
| [2803-modify-graph-edge-weights](https://github.com/sahilsrivastava25/DSA/tree/master/2803-modify-graph-edge-weights) |
| [2868-continuous-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/2868-continuous-subarrays) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/sahilsrivastava25/DSA/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/sahilsrivastava25/DSA/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Tree
| |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0145-binary-tree-postorder-traversal) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0776-n-ary-tree-postorder-traversal) |
| [0789-kth-largest-element-in-a-stream](https://github.com/sahilsrivastava25/DSA/tree/master/0789-kth-largest-element-in-a-stream) |
| [0863-sum-of-distances-in-tree](https://github.com/sahilsrivastava25/DSA/tree/master/0863-sum-of-distances-in-tree) |
| [0988-flip-equivalent-binary-trees](https://github.com/sahilsrivastava25/DSA/tree/master/0988-flip-equivalent-binary-trees) |
| [1207-delete-nodes-and-return-forest](https://github.com/sahilsrivastava25/DSA/tree/master/1207-delete-nodes-and-return-forest) |
| [1484-linked-list-in-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/1484-linked-list-in-binary-tree) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/sahilsrivastava25/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2306-create-binary-tree-from-descriptions](https://github.com/sahilsrivastava25/DSA/tree/master/2306-create-binary-tree-from-descriptions) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/sahilsrivastava25/DSA/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/sahilsrivastava25/DSA/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [2677-cousins-in-binary-tree-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2677-cousins-in-binary-tree-ii) |
| [3058-maximum-number-of-k-divisible-components](https://github.com/sahilsrivastava25/DSA/tree/master/3058-maximum-number-of-k-divisible-components) |
## Binary Tree
| |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0145-binary-tree-postorder-traversal) |
| [0789-kth-largest-element-in-a-stream](https://github.com/sahilsrivastava25/DSA/tree/master/0789-kth-largest-element-in-a-stream) |
| [0988-flip-equivalent-binary-trees](https://github.com/sahilsrivastava25/DSA/tree/master/0988-flip-equivalent-binary-trees) |
| [1207-delete-nodes-and-return-forest](https://github.com/sahilsrivastava25/DSA/tree/master/1207-delete-nodes-and-return-forest) |
| [1484-linked-list-in-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/1484-linked-list-in-binary-tree) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/sahilsrivastava25/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2306-create-binary-tree-from-descriptions](https://github.com/sahilsrivastava25/DSA/tree/master/2306-create-binary-tree-from-descriptions) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/sahilsrivastava25/DSA/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/sahilsrivastava25/DSA/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [2677-cousins-in-binary-tree-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2677-cousins-in-binary-tree-ii) |
## Depth-First Search
| |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0145-binary-tree-postorder-traversal) |
| [0386-lexicographical-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/0386-lexicographical-numbers) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0776-n-ary-tree-postorder-traversal) |
| [0863-sum-of-distances-in-tree](https://github.com/sahilsrivastava25/DSA/tree/master/0863-sum-of-distances-in-tree) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/sahilsrivastava25/DSA/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [0988-flip-equivalent-binary-trees](https://github.com/sahilsrivastava25/DSA/tree/master/0988-flip-equivalent-binary-trees) |
| [0999-regions-cut-by-slashes](https://github.com/sahilsrivastava25/DSA/tree/master/0999-regions-cut-by-slashes) |
| [1207-delete-nodes-and-return-forest](https://github.com/sahilsrivastava25/DSA/tree/master/1207-delete-nodes-and-return-forest) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/sahilsrivastava25/DSA/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1484-linked-list-in-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/1484-linked-list-in-binary-tree) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/sahilsrivastava25/DSA/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [2035-count-sub-islands](https://github.com/sahilsrivastava25/DSA/tree/master/2035-count-sub-islands) |
| [2201-valid-arrangement-of-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2201-valid-arrangement-of-pairs) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/sahilsrivastava25/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/sahilsrivastava25/DSA/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2677-cousins-in-binary-tree-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2677-cousins-in-binary-tree-ii) |
| [3058-maximum-number-of-k-divisible-components](https://github.com/sahilsrivastava25/DSA/tree/master/3058-maximum-number-of-k-divisible-components) |
## Graph
| |
| ------- |
| [0863-sum-of-distances-in-tree](https://github.com/sahilsrivastava25/DSA/tree/master/0863-sum-of-distances-in-tree) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/sahilsrivastava25/DSA/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1325-path-with-maximum-probability](https://github.com/sahilsrivastava25/DSA/tree/master/1325-path-with-maximum-probability) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/sahilsrivastava25/DSA/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [2171-second-minimum-time-to-reach-destination](https://github.com/sahilsrivastava25/DSA/tree/master/2171-second-minimum-time-to-reach-destination) |
| [2201-valid-arrangement-of-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2201-valid-arrangement-of-pairs) |
| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/sahilsrivastava25/DSA/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |
| [2472-build-a-matrix-with-conditions](https://github.com/sahilsrivastava25/DSA/tree/master/2472-build-a-matrix-with-conditions) |
| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |
| [2803-modify-graph-edge-weights](https://github.com/sahilsrivastava25/DSA/tree/master/2803-modify-graph-edge-weights) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/sahilsrivastava25/DSA/tree/master/3235-minimum-cost-to-convert-string-i) |
| [3517-shortest-distance-after-road-addition-queries-i](https://github.com/sahilsrivastava25/DSA/tree/master/3517-shortest-distance-after-road-addition-queries-i) |
## Topological Sort
| |
| ------- |
| [2472-build-a-matrix-with-conditions](https://github.com/sahilsrivastava25/DSA/tree/master/2472-build-a-matrix-with-conditions) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0004-median-of-two-sorted-arrays) |
| [0023-merge-k-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0023-merge-k-sorted-lists) |
| [0053-maximum-subarray](https://github.com/sahilsrivastava25/DSA/tree/master/0053-maximum-subarray) |
| [0148-sort-list](https://github.com/sahilsrivastava25/DSA/tree/master/0148-sort-list) |
| [0169-majority-element](https://github.com/sahilsrivastava25/DSA/tree/master/0169-majority-element) |
| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |
## Merge Sort
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0023-merge-k-sorted-lists) |
| [0148-sort-list](https://github.com/sahilsrivastava25/DSA/tree/master/0148-sort-list) |
| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |
## Bucket Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |
## Radix Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |
## Counting Sort
| |
| ------- |
| [0169-majority-element](https://github.com/sahilsrivastava25/DSA/tree/master/0169-majority-element) |
| [0229-majority-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0229-majority-element-ii) |
| [0920-uncommon-words-from-two-sentences](https://github.com/sahilsrivastava25/DSA/tree/master/0920-uncommon-words-from-two-sentences) |
| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/sahilsrivastava25/DSA/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1786-count-the-number-of-consistent-strings](https://github.com/sahilsrivastava25/DSA/tree/master/1786-count-the-number-of-consistent-strings) |
| [2163-kth-distinct-string-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2163-kth-distinct-string-in-an-array) |
| [2300-construct-string-with-repeat-limit](https://github.com/sahilsrivastava25/DSA/tree/master/2300-construct-string-with-repeat-limit) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/sahilsrivastava25/DSA/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/sahilsrivastava25/DSA/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [3242-count-elements-with-maximum-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/3242-count-elements-with-maximum-frequency) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/sahilsrivastava25/DSA/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/sahilsrivastava25/DSA/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |
## Shortest Path
| |
| ------- |
| [1325-path-with-maximum-probability](https://github.com/sahilsrivastava25/DSA/tree/master/1325-path-with-maximum-probability) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/sahilsrivastava25/DSA/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [2171-second-minimum-time-to-reach-destination](https://github.com/sahilsrivastava25/DSA/tree/master/2171-second-minimum-time-to-reach-destination) |
| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/sahilsrivastava25/DSA/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |
| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |
| [2803-modify-graph-edge-weights](https://github.com/sahilsrivastava25/DSA/tree/master/2803-modify-graph-edge-weights) |
| [3235-minimum-cost-to-convert-string-i](https://github.com/sahilsrivastava25/DSA/tree/master/3235-minimum-cost-to-convert-string-i) |
## Breadth-First Search
| |
| ------- |
| [0787-sliding-puzzle](https://github.com/sahilsrivastava25/DSA/tree/master/0787-sliding-puzzle) |
| [0999-regions-cut-by-slashes](https://github.com/sahilsrivastava25/DSA/tree/master/0999-regions-cut-by-slashes) |
| [1484-linked-list-in-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/1484-linked-list-in-binary-tree) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/sahilsrivastava25/DSA/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [2035-count-sub-islands](https://github.com/sahilsrivastava25/DSA/t