https://github.com/Abhik-Chakraborty/DSA
Implemented some commonly asked DSA question, mostly from Leetcode.
https://github.com/Abhik-Chakraborty/DSA
array-manipulations arrays bfs binary-search binary-search-tree bit bitmanipulation dfs dynamic-programming hashing heap interview-practice interview-preparation interview-questions queue recursion sorting-algorithms stack tree twopointers
Last synced: about 1 month ago
JSON representation
Implemented some commonly asked DSA question, mostly from Leetcode.
- Host: GitHub
- URL: https://github.com/Abhik-Chakraborty/DSA
- Owner: Abhik-Chakraborty
- Created: 2023-03-25T05:36:47.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2025-08-15T16:52:42.000Z (about 2 months ago)
- Last Synced: 2025-08-15T18:41:53.951Z (about 2 months ago)
- Topics: array-manipulations, arrays, bfs, binary-search, binary-search-tree, bit, bitmanipulation, dfs, dynamic-programming, hashing, heap, interview-practice, interview-preparation, interview-questions, queue, recursion, sorting-algorithms, stack, tree, twopointers
- Language: C++
- Homepage:
- Size: 1.15 MB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Topics
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0004-median-of-two-sorted-arrays) |
| [0011-container-with-most-water](https://github.com/Abhik-Chakraborty/coding-/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/Abhik-Chakraborty/coding-/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0018-4sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/0027-remove-element) |
| [0031-next-permutation](https://github.com/Abhik-Chakraborty/coding-/tree/master/0031-next-permutation) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/Abhik-Chakraborty/coding-/tree/master/0035-search-insert-position) |
| [0036-valid-sudoku](https://github.com/Abhik-Chakraborty/coding-/tree/master/0036-valid-sudoku) |
| [0039-combination-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0039-combination-sum) |
| [0041-first-missing-positive](https://github.com/Abhik-Chakraborty/coding-/tree/master/0041-first-missing-positive) |
| [0042-trapping-rain-water](https://github.com/Abhik-Chakraborty/coding-/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0045-jump-game-ii) |
| [0046-permutations](https://github.com/Abhik-Chakraborty/coding-/tree/master/0046-permutations) |
| [0048-rotate-image](https://github.com/Abhik-Chakraborty/coding-/tree/master/0048-rotate-image) |
| [0053-maximum-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0053-maximum-subarray) |
| [0054-spiral-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0054-spiral-matrix) |
| [0055-jump-game](https://github.com/Abhik-Chakraborty/coding-/tree/master/0055-jump-game) |
| [0056-merge-intervals](https://github.com/Abhik-Chakraborty/coding-/tree/master/0056-merge-intervals) |
| [0057-insert-interval](https://github.com/Abhik-Chakraborty/coding-/tree/master/0057-insert-interval) |
| [0066-plus-one](https://github.com/Abhik-Chakraborty/coding-/tree/master/0066-plus-one) |
| [0073-set-matrix-zeroes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0074-search-a-2d-matrix) |
| [0075-sort-colors](https://github.com/Abhik-Chakraborty/coding-/tree/master/0075-sort-colors) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0088-merge-sorted-array) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0118-pascals-triangle](https://github.com/Abhik-Chakraborty/coding-/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Abhik-Chakraborty/coding-/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |
| [0128-longest-consecutive-sequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0128-longest-consecutive-sequence) |
| [0130-surrounded-regions](https://github.com/Abhik-Chakraborty/coding-/tree/master/0130-surrounded-regions) |
| [0134-gas-station](https://github.com/Abhik-Chakraborty/coding-/tree/master/0134-gas-station) |
| [0136-single-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0136-single-number) |
| [0152-maximum-product-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0152-maximum-product-subarray) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Abhik-Chakraborty/coding-/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0189-rotate-array) |
| [0204-count-primes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0204-count-primes) |
| [0209-minimum-size-subarray-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0209-minimum-size-subarray-sum) |
| [0215-kth-largest-element-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0215-kth-largest-element-in-an-array) |
| [0217-contains-duplicate](https://github.com/Abhik-Chakraborty/coding-/tree/master/0217-contains-duplicate) |
| [0219-contains-duplicate-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0219-contains-duplicate-ii) |
| [0228-summary-ranges](https://github.com/Abhik-Chakraborty/coding-/tree/master/0228-summary-ranges) |
| [0229-majority-element-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0229-majority-element-ii) |
| [0238-product-of-array-except-self](https://github.com/Abhik-Chakraborty/coding-/tree/master/0238-product-of-array-except-self) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0274-h-index](https://github.com/Abhik-Chakraborty/coding-/tree/master/0274-h-index) |
| [0283-move-zeroes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0287-find-the-duplicate-number) |
| [0289-game-of-life](https://github.com/Abhik-Chakraborty/coding-/tree/master/0289-game-of-life) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0349-intersection-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0350-intersection-of-two-arrays-ii) |
| [0380-insert-delete-getrandom-o1](https://github.com/Abhik-Chakraborty/coding-/tree/master/0380-insert-delete-getrandom-o1) |
| [0414-third-maximum-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0414-third-maximum-number) |
| [0416-partition-equal-subset-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0416-partition-equal-subset-sum) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/Abhik-Chakraborty/coding-/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0455-assign-cookies](https://github.com/Abhik-Chakraborty/coding-/tree/master/0455-assign-cookies) |
| [0457-circular-array-loop](https://github.com/Abhik-Chakraborty/coding-/tree/master/0457-circular-array-loop) |
| [0485-max-consecutive-ones](https://github.com/Abhik-Chakraborty/coding-/tree/master/0485-max-consecutive-ones) |
| [0500-keyboard-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0500-keyboard-row) |
| [0503-next-greater-element-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0503-next-greater-element-ii) |
| [0540-single-element-in-a-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0540-single-element-in-a-sorted-array) |
| [0542-01-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0542-01-matrix) |
| [0560-subarray-sum-equals-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/0560-subarray-sum-equals-k) |
| [0605-can-place-flowers](https://github.com/Abhik-Chakraborty/coding-/tree/master/0605-can-place-flowers) |
| [0643-maximum-average-subarray-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/0643-maximum-average-subarray-i) |
| [0713-subarray-product-less-than-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/0713-subarray-product-less-than-k) |
| [0724-find-pivot-index](https://github.com/Abhik-Chakraborty/coding-/tree/master/0724-find-pivot-index) |
| [0733-flood-fill](https://github.com/Abhik-Chakraborty/coding-/tree/master/0733-flood-fill) |
| [0745-find-smallest-letter-greater-than-target](https://github.com/Abhik-Chakraborty/coding-/tree/master/0745-find-smallest-letter-greater-than-target) |
| [0792-binary-search](https://github.com/Abhik-Chakraborty/coding-/tree/master/0792-binary-search) |
| [0890-lemonade-change](https://github.com/Abhik-Chakraborty/coding-/tree/master/0890-lemonade-change) |
| [0907-koko-eating-bananas](https://github.com/Abhik-Chakraborty/coding-/tree/master/0907-koko-eating-bananas) |
| [0952-word-subsets](https://github.com/Abhik-Chakraborty/coding-/tree/master/0952-word-subsets) |
| [0954-maximum-sum-circular-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0954-maximum-sum-circular-subarray) |
| [0966-binary-subarrays-with-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0966-binary-subarrays-with-sum) |
| [1034-subarrays-with-k-different-integers](https://github.com/Abhik-Chakraborty/coding-/tree/master/1034-subarrays-with-k-different-integers) |
| [1036-rotting-oranges](https://github.com/Abhik-Chakraborty/coding-/tree/master/1036-rotting-oranges) |
| [1046-max-consecutive-ones-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1046-max-consecutive-ones-iii) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1073-number-of-enclaves](https://github.com/Abhik-Chakraborty/coding-/tree/master/1073-number-of-enclaves) |
| [1171-shortest-path-in-binary-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/1171-shortest-path-in-binary-matrix) |
| [1227-number-of-equivalent-domino-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/1227-number-of-equivalent-domino-pairs) |
| [1293-three-consecutive-odds](https://github.com/Abhik-Chakraborty/coding-/tree/master/1293-three-consecutive-odds) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/Abhik-Chakraborty/coding-/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1364-tuple-with-same-product](https://github.com/Abhik-Chakraborty/coding-/tree/master/1364-tuple-with-same-product) |
| [1370-count-number-of-nice-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/1370-count-number-of-nice-subarrays) |
| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/Abhik-Chakraborty/coding-/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/Abhik-Chakraborty/coding-/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
| [1510-find-lucky-integer-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/1510-find-lucky-integer-in-an-array) |
| [1524-string-matching-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/1524-string-matching-in-an-array) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/Abhik-Chakraborty/coding-/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1605-minimum-number-of-days-to-make-m-bouquets](https://github.com/Abhik-Chakraborty/coding-/tree/master/1605-minimum-number-of-days-to-make-m-bouquets) |
| [1656-count-good-triplets](https://github.com/Abhik-Chakraborty/coding-/tree/master/1656-count-good-triplets) |
| [1705-count-unhappy-friends](https://github.com/Abhik-Chakraborty/coding-/tree/master/1705-count-unhappy-friends) |
| [1753-path-with-minimum-effort](https://github.com/Abhik-Chakraborty/coding-/tree/master/1753-path-with-minimum-effort) |
| [1798-max-number-of-k-sum-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/1798-max-number-of-k-sum-pairs) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/Abhik-Chakraborty/coding-/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/Abhik-Chakraborty/coding-/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [1927-maximum-ascending-subarray-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/1927-maximum-ascending-subarray-sum) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2215-finding-3-digit-even-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2215-finding-3-digit-even-numbers) |
| [2271-rearrange-array-elements-by-sign](https://github.com/Abhik-Chakraborty/coding-/tree/master/2271-rearrange-array-elements-by-sign) |
| [2292-counting-words-with-a-given-prefix](https://github.com/Abhik-Chakraborty/coding-/tree/master/2292-counting-words-with-a-given-prefix) |
| [2308-divide-array-into-equal-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/2308-divide-array-into-equal-pairs) |
| [2316-count-hills-and-valleys-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/2316-count-hills-and-valleys-in-an-array) |
| [2350-find-closest-number-to-zero](https://github.com/Abhik-Chakraborty/coding-/tree/master/2350-find-closest-number-to-zero) |
| [2358-number-of-ways-to-split-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/2358-number-of-ways-to-split-array) |
| [2387-partition-array-such-that-maximum-difference-is-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/2387-partition-array-such-that-maximum-difference-is-k) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2448-count-number-of-bad-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/2448-count-number-of-bad-pairs) |
| [2465-shifting-letters-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/2465-shifting-letters-ii) |
| [2478-longest-nice-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/2478-longest-nice-subarray) |
| [2486-most-frequent-even-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/2486-most-frequent-even-element) |
| [2497-maximum-matching-of-players-with-trainers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2497-maximum-matching-of-players-with-trainers) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/Abhik-Chakraborty/coding-/tree/master/2527-count-subarrays-with-fixed-bounds) |
| [2533-bitwise-xor-of-all-pairings](https://github.com/Abhik-Chakraborty/coding-/tree/master/2533-bitwise-xor-of-all-pairings) |
| [2551-apply-operations-to-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/2551-apply-operations-to-an-array) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/Abhik-Chakraborty/coding-/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [2685-first-completely-painted-row-or-column](https://github.com/Abhik-Chakraborty/coding-/tree/master/2685-first-completely-painted-row-or-column) |
| [2691-count-vowel-strings-in-ranges](https://github.com/Abhik-Chakraborty/coding-/tree/master/2691-count-vowel-strings-in-ranges) |
| [2737-row-with-maximum-ones](https://github.com/Abhik-Chakraborty/coding-/tree/master/2737-row-with-maximum-ones) |
| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |
| [2792-neighboring-bitwise-xor](https://github.com/Abhik-Chakraborty/coding-/tree/master/2792-neighboring-bitwise-xor) |
| [2856-count-complete-subarrays-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/2856-count-complete-subarrays-in-an-array) |
| [2915-count-of-interesting-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/2915-count-of-interesting-subarrays) |
| [3154-maximum-value-of-an-ordered-triplet-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3154-maximum-value-of-an-ordered-triplet-i) |
| [3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros](https://github.com/Abhik-Chakraborty/coding-/tree/master/3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros) |
| [3194-find-words-containing-character](https://github.com/Abhik-Chakraborty/coding-/tree/master/3194-find-words-containing-character) |
| [3213-count-subarrays-where-max-element-appears-at-least-k-times](https://github.com/Abhik-Chakraborty/coding-/tree/master/3213-count-subarrays-where-max-element-appears-at-least-k-times) |
| [3227-find-missing-and-repeated-values](https://github.com/Abhik-Chakraborty/coding-/tree/master/3227-find-missing-and-repeated-values) |
| [3236-smallest-missing-integer-greater-than-sequential-prefix-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/3236-smallest-missing-integer-greater-than-sequential-prefix-sum) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3309-count-prefix-and-suffix-pairs-i) |
| [3321-type-of-triangle](https://github.com/Abhik-Chakraborty/coding-/tree/master/3321-type-of-triangle) |
| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |
| [3429-special-array-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3429-special-array-i) |
| [3430-count-days-without-meetings](https://github.com/Abhik-Chakraborty/coding-/tree/master/3430-count-days-without-meetings) |
| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/Abhik-Chakraborty/coding-/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |
| [3621-minimum-operations-to-make-array-values-equal-to-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/3621-minimum-operations-to-make-array-values-equal-to-k) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
| [3644-minimum-positive-sum-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/3644-minimum-positive-sum-subarray) |
| [3656-minimum-number-of-operations-to-make-elements-in-array-distinct](https://github.com/Abhik-Chakraborty/coding-/tree/master/3656-minimum-number-of-operations-to-make-elements-in-array-distinct) |
| [3685-count-subarrays-of-length-three-with-a-condition](https://github.com/Abhik-Chakraborty/coding-/tree/master/3685-count-subarrays-of-length-three-with-a-condition) |
| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |
| [3790-fruits-into-baskets-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/3790-fruits-into-baskets-ii) |
## Binary Search
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0004-median-of-two-sorted-arrays) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/Abhik-Chakraborty/coding-/tree/master/0035-search-insert-position) |
| [0074-search-a-2d-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0074-search-a-2d-matrix) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Abhik-Chakraborty/coding-/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0209-minimum-size-subarray-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0209-minimum-size-subarray-sum) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0287-find-the-duplicate-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0287-find-the-duplicate-number) |
| [0349-intersection-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0350-intersection-of-two-arrays-ii) |
| [0374-guess-number-higher-or-lower](https://github.com/Abhik-Chakraborty/coding-/tree/master/0374-guess-number-higher-or-lower) |
| [0540-single-element-in-a-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0540-single-element-in-a-sorted-array) |
| [0713-subarray-product-less-than-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/0713-subarray-product-less-than-k) |
| [0745-find-smallest-letter-greater-than-target](https://github.com/Abhik-Chakraborty/coding-/tree/master/0745-find-smallest-letter-greater-than-target) |
| [0792-binary-search](https://github.com/Abhik-Chakraborty/coding-/tree/master/0792-binary-search) |
| [0907-koko-eating-bananas](https://github.com/Abhik-Chakraborty/coding-/tree/master/0907-koko-eating-bananas) |
| [1046-max-consecutive-ones-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1046-max-consecutive-ones-iii) |
| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/Abhik-Chakraborty/coding-/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |
| [1605-minimum-number-of-days-to-make-m-bouquets](https://github.com/Abhik-Chakraborty/coding-/tree/master/1605-minimum-number-of-days-to-make-m-bouquets) |
| [1753-path-with-minimum-effort](https://github.com/Abhik-Chakraborty/coding-/tree/master/1753-path-with-minimum-effort) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/Abhik-Chakraborty/coding-/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [3790-fruits-into-baskets-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/3790-fruits-into-baskets-ii) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/0003-longest-substring-without-repeating-characters) |
| [0012-integer-to-roman](https://github.com/Abhik-Chakraborty/coding-/tree/master/0012-integer-to-roman) |
| [0036-valid-sudoku](https://github.com/Abhik-Chakraborty/coding-/tree/master/0036-valid-sudoku) |
| [0041-first-missing-positive](https://github.com/Abhik-Chakraborty/coding-/tree/master/0041-first-missing-positive) |
| [0073-set-matrix-zeroes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0073-set-matrix-zeroes) |
| [0076-minimum-window-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0076-minimum-window-substring) |
| [0127-word-ladder](https://github.com/Abhik-Chakraborty/coding-/tree/master/0127-word-ladder) |
| [0128-longest-consecutive-sequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0128-longest-consecutive-sequence) |
| [0138-copy-list-with-random-pointer](https://github.com/Abhik-Chakraborty/coding-/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/Abhik-Chakraborty/coding-/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0142-linked-list-cycle-ii) |
| [0160-intersection-of-two-linked-lists](https://github.com/Abhik-Chakraborty/coding-/tree/master/0160-intersection-of-two-linked-lists) |
| [0202-happy-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0202-happy-number) |
| [0205-isomorphic-strings](https://github.com/Abhik-Chakraborty/coding-/tree/master/0205-isomorphic-strings) |
| [0217-contains-duplicate](https://github.com/Abhik-Chakraborty/coding-/tree/master/0217-contains-duplicate) |
| [0219-contains-duplicate-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0219-contains-duplicate-ii) |
| [0229-majority-element-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/Abhik-Chakraborty/coding-/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0290-word-pattern](https://github.com/Abhik-Chakraborty/coding-/tree/master/0290-word-pattern) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0349-intersection-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0350-intersection-of-two-arrays-ii) |
| [0380-insert-delete-getrandom-o1](https://github.com/Abhik-Chakraborty/coding-/tree/master/0380-insert-delete-getrandom-o1) |
| [0383-ransom-note](https://github.com/Abhik-Chakraborty/coding-/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0387-first-unique-character-in-a-string) |
| [0389-find-the-difference](https://github.com/Abhik-Chakraborty/coding-/tree/master/0389-find-the-difference) |
| [0424-longest-repeating-character-replacement](https://github.com/Abhik-Chakraborty/coding-/tree/master/0424-longest-repeating-character-replacement) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
| [0457-circular-array-loop](https://github.com/Abhik-Chakraborty/coding-/tree/master/0457-circular-array-loop) |
| [0500-keyboard-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0500-keyboard-row) |
| [0560-subarray-sum-equals-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/0560-subarray-sum-equals-k) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0900-reordered-power-of-2](https://github.com/Abhik-Chakraborty/coding-/tree/master/0900-reordered-power-of-2) |
| [0952-word-subsets](https://github.com/Abhik-Chakraborty/coding-/tree/master/0952-word-subsets) |
| [0966-binary-subarrays-with-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0966-binary-subarrays-with-sum) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1034-subarrays-with-k-different-integers](https://github.com/Abhik-Chakraborty/coding-/tree/master/1034-subarrays-with-k-different-integers) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/Abhik-Chakraborty/coding-/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [1227-number-of-equivalent-domino-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/1227-number-of-equivalent-domino-pairs) |
| [1364-tuple-with-same-product](https://github.com/Abhik-Chakraborty/coding-/tree/master/1364-tuple-with-same-product) |
| [1370-count-number-of-nice-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/1370-count-number-of-nice-subarrays) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1502-construct-k-palindrome-strings](https://github.com/Abhik-Chakraborty/coding-/tree/master/1502-construct-k-palindrome-strings) |
| [1510-find-lucky-integer-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/1510-find-lucky-integer-in-an-array) |
| [1777-determine-if-two-strings-are-close](https://github.com/Abhik-Chakraborty/coding-/tree/master/1777-determine-if-two-strings-are-close) |
| [1798-max-number-of-k-sum-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/1798-max-number-of-k-sum-pairs) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Abhik-Chakraborty/coding-/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/Abhik-Chakraborty/coding-/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2215-finding-3-digit-even-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2215-finding-3-digit-even-numbers) |
| [2308-divide-array-into-equal-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/2308-divide-array-into-equal-pairs) |
| [2427-first-letter-to-appear-twice](https://github.com/Abhik-Chakraborty/coding-/tree/master/2427-first-letter-to-appear-twice) |
| [2448-count-number-of-bad-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/2448-count-number-of-bad-pairs) |
| [2486-most-frequent-even-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/2486-most-frequent-even-element) |
| [2685-first-completely-painted-row-or-column](https://github.com/Abhik-Chakraborty/coding-/tree/master/2685-first-completely-painted-row-or-column) |
| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |
| [2856-count-complete-subarrays-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/2856-count-complete-subarrays-in-an-array) |
| [2915-count-of-interesting-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/2915-count-of-interesting-subarrays) |
| [3227-find-missing-and-repeated-values](https://github.com/Abhik-Chakraborty/coding-/tree/master/3227-find-missing-and-repeated-values) |
| [3236-smallest-missing-integer-greater-than-sequential-prefix-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/3236-smallest-missing-integer-greater-than-sequential-prefix-sum) |
| [3360-minimum-deletions-to-make-string-k-special](https://github.com/Abhik-Chakraborty/coding-/tree/master/3360-minimum-deletions-to-make-string-k-special) |
| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/Abhik-Chakraborty/coding-/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |
| [3455-minimum-length-of-string-after-operations](https://github.com/Abhik-Chakraborty/coding-/tree/master/3455-minimum-length-of-string-after-operations) |
| [3621-minimum-operations-to-make-array-values-equal-to-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/3621-minimum-operations-to-make-array-values-equal-to-k) |
| [3656-minimum-number-of-operations-to-make-elements-in-array-distinct](https://github.com/Abhik-Chakraborty/coding-/tree/master/3656-minimum-number-of-operations-to-make-elements-in-array-distinct) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/0002-add-two-numbers) |
| [0007-reverse-integer](https://github.com/Abhik-Chakraborty/coding-/tree/master/0007-reverse-integer) |
| [0009-palindrome-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0009-palindrome-number) |
| [0012-integer-to-roman](https://github.com/Abhik-Chakraborty/coding-/tree/master/0012-integer-to-roman) |
| [0029-divide-two-integers](https://github.com/Abhik-Chakraborty/coding-/tree/master/0029-divide-two-integers) |
| [0048-rotate-image](https://github.com/Abhik-Chakraborty/coding-/tree/master/0048-rotate-image) |
| [0050-powx-n](https://github.com/Abhik-Chakraborty/coding-/tree/master/0050-powx-n) |
| [0066-plus-one](https://github.com/Abhik-Chakraborty/coding-/tree/master/0066-plus-one) |
| [0067-add-binary](https://github.com/Abhik-Chakraborty/coding-/tree/master/0067-add-binary) |
| [0189-rotate-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0202-happy-number) |
| [0204-count-primes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0204-count-primes) |
| [0231-power-of-two](https://github.com/Abhik-Chakraborty/coding-/tree/master/0231-power-of-two) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0342-power-of-four](https://github.com/Abhik-Chakraborty/coding-/tree/master/0342-power-of-four) |
| [0380-insert-delete-getrandom-o1](https://github.com/Abhik-Chakraborty/coding-/tree/master/0380-insert-delete-getrandom-o1) |
| [0412-fizz-buzz](https://github.com/Abhik-Chakraborty/coding-/tree/master/0412-fizz-buzz) |
| [0445-add-two-numbers-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0445-add-two-numbers-ii) |
| [0900-reordered-power-of-2](https://github.com/Abhik-Chakraborty/coding-/tree/master/0900-reordered-power-of-2) |
| [1370-count-number-of-nice-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/1370-count-number-of-nice-subarrays) |
| [2032-largest-odd-number-in-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/2032-largest-odd-number-in-string) |
| [2050-count-good-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2050-count-good-numbers) |
| [2448-count-number-of-bad-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/2448-count-number-of-bad-pairs) |
| [2610-closest-prime-numbers-in-range](https://github.com/Abhik-Chakraborty/coding-/tree/master/2610-closest-prime-numbers-in-range) |
| [2998-count-symmetric-integers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2998-count-symmetric-integers) |
| [3227-find-missing-and-repeated-values](https://github.com/Abhik-Chakraborty/coding-/tree/master/3227-find-missing-and-repeated-values) |
| [3321-type-of-triangle](https://github.com/Abhik-Chakraborty/coding-/tree/master/3321-type-of-triangle) |
## Bit Manipulation
| |
| ------- |
| [0029-divide-two-integers](https://github.com/Abhik-Chakraborty/coding-/tree/master/0029-divide-two-integers) |
| [0067-add-binary](https://github.com/Abhik-Chakraborty/coding-/tree/master/0067-add-binary) |
| [0136-single-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0136-single-number) |
| [0231-power-of-two](https://github.com/Abhik-Chakraborty/coding-/tree/master/0231-power-of-two) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0287-find-the-duplicate-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0287-find-the-duplicate-number) |
| [0342-power-of-four](https://github.com/Abhik-Chakraborty/coding-/tree/master/0342-power-of-four) |
| [0389-find-the-difference](https://github.com/Abhik-Chakraborty/coding-/tree/master/0389-find-the-difference) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/Abhik-Chakraborty/coding-/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2308-divide-array-into-equal-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/2308-divide-array-into-equal-pairs) |
| [2427-first-letter-to-appear-twice](https://github.com/Abhik-Chakraborty/coding-/tree/master/2427-first-letter-to-appear-twice) |
| [2478-longest-nice-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/2478-longest-nice-subarray) |
| [2509-minimize-xor](https://github.com/Abhik-Chakraborty/coding-/tree/master/2509-minimize-xor) |
| [2533-bitwise-xor-of-all-pairings](https://github.com/Abhik-Chakraborty/coding-/tree/master/2533-bitwise-xor-of-all-pairings) |
| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |
| [2792-neighboring-bitwise-xor](https://github.com/Abhik-Chakraborty/coding-/tree/master/2792-neighboring-bitwise-xor) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/Abhik-Chakraborty/coding-/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0018-4sum) |
| [0056-merge-intervals](https://github.com/Abhik-Chakraborty/coding-/tree/master/0056-merge-intervals) |
| [0075-sort-colors](https://github.com/Abhik-Chakraborty/coding-/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0088-merge-sorted-array) |
| [0148-sort-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0148-sort-list) |
| [0215-kth-largest-element-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0215-kth-largest-element-in-an-array) |
| [0217-contains-duplicate](https://github.com/Abhik-Chakraborty/coding-/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/Abhik-Chakraborty/coding-/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0274-h-index](https://github.com/Abhik-Chakraborty/coding-/tree/master/0274-h-index) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0349-intersection-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0350-intersection-of-two-arrays-ii) |
| [0389-find-the-difference](https://github.com/Abhik-Chakraborty/coding-/tree/master/0389-find-the-difference) |
| [0414-third-maximum-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0414-third-maximum-number) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/Abhik-Chakraborty/coding-/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0455-assign-cookies](https://github.com/Abhik-Chakraborty/coding-/tree/master/0455-assign-cookies) |
| [0900-reordered-power-of-2](https://github.com/Abhik-Chakraborty/coding-/tree/master/0900-reordered-power-of-2) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/Abhik-Chakraborty/coding-/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
| [1777-determine-if-two-strings-are-close](https://github.com/Abhik-Chakraborty/coding-/tree/master/1777-determine-if-two-strings-are-close) |
| [1798-max-number-of-k-sum-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/1798-max-number-of-k-sum-pairs) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2215-finding-3-digit-even-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2215-finding-3-digit-even-numbers) |
| [2387-partition-array-such-that-maximum-difference-is-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/2387-partition-array-such-that-maximum-difference-is-k) |
| [2497-maximum-matching-of-players-with-trainers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2497-maximum-matching-of-players-with-trainers) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [3236-smallest-missing-integer-greater-than-sequential-prefix-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/3236-smallest-missing-integer-greater-than-sequential-prefix-sum) |
| [3321-type-of-triangle](https://github.com/Abhik-Chakraborty/coding-/tree/master/3321-type-of-triangle) |
| [3360-minimum-deletions-to-make-string-k-special](https://github.com/Abhik-Chakraborty/coding-/tree/master/3360-minimum-deletions-to-make-string-k-special) |
| [3430-count-days-without-meetings](https://github.com/Abhik-Chakraborty/coding-/tree/master/3430-count-days-without-meetings) |
## Two Pointers
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0005-longest-palindromic-substring) |
| [0011-container-with-most-water](https://github.com/Abhik-Chakraborty/coding-/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/Abhik-Chakraborty/coding-/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0018-4sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0031-next-permutation](https://github.com/Abhik-Chakraborty/coding-/tree/master/0031-next-permutation) |
| [0042-trapping-rain-water](https://github.com/Abhik-Chakraborty/coding-/tree/master/0042-trapping-rain-water) |
| [0061-rotate-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0061-rotate-list) |
| [0075-sort-colors](https://github.com/Abhik-Chakraborty/coding-/tree/master/0075-sort-colors) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0088-merge-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/Abhik-Chakraborty/coding-/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/Abhik-Chakraborty/coding-/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0142-linked-list-cycle-ii) |
| [0143-reorder-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0143-reorder-list) |
| [0148-sort-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0148-sort-list) |
| [0151-reverse-words-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0151-reverse-words-in-a-string) |
| [0160-intersection-of-two-linked-lists](https://github.com/Abhik-Chakraborty/coding-/tree/master/0160-intersection-of-two-linked-lists) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Abhik-Chakraborty/coding-/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0202-happy-number) |
| [0234-palindrome-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0234-palindrome-linked-list) |
| [0283-move-zeroes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0287-find-the-duplicate-number) |
| [0344-reverse-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0344-reverse-string) |
| [0345-reverse-vowels-of-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0345-reverse-vowels-of-a-string) |
| [0349-intersection-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0350-intersection-of-two-arrays-ii) |
| [0392-is-subsequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0392-is-subsequence) |
| [0443-string-compression](https://github.com/Abhik-Chakraborty/coding-/tree/master/0443-string-compression) |
| [0455-assign-cookies](https://github.com/Abhik-Chakraborty/coding-/tree/master/0455-assign-cookies) |
| [0457-circular-array-loop](https://github.com/Abhik-Chakraborty/coding-/tree/master/0457-circular-array-loop) |
| [0528-swapping-nodes-in-a-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0528-swapping-nodes-in-a-linked-list) |
| [0647-palindromic-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/0647-palindromic-substrings) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0868-push-dominoes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0868-push-dominoes) |
| [0908-middle-of-the-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0908-middle-of-the-linked-list) |
| [1798-max-number-of-k-sum-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/1798-max-number-of-k-sum-pairs) |
| [1850-minimum-length-of-string-after-deleting-similar-ends](https://github.com/Abhik-Chakraborty/coding-/tree/master/1850-minimum-length-of-string-after-deleting-similar-ends) |
| [1894-merge-strings-alternately](https://github.com/Abhik-Chakraborty/coding-/tree/master/1894-merge-strings-alternately) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
| [2271-rearrange-array-elements-by-sign](https://github.com/Abhik-Chakraborty/coding-/tree/master/2271-rearrange-array-elements-by-sign) |
| [2497-maximum-matching-of-players-with-trainers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2497-maximum-matching-of-players-with-trainers) |
| [2551-apply-operations-to-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/2551-apply-operations-to-an-array) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/0003-longest-substring-without-repeating-characters) |
| [0005-longest-palindromic-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0005-longest-palindromic-substring) |
| [0006-zigzag-conversion](https://github.com/Abhik-Chakraborty/coding-/tree/master/0006-zigzag-conversion) |
| [0008-string-to-integer-atoi](https://github.com/Abhik-Chakraborty/coding-/tree/master/0008-string-to-integer-atoi) |
| [0012-integer-to-roman](https://github.com/Abhik-Chakraborty/coding-/tree/master/0012-integer-to-roman) |
| [0014-longest-common-prefix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0014-longest-common-prefix) |
| [0020-valid-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/0020-valid-parentheses) |
| [0022-generate-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/0022-generate-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0058-length-of-last-word](https://github.com/Abhik-Chakraborty/coding-/tree/master/0058-length-of-last-word) |
| [0067-add-binary](https://github.com/Abhik-Chakraborty/coding-/tree/master/0067-add-binary) |
| [0076-minimum-window-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0076-minimum-window-substring) |
| [0125-valid-palindrome](https://github.com/Abhik-Chakraborty/coding-/tree/master/0125-valid-palindrome) |
| [0127-word-ladder](https://github.com/Abhik-Chakraborty/coding-/tree/master/0127-word-ladder) |
| [0151-reverse-words-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0151-reverse-words-in-a-string) |
| [0205-isomorphic-strings](https://github.com/Abhik-Chakraborty/coding-/tree/master/0205-isomorphic-strings) |
| [0242-valid-anagram](https://github.com/Abhik-Chakraborty/coding-/tree/master/0242-valid-anagram) |
| [0257-binary-tree-paths](https://github.com/Abhik-Chakraborty/coding-/tree/master/0257-binary-tree-paths) |
| [0290-word-pattern](https://github.com/Abhik-Chakraborty/coding-/tree/master/0290-word-pattern) |
| [0344-reverse-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0344-reverse-string) |
| [0345-reverse-vowels-of-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0345-reverse-vowels-of-a-string) |
| [0383-ransom-note](https://github.com/Abhik-Chakraborty/coding-/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0387-first-unique-character-in-a-string) |
| [0389-find-the-difference](https://github.com/Abhik-Chakraborty/coding-/tree/master/0389-find-the-difference) |
| [0392-is-subsequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0392-is-subsequence) |
| [0412-fizz-buzz](https://github.com/Abhik-Chakraborty/coding-/tree/master/0412-fizz-buzz) |
| [0424-longest-repeating-character-replacement](https://github.com/Abhik-Chakraborty/coding-/tree/master/0424-longest-repeating-character-replacement) |
| [0443-string-compression](https://github.com/Abhik-Chakraborty/coding-/tree/master/0443-string-compression) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
| [0459-repeated-substring-pattern](https://github.com/Abhik-Chakraborty/coding-/tree/master/0459-repeated-substring-pattern) |
| [0500-keyboard-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0500-keyboard-row) |
| [0647-palindromic-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/0647-palindromic-substrings) |
| [0812-rotate-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0812-rotate-string) |
| [0868-push-dominoes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0868-push-dominoes) |
| [0952-word-subsets](https://github.com/Abhik-Chakraborty/coding-/tree/master/0952-word-subsets) |
| [1078-remove-outermost-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/1078-remove-outermost-parentheses) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/Abhik-Chakraborty/coding-/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1351-replace-the-substring-for-balanced-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/1351-replace-the-substring-for-balanced-string) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1502-construct-k-palindrome-strings](https://github.com/Abhik-Chakraborty/coding-/tree/master/1502-construct-k-palindrome-strings) |
| [1524-string-matching-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/1524-string-matching-in-an-array) |
| [1537-maximum-score-after-splitting-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/1537-maximum-score-after-splitting-a-string) |
| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/Abhik-Chakraborty/coding-/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
| [1777-determine-if-two-strings-are-close](https://github.com/Abhik-Chakraborty/coding-/tree/master/1777-determine-if-two-strings-are-close) |
| [1850-minimum-length-of-string-after-deleting-similar-ends](https://github.com/Abhik-Chakraborty/coding-/tree/master/1850-minimum-length-of-string-after-deleting-similar-ends) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [1894-merge-strings-alternately](https://github.com/Abhik-Chakraborty/coding-/tree/master/1894-merge-strings-alternately) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/Abhik-Chakraborty/coding-/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Abhik-Chakraborty/coding-/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [2032-largest-odd-number-in-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/2032-largest-odd-number-in-string) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/Abhik-Chakraborty/coding-/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/Abhik-Chakraborty/coding-/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |
| [2260-divide-a-string-into-groups-of-size-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/2260-divide-a-string-into-groups-of-size-k) |
| [2292-counting-words-with-a-given-prefix](https://github.com/Abhik-Chakraborty/coding-/tree/master/2292-counting-words-with-a-given-prefix) |
| [2427-first-letter-to-appear-twice](https://github.com/Abhik-Chakraborty/coding-/tree/master/2427-first-letter-to-appear-twice) |
| [2465-shifting-letters-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/2465-shifting-letters-ii) |
| [2691-count-vowel-strings-in-ranges](https://github.com/Abhik-Chakraborty/coding-/tree/master/2691-count-vowel-strings-in-ranges) |
| [3194-find-words-containing-character](https://github.com/Abhik-Chakraborty/coding-/tree/master/3194-find-words-containing-character) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3309-count-prefix-and-suffix-pairs-i) |
| [3360-minimum-deletions-to-make-string-k-special](https://github.com/Abhik-Chakraborty/coding-/tree/master/3360-minimum-deletions-to-make-string-k-special) |
| [3447-clear-digits](https://github.com/Abhik-Chakraborty/coding-/tree/master/3447-clear-digits) |
| [3455-minimum-length-of-string-after-operations](https://github.com/Abhik-Chakraborty/coding-/tree/master/3455-minimum-length-of-string-after-operations) |
| [3684-substring-matching-pattern](https://github.com/Abhik-Chakraborty/coding-/tree/master/3684-substring-matching-pattern) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0459-repeated-substring-pattern](https://github.com/Abhik-Chakraborty/coding-/tree/master/0459-repeated-substring-pattern) |
| [0812-rotate-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0812-rotate-string) |
| [1524-string-matching-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/1524-string-matching-in-an-array) |
| [2292-counting-words-with-a-given-prefix](https://github.com/Abhik-Chakraborty/coding-/tree/master/2292-counting-words-with-a-given-prefix) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3309-count-prefix-and-suffix-pairs-i) |
| [3684-substring-matching-pattern](https://github.com/Abhik-Chakraborty/coding-/tree/master/3684-substring-matching-pattern) |
## Interactive
| |
| ------- |
| [0374-guess-number-higher-or-lower](https://github.com/Abhik-Chakraborty/coding-/tree/master/0374-guess-number-higher-or-lower) |
## Dynamic Programming
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0005-longest-palindromic-substring) |
| [0022-generate-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/0022-generate-parentheses) |
| [0042-trapping-rain-water](https://github.com/Abhik-Chakraborty/coding-/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0045-jump-game-ii) |
| [0053-maximum-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0053-maximum-subarray) |
| [0055-jump-game](https://github.com/Abhik-Chakraborty/coding-/tree/master/0055-jump-game) |
| [0118-pascals-triangle](https://github.com/Abhik-Chakraborty/coding-/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Abhik-Chakraborty/coding-/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |
| [0124-binary-tree-maximum-path-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0124-binary-tree-maximum-path-sum) |
| [0152-maximum-product-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0152-maximum-product-subarray) |
| [0392-is-subsequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0392-is-subsequence) |
| [0416-partition-equal-subset-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0416-partition-equal-subset-sum) |
| [0542-01-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0542-01-matrix) |
| [0647-palindromic-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/0647-palindromic-substrings) |
| [0803-cheapest-flights-within-k-stops](https://github.com/Abhik-Chakraborty/coding-/tree/master/0803-cheapest-flights-within-k-stops) |
| [0868-push-dominoes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0868-push-dominoes) |
| [0954-maximum-sum-circular-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0954-maximum-sum-circular-subarray) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/Abhik-Chakraborty/coding-/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [2090-number-of-ways-to-arrive-at-destination](https://github.com/Abhik-Chakraborty/coding-/tree/master/2090-number-of-ways-to-arrive-at-destination) |
## Matrix
| |
| ------- |
| [0036-valid-sudoku](https://github.com/Abhik-Chakraborty/coding-/tree/master/0036-valid-sudoku) |
| [0048-rotate-image](https://github.com/Abhik-Chakraborty/coding-/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0054-spiral-matrix) |
| [0073-set-matrix-zeroes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0074-search-a-2d-matrix) |
| [0130-surrounded-regions](https://github.com/Abhik-Chakraborty/coding-/tree/master/0130-surrounded-regions) |
| [0289-game-of-life](https://github.com/Abhik-Chakraborty/coding-/tree/master/0289-game-of-life) |
| [0542-01-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0542-01-matrix) |
| [0733-flood-fill](https://github.com/Abhik-Chakraborty/coding-/tree/master/0733-flood-fill) |
| [1036-rotting-oranges](https://github.com/Abhik-Chakraborty/coding-/tree/master/1036-rotting-oranges) |
| [1073-number-of-enclaves](https://github.com/Abhik-Chakraborty/coding-/tree/master/1073-number-of-enclaves) |
| [1171-shortest-path-in-binary-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/1171-shortest-path-in-binary-matrix) |
| [1753-path-with-minimum-effort](https://github.com/Abhik-Chakraborty/coding-/tree/master/1753-path-with-minimum-effort) |
| [2685-first-completely-painted-row-or-column](https://github.com/Abhik-Chakraborty/coding-/tree/master/2685-first-completely-painted-row-or-column) |
| [2737-row-with-maximum-ones](https://github.com/Abhik-Chakraborty/coding-/tree/master/2737-row-with-maximum-ones) |
| [3227-find-missing-and-repeated-values](https://github.com/Abhik-Chakraborty/coding-/tree/master/3227-find-missing-and-repeated-values) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
## Prefix Sum
| |
| ------- |
| [0209-minimum-size-subarray-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0209-minimum-size-subarray-sum) |
| [0238-product-of-array-except-self](https://github.com/Abhik-Chakraborty/coding-/tree/master/0238-product-of-array-except-self) |
| [0560-subarray-sum-equals-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/0560-subarray-sum-equals-k) |
| [0713-subarray-product-less-than-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/0713-subarray-product-less-than-k) |
| [0724-find-pivot-index](https://github.com/Abhik-Chakraborty/coding-/tree/master/0724-find-pivot-index) |
| [0966-binary-subarrays-with-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0966-binary-subarrays-with-sum) |
| [1046-max-consecutive-ones-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1046-max-consecutive-ones-iii) |
| [1370-count-number-of-nice-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/1370-count-number-of-nice-subarrays) |
| [1537-maximum-score-after-splitting-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/1537-maximum-score-after-splitting-a-string) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/Abhik-Chakraborty/coding-/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/Abhik-Chakraborty/coding-/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/Abhik-Chakraborty/coding-/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2358-number-of-ways-to-split-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/2358-number-of-ways-to-split-array) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2465-shifting-letters-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/2465-shifting-letters-ii) |
| [2691-count-vowel-strings-in-ranges](https://github.com/Abhik-Chakraborty/coding-/tree/master/2691-count-vowel-strings-in-ranges) |
| [2915-count-of-interesting-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/2915-count-of-interesting-subarrays) |
| [3644-minimum-positive-sum-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/3644-minimum-positive-sum-subarray) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0004-median-of-two-sorted-arrays) |
| [0023-merge-k-sorted-lists](https://github.com/Abhik-Chakraborty/coding-/tree/master/0023-merge-k-sorted-lists) |
| [0053-maximum-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0053-maximum-subarray) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0148-sort-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0148-sort-list) |
| [0215-kth-largest-element-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0954-maximum-sum-circular-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0954-maximum-sum-circular-subarray) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/0003-longest-substring-without-repeating-characters) |
| [0076-minimum-window-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0076-minimum-window-substring) |
| [0209-minimum-size-subarray-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0209-minimum-size-subarray-sum) |
| [0219-contains-duplicate-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0219-contains-duplicate-ii) |
| [0424-longest-repeating-character-replacement](https://github.com/Abhik-Chakraborty/coding-/tree/master/0424-longest-repeating-character-replacement) |
| [0643-maximum-average-subarray-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/0643-maximum-average-subarray-i) |
| [0713-subarray-product-less-than-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/0713-subarray-product-less-than-k) |
| [0966-binary-subarrays-with-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0966-binary-subarrays-with-sum) |
| [1034-subarrays-with-k-different-integers](https://github.com/Abhik-Chakraborty/coding-/tree/master/1034-subarrays-with-k-different-integers) |
| [1046-max-consecutive-ones-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1046-max-consecutive-ones-iii) |
| [1351-replace-the-substring-for-balanced-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/1351-replace-the-substring-for-balanced-string) |
| [1370-count-number-of-nice-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/1370-count-number-of-nice-subarrays) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/Abhik-Chakraborty/coding-/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/Abhik-Chakraborty/coding-/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2478-longest-nice-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/2478-longest-nice-subarray) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/Abhik-Chakraborty/coding-/tree/master/2527-count-subarrays-with-fixed-bounds) |
| [2856-count-complete-subarrays-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/2856-count-complete-subarrays-in-an-array) |
| [3213-count-subarrays-where-max-element-appears-at-least-k-times](https://github.com/Abhik-Chakraborty/coding-/tree/master/3213-count-subarrays-where-max-element-appears-at-least-k-times) |
| [3644-minimum-positive-sum-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/3644-minimum-positive-sum-subarray) |
| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0104-maximum-depth-of-binary-tree) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0110-balanced-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0110-balanced-binary-tree) |
| [0112-path-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0112-path-sum) |
| [0124-binary-tree-maximum-path-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/0129-sum-root-to-leaf-numbers) |
| [0144-binary-tree-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0145-binary-tree-postorder-traversal) |
| [0173-binary-search-tree-iterator](https://github.com/Abhik-Chakraborty/coding-/tree/master/0173-binary-search-tree-iterator) |
| [0199-binary-tree-right-side-view](https://github.com/Abhik-Chakraborty/coding-/tree/master/0199-binary-tree-right-side-view) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/Abhik-Chakraborty/coding-/tree/master/0257-binary-tree-paths) |
| [0450-delete-node-in-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0450-delete-node-in-a-bst) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0538-convert-bst-to-greater-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0538-convert-bst-to-greater-tree) |
| [0543-diameter-of-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0543-diameter-of-binary-tree) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0783-search-in-a-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0784-insert-into-a-binary-search-tree) |
| [0799-minimum-distance-between-bst-nodes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0799-minimum-distance-between-bst-nodes) |
| [0998-check-completeness-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0998-check-completeness-of-a-binary-tree) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/Abhik-Chakraborty/coding-/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
## Breadth-First Search
| |
| ------- |
| [0100-same-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0104-maximum-depth-of-binary-tree) |
| [0112-path-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0112-path-sum) |
| [0127-word-ladder](https://github.com/Abhik-Chakraborty/coding-/tree/master/0127-word-ladder) |
| [0130-surrounded-regions](https://github.com/Abhik-Chakraborty/coding-/tree/master/0130-surrounded-regions) |
| [0199-binary-tree-right-side-view](https://github.com/Abhik-Chakraborty/coding-/tree/master/0199-binary-tree-right-side-view) |
| [0207-course-schedule](https://github.com/Abhik-Chakraborty/coding-/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0210-course-schedule-ii) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0542-01-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0542-01-matrix) |
| [0547-number-of-provinces](https://github.com/Abhik-Chakraborty/coding-/tree/master/0547-number-of-provinces) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0733-flood-fill](https://github.com/Abhik-Chakraborty/coding-/tree/master/0733-flood-fill) |
| [0744-network-delay-time](https://github.com/Abhik-Chakraborty/coding-/tree/master/0744-network-delay-time) |
| [0799-minimum-distance-between-bst-nodes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0799-minimum-distance-between-bst-nodes) |
| [0801-is-graph-bipartite](https://github.com/Abhik-Chakraborty/coding-/tree/master/0801-is-graph-bipartite) |
| [0803-cheapest-flights-within-k-stops](https://github.com/Abhik-Chakraborty/coding-/tree/master/0803-cheapest-flights-within-k-stops) |
| [0820-find-eventual-safe-states](https://github.com/Abhik-Chakraborty/coding-/tree/master/0820-find-eventual-safe-states) |
| [0998-check-completeness-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0998-check-completeness-of-a-binary-tree) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1036-rotting-oranges](https://github.com/Abhik-Chakraborty/coding-/tree/master/1036-rotting-oranges) |
| [1073-number-of-enclaves](https://github.com/Abhik-Chakraborty/coding-/tree/master/1073-number-of-enclaves) |
| [1171-shortest-path-in-binary-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/1171-shortest-path-in-binary-matrix) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/Abhik-Chakraborty/coding-/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [1753-path-with-minimum-effort](https://github.com/Abhik-Chakraborty/coding-/tree/master/1753-path-with-minimum-effort) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0104-maximum-depth-of-binary-tree) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0110-balanced-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0110-balanced-binary-tree) |
| [0112-path-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0112-path-sum) |
| [0124-binary-tree-maximum-path-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/0129-sum-root-to-leaf-numbers) |
| [0144-binary-tree-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0145-binary-tree-postorder-traversal) |
| [0173-binary-search-tree-iterator](https://github.com/Abhik-Chakraborty/coding-/tree/master/0173-binary-search-tree-iterator) |
| [0199-binary-tree-right-side-view](https://github.com/Abhik-Chakraborty/coding-/tree/master/0199-binary-tree-right-side-view) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/Abhik-Chakraborty/coding-/tree/master/0257-binary-tree-paths) |
| [0450-delete-node-in-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0450-delete-node-in-a-bst) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0538-convert-bst-to-greater-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0538-convert-bst-to-greater-tree) |
| [0543-diameter-of-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0543-diameter-of-binary-tree) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0783-search-in-a-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0784-insert-into-a-binary-search-tree) |
| [0799-minimum-distance-between-bst-nodes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0799-minimum-distance-between-bst-nodes) |
| [0998-check-completeness-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0998-check-completeness-of-a-binary-tree) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/Abhik-Chakraborty/coding-/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
## Simulation
| |
| ------- |
| [0054-spiral-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0054-spiral-matrix) |
| [0067-add-binary](https://github.com/Abhik-Chakraborty/coding-/tree/master/0067-add-binary) |
| [0289-game-of-life](https://github.com/Abhik-Chakraborty/coding-/tree/master/0289-game-of-life) |
| [0412-fizz-buzz](https://github.com/Abhik-Chakraborty/coding-/tree/master/0412-fizz-buzz) |
| [1705-count-unhappy-friends](https://github.com/Abhik-Chakraborty/coding-/tree/master/1705-count-unhappy-friends) |
| [2260-divide-a-string-into-groups-of-size-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/2260-divide-a-string-into-groups-of-size-k) |
| [2271-rearrange-array-elements-by-sign](https://github.com/Abhik-Chakraborty/coding-/tree/master/2271-rearrange-array-elements-by-sign) |
| [2551-apply-operations-to-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/2551-apply-operations-to-an-array) |
| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/Abhik-Chakraborty/coding-/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |
| [3447-clear-digits](https://github.com/Abhik-Chakraborty/coding-/tree/master/3447-clear-digits) |
| [3790-fruits-into-baskets-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/3790-fruits-into-baskets-ii) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0128-longest-consecutive-sequence) |
| [0130-surrounded-regions](https://github.com/Abhik-Chakraborty/coding-/tree/master/0130-surrounded-regions) |
| [0547-number-of-provinces](https://github.com/Abhik-Chakraborty/coding-/tree/master/0547-number-of-provinces) |
| [0801-is-graph-bipartite](https://github.com/Abhik-Chakraborty/coding-/tree/master/0801-is-graph-bipartite) |
| [1073-number-of-enclaves](https://github.com/Abhik-Chakraborty/coding-/tree/master/1073-number-of-enclaves) |
| [1753-path-with-minimum-effort](https://github.com/Abhik-Chakraborty/coding-/tree/master/1753-path-with-minimum-effort) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/0020-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/Abhik-Chakraborty/coding-/tree/master/0042-trapping-rain-water) |
| [0094-binary-tree-inorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0094-binary-tree-inorder-traversal) |
| [0143-reorder-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0143-reorder-list) |
| [0144-binary-tree-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0145-binary-tree-postorder-traversal) |
| [0155-min-stack](https://github.com/Abhik-Chakraborty/coding-/tree/master/0155-min-stack) |
| [0173-binary-search-tree-iterator](https://github.com/Abhik-Chakraborty/coding-/tree/master/0173-binary-search-tree-iterator) |
| [0225-implement-stack-using-queues](https://github.com/Abhik-Chakraborty/coding-/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/Abhik-Chakraborty/coding-/tree/master/0232-implement-queue-using-stacks) |
| [0234-palindrome-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0234-palindrome-linked-list) |
| [0445-add-two-numbers-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0445-add-two-numbers-ii) |
| [0503-next-greater-element-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0503-next-greater-element-ii) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1078-remove-outermost-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/1078-remove-outermost-parentheses) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/Abhik-Chakraborty/coding-/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |
| [3447-clear-digits](https://github.com/Abhik-Chakraborty/coding-/tree/master/3447-clear-digits) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0023-merge-k-sorted-lists](https://github.com/Abhik-Chakraborty/coding-/tree/master/0023-merge-k-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/0024-swap-nodes-in-pairs) |
| [0025-reverse-nodes-in-k-group](https://github.com/Abhik-Chakraborty/coding-/tree/master/0025-reverse-nodes-in-k-group) |
| [0061-rotate-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0061-rotate-list) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0092-reverse-linked-list-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0092-reverse-linked-list-ii) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0138-copy-list-with-random-pointer](https://github.com/Abhik-Chakraborty/coding-/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/Abhik-Chakraborty/coding-/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0142-linked-list-cycle-ii) |
| [0143-reorder-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0143-reorder-list) |
| [0148-sort-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/Abhik-Chakraborty/coding-/tree/master/0160-intersection-of-two-linked-lists) |
| [0206-reverse-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0234-palindrome-linked-list) |
| [0237-delete-node-in-a-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0237-delete-node-in-a-linked-list) |
| [0328-odd-even-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0328-odd-even-linked-list) |
| [0445-add-two-numbers-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0445-add-two-numbers-ii) |
| [0528-swapping-nodes-in-a-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0528-swapping-nodes-in-a-linked-list) |
| [0908-middle-of-the-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0908-middle-of-the-linked-list) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Abhik-Chakraborty/coding-/tree/master/0011-container-with-most-water) |
| [0045-jump-game-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/Abhik-Chakraborty/coding-/tree/master/0055-jump-game) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0134-gas-station](https://github.com/Abhik-Chakraborty/coding-/tree/master/0134-gas-station) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/Abhik-Chakraborty/coding-/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0455-assign-cookies](https://github.com/Abhik-Chakraborty/coding-/tree/master/0455-assign-cookies) |
| [0605-can-place-flowers](https://github.com/Abhik-Chakraborty/coding-/tree/master/0605-can-place-flowers) |
| [0890-lemonade-change](https://github.com/Abhik-Chakraborty/coding-/tree/master/0890-lemonade-change) |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/Abhik-Chakraborty/coding-/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
| [1502-construct-k-palindrome-strings](https://github.com/Abhik-Chakraborty/coding-/tree/master/1502-construct-k-palindrome-strings) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2032-largest-odd-number-in-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/2032-largest-odd-number-in-string) |
| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/Abhik-Chakraborty/coding-/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |
| [2387-partition-array-such-that-maximum-difference-is-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/2387-partition-array-such-that-maximum-difference-is-k) |
| [2497-maximum-matching-of-players-with-trainers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2497-maximum-matching-of-players-with-trainers) |
| [2509-minimize-xor](https://github.com/Abhik-Chakraborty/coding-/tree/master/2509-minimize-xor) |
| [3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros](https://github.com/Abhik-Chakraborty/coding-/tree/master/3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros) |
| [3360-minimum-deletions-to-make-string-k-special](https://github.com/Abhik-Chakraborty/coding-/tree/master/3360-minimum-deletions-to-make-string-k-special) |
| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0014-longest-common-prefix) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/Abhik-Chakraborty/coding-/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3309-count-prefix-and-suffix-pairs-i) |
## Heap (Priority Queue)
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/Abhik-Chakraborty/coding-/tree/master/0023-merge-k-sorted-lists) |
| [0215-kth-largest-element-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
| [0744-network-delay-time](https://github.com/Abhik-Chakraborty/coding-/tree/master/0744-network-delay-time) |
| [0803-cheapest-flights-within-k-stops](https://github.com/Abhik-Chakraborty/coding-/tree/master/0803-cheapest-flights-within-k-stops) |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/Abhik-Chakraborty/coding-/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
| [1753-path-with-minimum-effort](https://github.com/Abhik-Chakraborty/coding-/tree/master/1753-path-with-minimum-effort) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
## Bucket Sort
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
## Counting
| |
| ------- |
| [0229-majority-element-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0229-majority-element-ii) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0383-ransom-note](https://github.com/Abhik-Chakraborty/coding-/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0387-first-unique-character-in-a-string) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
| [0900-reordered-power-of-2](https://github.com/Abhik-Chakraborty/coding-/tree/master/0900-reordered-power-of-2) |
| [1034-subarrays-with-k-different-integers](https://github.com/Abhik-Chakraborty/coding-/tree/master/1034-subarrays-with-k-different-integers) |
| [1227-number-of-equivalent-domino-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/1227-number-of-equivalent-domino-pairs) |
| [1364-tuple-with-same-product](https://github.com/Abhik-Chakraborty/coding-/tree/master/1364-tuple-with-same-product) |
| [1502-construct-k-palindrome-strings](https://github.com/Abhik-Chakraborty/coding-/tree/master/1502-construct-k-palindrome-strings) |
| [1510-find-lucky-integer-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/1510-find-lucky-integer-in-an-array) |
| [1777-determine-if-two-strings-are-close](https://github.com/Abhik-Chakraborty/coding-/tree/master/1777-determine-if-two-strings-are-close) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/Abhik-Chakraborty/coding-/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [2308-divide-array-into-equal-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/2308-divide-array-into-equal-pairs) |
| [2427-first-letter-to-appear-twice](https://github.com/Abhik-Chakraborty/coding-/tree/master/2427-first-letter-to-appear-twice) |
| [2448-count-number-of-bad-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/2448-count-number-of-bad-pairs) |
| [2486-most-frequent-even-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/2486-most-frequent-even-element) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/Abhik-Chakraborty/coding-/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [3360-minimum-deletions-to-make-string-k-special](https://github.com/Abhik-Chakraborty/coding-/tree/master/3360-minimum-deletions-to-make-string-k-special) |
| [3455-minimum-length-of-string-after-operations](https://github.com/Abhik-Chakraborty/coding-/tree/master/3455-minimum-length-of-string-after-operations) |
## Quickselect
| |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
## Queue
| |
| ------- |
| [0225-implement-stack-using-queues](https://github.com/Abhik-Chakraborty/coding-/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/Abhik-Chakraborty/coding-/tree/master/0232-implement-queue-using-stacks) |
| [0387-first-unique-character-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0387-first-unique-character-in-a-string) |
| [0954-maximum-sum-circular-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0954-maximum-sum-circular-subarray) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/Abhik-Chakraborty/coding-/tree/master/2527-count-subarrays-with-fixed-bounds) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/0002-add-two-numbers) |
| [0024-swap-nodes-in-pairs](https://github.com/Abhik-Chakraborty/coding-/tree/master/0024-swap-nodes-in-pairs) |
| [0025-reverse-nodes-in-k-group](https://github.com/Abhik-Chakraborty/coding-/tree/master/0025-reverse-nodes-in-k-group) |
| [0050-powx-n](https://github.com/Abhik-Chakraborty/coding-/tree/master/0050-powx-n) |
| [0143-reorder-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0143-reorder-list) |
| [0206-reverse-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0206-reverse-linked-list) |
| [0231-power-of-two](https://github.com/Abhik-Chakraborty/coding-/tree/master/0231-power-of-two) |
| [0234-palindrome-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0234-palindrome-linked-list) |
| [0342-power-of-four](https://github.com/Abhik-Chakraborty/coding-/tree/master/0342-power-of-four) |
| [2050-count-good-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2050-count-good-numbers) |
## Merge Sort
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/Abhik-Chakraborty/coding-/tree/master/0023-merge-k-sorted-lists) |
| [0148-sort-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0148-sort-list) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/Abhik-Chakraborty/coding-/tree/master/0155-min-stack) |
| [0173-binary-search-tree-iterator](https://github.com/Abhik-Chakraborty/coding-/tree/master/0173-binary-search-tree-iterator) |
| [0225-implement-stack-using-queues](https://github.com/Abhik-Chakraborty/coding-/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/Abhik-Chakraborty/coding-/tree/master/0232-implement-queue-using-stacks) |
| [0380-insert-delete-getrandom-o1](https://github.com/Abhik-Chakraborty/coding-/tree/master/0380-insert-delete-getrandom-o1) |
## Counting Sort
| |
| ------- |
| [0274-h-index](https://github.com/Abhik-Chakraborty/coding-/tree/master/0274-h-index) |
## Depth-First Search
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0110-balanced-binary-tree) |
| [0112-path-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0112-path-sum) |
| [0124-binary-tree-maximum-path-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/0129-sum-root-to-leaf-numbers) |
| [0130-surrounded-regions](https://github.com/Abhik-Chakraborty/coding-/tree/master/0130-surrounded-regions) |
| [0144-binary-tree-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0145-binary-tree-postorder-traversal) |
| [0199-binary-tree-right-side-view](https://github.com/Abhik-Chakraborty/coding-/tree/master/0199-binary-tree-right-side-view) |
| [0207-course-schedule](https://github.com/Abhik-Chakraborty/coding-/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0210-course-schedule-ii) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/Abhik-Chakraborty/coding-/tree/master/0257-binary-tree-paths) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0538-convert-bst-to-greater-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0538-convert-bst-to-greater-tree) |
| [0543-diameter-of-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0543-diameter-of-binary-tree) |
| [0547-number-of-provinces](https://github.com/Abhik-Chakraborty/coding-/tree/master/0547-number-of-provinces) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0733-flood-fill](https://github.com/Abhik-Chakraborty/coding-/tree/master/0733-flood-fill) |
| [0744-network-delay-time](https://github.com/Abhik-Chakraborty/coding-/tree/master/0744-network-delay-time) |
| [0799-minimum-distance-between-bst-nodes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0799-minimum-distance-between-bst-nodes) |
| [0801-is-graph-bipartite](https://github.com/Abhik-Chakraborty/coding-/tree/master/0801-is-graph-bipartite) |
| [0803-cheapest-flights-within-k-stops](https://github.com/Abhik-Chakraborty/coding-/tree/master/0803-cheapest-flights-within-k-stops) |
| [0820-find-eventual-safe-states](https://github.com/Abhik-Chakraborty/coding-/tree/master/0820-find-eventual-safe-states) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1073-number-of-enclaves](https://github.com/Abhik-Chakraborty/coding-/tree/master/1073-number-of-enclaves) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/Abhik-Chakraborty/coding-/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/Abhik-Chakraborty/coding-/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1753-path-with-minimum-effort](https://github.com/Abhik-Chakraborty/coding-/tree/master/1753-path-with-minimum-effort) |
## Rolling Hash
| |
| ------- |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3309-count-prefix-and-suffix-pairs-i) |
## Hash Function
| |
| ------- |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3309-count-prefix-and-suffix-pairs-i) |
## Brainteaser
| |
| ------- |
| [2533-bitwise-xor-of-all-pairings](https://github.com/Abhik-Chakraborty/coding-/tree/master/2533-bitwise-xor-of-all-pairings) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/Abhik-Chakraborty/coding-/tree/master/0042-trapping-rain-water) |
| [0503-next-greater-element-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0503-next-greater-element-ii) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
## Backtracking
| |
| ------- |
| [0022-generate-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/0022-generate-parentheses) |
| [0039-combination-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0039-combination-sum) |
| [0046-permutations](https://github.com/Abhik-Chakraborty/coding-/tree/master/0046-permutations) |
| [0257-binary-tree-paths](https://github.com/Abhik-Chakraborty/coding-/tree/master/0257-binary-tree-paths) |
## Randomized
| |
| ------- |
| [0380-insert-delete-getrandom-o1](https://github.com/Abhik-Chakraborty/coding-/tree/master/0380-insert-delete-getrandom-o1) |
## Number Theory
| |
| ------- |
| [0204-count-primes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0204-count-primes) |
| [2610-closest-prime-numbers-in-range](https://github.com/Abhik-Chakraborty/coding-/tree/master/2610-closest-prime-numbers-in-range) |
## Binary Search Tree
| |
| ------- |
| [0098-validate-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0099-recover-binary-search-tree) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0173-binary-search-tree-iterator](https://github.com/Abhik-Chakraborty/coding-/tree/master/0173-binary-search-tree-iterator) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0450-delete-node-in-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0450-delete-node-in-a-bst) |
| [0538-convert-bst-to-greater-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0538-convert-bst-to-greater-tree) |
| [0653-two-sum-iv-input-is-a-bst](https://github.com/Abhik-Chakraborty/coding-/tree/master/0653-two-sum-iv-input-is-a-bst) |
| [0783-search-in-a-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/0784-insert-into-a-binary-search-tree) |
| [0799-minimum-distance-between-bst-nodes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0799-minimum-distance-between-bst-nodes) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
## Monotonic Queue
| |
| ------- |
| [0954-maximum-sum-circular-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0954-maximum-sum-circular-subarray) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/Abhik-Chakraborty/coding-/tree/master/2527-count-subarrays-with-fixed-bounds) |
## Iterator
| |
| ------- |
| [0173-binary-search-tree-iterator](https://github.com/Abhik-Chakraborty/coding-/tree/master/0173-binary-search-tree-iterator) |
## Graph
| |
| ------- |
| [0207-course-schedule](https://github.com/Abhik-Chakraborty/coding-/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0210-course-schedule-ii) |
| [0547-number-of-provinces](https://github.com/Abhik-Chakraborty/coding-/tree/master/0547-number-of-provinces) |
| [0744-network-delay-time](https://github.com/Abhik-Chakraborty/coding-/tree/master/0744-network-delay-time) |
| [0801-is-graph-bipartite](https://github.com/Abhik-Chakraborty/coding-/tree/master/0801-is-graph-bipartite) |
| [0803-cheapest-flights-within-k-stops](https://github.com/Abhik-Chakraborty/coding-/tree/master/0803-cheapest-flights-within-k-stops) |
| [0820-find-eventual-safe-states](https://github.com/Abhik-Chakraborty/coding-/tree/master/0820-find-eventual-safe-states) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/Abhik-Chakraborty/coding-/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [2090-number-of-ways-to-arrive-at-destination](https://github.com/Abhik-Chakraborty/coding-/tree/master/2090-number-of-ways-to-arrive-at-destination) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
## Enumeration
| |
| ------- |
| [0204-count-primes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0204-count-primes) |
| [0900-reordered-power-of-2](https://github.com/Abhik-Chakraborty/coding-/tree/master/0900-reordered-power-of-2) |
| [1656-count-good-triplets](https://github.com/Abhik-Chakraborty/coding-/tree/master/1656-count-good-triplets) |
| [2215-finding-3-digit-even-numbers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2215-finding-3-digit-even-numbers) |
| [2998-count-symmetric-integers](https://github.com/Abhik-Chakraborty/coding-/tree/master/2998-count-symmetric-integers) |
## Topological Sort
| |
| ------- |
| [0207-course-schedule](https://github.com/Abhik-Chakraborty/coding-/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0210-course-schedule-ii) |
| [0820-find-eventual-safe-states](https://github.com/Abhik-Chakraborty/coding-/tree/master/0820-find-eventual-safe-states) |
| [2090-number-of-ways-to-arrive-at-destination](https://github.com/Abhik-Chakraborty/coding-/tree/master/2090-number-of-ways-to-arrive-at-destination) |
## Shortest Path
| |
| ------- |
| [0744-network-delay-time](https://github.com/Abhik-Chakraborty/coding-/tree/master/0744-network-delay-time) |
| [0803-cheapest-flights-within-k-stops](https://github.com/Abhik-Chakraborty/coding-/tree/master/0803-cheapest-flights-within-k-stops) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/Abhik-Chakraborty/coding-/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [2090-number-of-ways-to-arrive-at-destination](https://github.com/Abhik-Chakraborty/coding-/tree/master/2090-number-of-ways-to-arrive-at-destination) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/Abhik-Chakraborty/coding-/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
## Segment Tree
| |
| ------- |
| [3790-fruits-into-baskets-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/3790-fruits-into-baskets-ii) |
## Ordered Set
| |
| ------- |
| [3790-fruits-into-baskets-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/3790-fruits-into-baskets-ii) |