https://github.com/ashirvad47/l.c.d

A collection of LeetCode questions solved by me.
https://github.com/ashirvad47/l.c.d

algorithms data-structures database java mysql

Last synced: 3 months ago
JSON representation

A collection of LeetCode questions solved by me.

• Host: GitHub
• URL: https://github.com/ashirvad47/l.c.d
• Owner: ashirvad47
• Created: 2024-09-10T14:12:39.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2024-10-24T14:23:29.000Z (over 1 year ago)
• Last Synced: 2024-10-24T17:58:37.212Z (over 1 year ago)
• Topics: algorithms, data-structures, database, java, mysql
• Language: Java
• Homepage:
• Size: 388 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# L.C.D

A collection of LeetCode questions to ace the coding interview! 

# LeetCode Topics

## Array

|  |

| ------- |

| [0001-two-sum](https://github.com/ashirvad47/L.C.D/tree/master/0001-two-sum) |

| [0004-median-of-two-sorted-arrays](https://github.com/ashirvad47/L.C.D/tree/master/0004-median-of-two-sorted-arrays) |

| [0011-container-with-most-water](https://github.com/ashirvad47/L.C.D/tree/master/0011-container-with-most-water) |

| [0015-3sum](https://github.com/ashirvad47/L.C.D/tree/master/0015-3sum) |

| [0026-remove-duplicates-from-sorted-array](https://github.com/ashirvad47/L.C.D/tree/master/0026-remove-duplicates-from-sorted-array) |

| [0027-remove-element](https://github.com/ashirvad47/L.C.D/tree/master/0027-remove-element) |

| [0035-search-insert-position](https://github.com/ashirvad47/L.C.D/tree/master/0035-search-insert-position) |

| [0036-valid-sudoku](https://github.com/ashirvad47/L.C.D/tree/master/0036-valid-sudoku) |

| [0042-trapping-rain-water](https://github.com/ashirvad47/L.C.D/tree/master/0042-trapping-rain-water) |

| [0045-jump-game-ii](https://github.com/ashirvad47/L.C.D/tree/master/0045-jump-game-ii) |

| [0046-permutations](https://github.com/ashirvad47/L.C.D/tree/master/0046-permutations) |

| [0048-rotate-image](https://github.com/ashirvad47/L.C.D/tree/master/0048-rotate-image) |

| [0049-group-anagrams](https://github.com/ashirvad47/L.C.D/tree/master/0049-group-anagrams) |

| [0051-n-queens](https://github.com/ashirvad47/L.C.D/tree/master/0051-n-queens) |

| [0053-maximum-subarray](https://github.com/ashirvad47/L.C.D/tree/master/0053-maximum-subarray) |

| [0054-spiral-matrix](https://github.com/ashirvad47/L.C.D/tree/master/0054-spiral-matrix) |

| [0055-jump-game](https://github.com/ashirvad47/L.C.D/tree/master/0055-jump-game) |

| [0056-merge-intervals](https://github.com/ashirvad47/L.C.D/tree/master/0056-merge-intervals) |

| [0057-insert-interval](https://github.com/ashirvad47/L.C.D/tree/master/0057-insert-interval) |

| [0066-plus-one](https://github.com/ashirvad47/L.C.D/tree/master/0066-plus-one) |

| [0073-set-matrix-zeroes](https://github.com/ashirvad47/L.C.D/tree/master/0073-set-matrix-zeroes) |

| [0074-search-a-2d-matrix](https://github.com/ashirvad47/L.C.D/tree/master/0074-search-a-2d-matrix) |

| [0075-sort-colors](https://github.com/ashirvad47/L.C.D/tree/master/0075-sort-colors) |

| [0078-subsets](https://github.com/ashirvad47/L.C.D/tree/master/0078-subsets) |

| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/ashirvad47/L.C.D/tree/master/0080-remove-duplicates-from-sorted-array-ii) |

| [0088-merge-sorted-array](https://github.com/ashirvad47/L.C.D/tree/master/0088-merge-sorted-array) |

| [0090-subsets-ii](https://github.com/ashirvad47/L.C.D/tree/master/0090-subsets-ii) |

| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |

| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |

| [0118-pascals-triangle](https://github.com/ashirvad47/L.C.D/tree/master/0118-pascals-triangle) |

| [0119-pascals-triangle-ii](https://github.com/ashirvad47/L.C.D/tree/master/0119-pascals-triangle-ii) |

| [0121-best-time-to-buy-and-sell-stock](https://github.com/ashirvad47/L.C.D/tree/master/0121-best-time-to-buy-and-sell-stock) |

| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/ashirvad47/L.C.D/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |

| [0128-longest-consecutive-sequence](https://github.com/ashirvad47/L.C.D/tree/master/0128-longest-consecutive-sequence) |

| [0130-surrounded-regions](https://github.com/ashirvad47/L.C.D/tree/master/0130-surrounded-regions) |

| [0134-gas-station](https://github.com/ashirvad47/L.C.D/tree/master/0134-gas-station) |

| [0135-candy](https://github.com/ashirvad47/L.C.D/tree/master/0135-candy) |

| [0139-word-break](https://github.com/ashirvad47/L.C.D/tree/master/0139-word-break) |

| [0150-evaluate-reverse-polish-notation](https://github.com/ashirvad47/L.C.D/tree/master/0150-evaluate-reverse-polish-notation) |

| [0167-two-sum-ii-input-array-is-sorted](https://github.com/ashirvad47/L.C.D/tree/master/0167-two-sum-ii-input-array-is-sorted) |

| [0169-majority-element](https://github.com/ashirvad47/L.C.D/tree/master/0169-majority-element) |

| [0189-rotate-array](https://github.com/ashirvad47/L.C.D/tree/master/0189-rotate-array) |

| [0198-house-robber](https://github.com/ashirvad47/L.C.D/tree/master/0198-house-robber) |

| [0200-number-of-islands](https://github.com/ashirvad47/L.C.D/tree/master/0200-number-of-islands) |

| [0209-minimum-size-subarray-sum](https://github.com/ashirvad47/L.C.D/tree/master/0209-minimum-size-subarray-sum) |

| [0217-contains-duplicate](https://github.com/ashirvad47/L.C.D/tree/master/0217-contains-duplicate) |

| [0219-contains-duplicate-ii](https://github.com/ashirvad47/L.C.D/tree/master/0219-contains-duplicate-ii) |

| [0228-summary-ranges](https://github.com/ashirvad47/L.C.D/tree/master/0228-summary-ranges) |

| [0238-product-of-array-except-self](https://github.com/ashirvad47/L.C.D/tree/master/0238-product-of-array-except-self) |

| [0274-h-index](https://github.com/ashirvad47/L.C.D/tree/master/0274-h-index) |

| [0283-move-zeroes](https://github.com/ashirvad47/L.C.D/tree/master/0283-move-zeroes) |

| [0287-find-the-duplicate-number](https://github.com/ashirvad47/L.C.D/tree/master/0287-find-the-duplicate-number) |

| [0289-game-of-life](https://github.com/ashirvad47/L.C.D/tree/master/0289-game-of-life) |

| [0300-longest-increasing-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0300-longest-increasing-subsequence) |

| [0322-coin-change](https://github.com/ashirvad47/L.C.D/tree/master/0322-coin-change) |

| [0347-top-k-frequent-elements](https://github.com/ashirvad47/L.C.D/tree/master/0347-top-k-frequent-elements) |

| [0368-largest-divisible-subset](https://github.com/ashirvad47/L.C.D/tree/master/0368-largest-divisible-subset) |

| [0377-combination-sum-iv](https://github.com/ashirvad47/L.C.D/tree/master/0377-combination-sum-iv) |

| [0380-insert-delete-getrandom-o1](https://github.com/ashirvad47/L.C.D/tree/master/0380-insert-delete-getrandom-o1) |

| [0399-evaluate-division](https://github.com/ashirvad47/L.C.D/tree/master/0399-evaluate-division) |

| [0407-trapping-rain-water-ii](https://github.com/ashirvad47/L.C.D/tree/master/0407-trapping-rain-water-ii) |

| [0416-partition-equal-subset-sum](https://github.com/ashirvad47/L.C.D/tree/master/0416-partition-equal-subset-sum) |

| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/ashirvad47/L.C.D/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |

| [0474-ones-and-zeroes](https://github.com/ashirvad47/L.C.D/tree/master/0474-ones-and-zeroes) |

| [0494-target-sum](https://github.com/ashirvad47/L.C.D/tree/master/0494-target-sum) |

| [0496-next-greater-element-i](https://github.com/ashirvad47/L.C.D/tree/master/0496-next-greater-element-i) |

| [0498-diagonal-traverse](https://github.com/ashirvad47/L.C.D/tree/master/0498-diagonal-traverse) |

| [0518-coin-change-ii](https://github.com/ashirvad47/L.C.D/tree/master/0518-coin-change-ii) |

| [0532-k-diff-pairs-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/0532-k-diff-pairs-in-an-array) |

| [0542-01-matrix](https://github.com/ashirvad47/L.C.D/tree/master/0542-01-matrix) |

| [0594-longest-harmonious-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0594-longest-harmonious-subsequence) |

| [0605-can-place-flowers](https://github.com/ashirvad47/L.C.D/tree/master/0605-can-place-flowers) |

| [0739-daily-temperatures](https://github.com/ashirvad47/L.C.D/tree/master/0739-daily-temperatures) |

| [0780-max-chunks-to-make-sorted](https://github.com/ashirvad47/L.C.D/tree/master/0780-max-chunks-to-make-sorted) |

| [0854-making-a-large-island](https://github.com/ashirvad47/L.C.D/tree/master/0854-making-a-large-island) |

| [0905-length-of-longest-fibonacci-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0905-length-of-longest-fibonacci-subsequence) |

| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |

| [0934-bitwise-ors-of-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/0934-bitwise-ors-of-subarrays) |

| [0940-fruit-into-baskets](https://github.com/ashirvad47/L.C.D/tree/master/0940-fruit-into-baskets) |

| [0945-snakes-and-ladders](https://github.com/ashirvad47/L.C.D/tree/master/0945-snakes-and-ladders) |

| [0952-word-subsets](https://github.com/ashirvad47/L.C.D/tree/master/0952-word-subsets) |

| [1036-rotting-oranges](https://github.com/ashirvad47/L.C.D/tree/master/1036-rotting-oranges) |

| [1049-minimum-domino-rotations-for-equal-row](https://github.com/ashirvad47/L.C.D/tree/master/1049-minimum-domino-rotations-for-equal-row) |

| [1105-uncrossed-lines](https://github.com/ashirvad47/L.C.D/tree/master/1105-uncrossed-lines) |

| [1127-last-stone-weight](https://github.com/ashirvad47/L.C.D/tree/master/1127-last-stone-weight) |

| [1130-last-stone-weight-ii](https://github.com/ashirvad47/L.C.D/tree/master/1130-last-stone-weight-ii) |

| [1227-number-of-equivalent-domino-pairs](https://github.com/ashirvad47/L.C.D/tree/master/1227-number-of-equivalent-domino-pairs) |

| [1293-three-consecutive-odds](https://github.com/ashirvad47/L.C.D/tree/master/1293-three-consecutive-odds) |

| [1335-maximum-candies-allocated-to-k-children](https://github.com/ashirvad47/L.C.D/tree/master/1335-maximum-candies-allocated-to-k-children) |

| [1350-remove-sub-folders-from-the-filesystem](https://github.com/ashirvad47/L.C.D/tree/master/1350-remove-sub-folders-from-the-filesystem) |

| [1364-tuple-with-same-product](https://github.com/ashirvad47/L.C.D/tree/master/1364-tuple-with-same-product) |

| [1393-maximum-value-of-k-coins-from-piles](https://github.com/ashirvad47/L.C.D/tree/master/1393-maximum-value-of-k-coins-from-piles) |

| [1396-count-servers-that-communicate](https://github.com/ashirvad47/L.C.D/tree/master/1396-count-servers-that-communicate) |

| [1402-count-square-submatrices-with-all-ones](https://github.com/ashirvad47/L.C.D/tree/master/1402-count-square-submatrices-with-all-ones) |

| [1421-find-numbers-with-even-number-of-digits](https://github.com/ashirvad47/L.C.D/tree/master/1421-find-numbers-with-even-number-of-digits) |

| [1468-check-if-n-and-its-double-exist](https://github.com/ashirvad47/L.C.D/tree/master/1468-check-if-n-and-its-double-exist) |

| [1477-product-of-the-last-k-numbers](https://github.com/ashirvad47/L.C.D/tree/master/1477-product-of-the-last-k-numbers) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [1524-string-matching-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/1524-string-matching-in-an-array) |

| [1528-kids-with-the-greatest-number-of-candies](https://github.com/ashirvad47/L.C.D/tree/master/1528-kids-with-the-greatest-number-of-candies) |

| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/ashirvad47/L.C.D/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |

| [1628-count-submatrices-with-all-ones](https://github.com/ashirvad47/L.C.D/tree/master/1628-count-submatrices-with-all-ones) |

| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/ashirvad47/L.C.D/tree/master/1631-number-of-sub-arrays-with-odd-sum) |

| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/ashirvad47/L.C.D/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |

| [1755-defuse-the-bomb](https://github.com/ashirvad47/L.C.D/tree/master/1755-defuse-the-bomb) |

| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/ashirvad47/L.C.D/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |

| [1813-maximum-erasure-value](https://github.com/ashirvad47/L.C.D/tree/master/1813-maximum-erasure-value) |

| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/ashirvad47/L.C.D/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |

| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/ashirvad47/L.C.D/tree/master/1849-maximum-absolute-sum-of-any-subarray) |

| [1876-map-of-highest-peak](https://github.com/ashirvad47/L.C.D/tree/master/1876-map-of-highest-peak) |

| [1878-check-if-array-is-sorted-and-rotated](https://github.com/ashirvad47/L.C.D/tree/master/1878-check-if-array-is-sorted-and-rotated) |

| [1886-minimum-limit-of-balls-in-a-bag](https://github.com/ashirvad47/L.C.D/tree/master/1886-minimum-limit-of-balls-in-a-bag) |

| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/ashirvad47/L.C.D/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |

| [1917-maximum-average-pass-ratio](https://github.com/ashirvad47/L.C.D/tree/master/1917-maximum-average-pass-ratio) |

| [1925-count-nice-pairs-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/1925-count-nice-pairs-in-an-array) |

| [1927-maximum-ascending-subarray-sum](https://github.com/ashirvad47/L.C.D/tree/master/1927-maximum-ascending-subarray-sum) |

| [1940-maximum-xor-for-each-query](https://github.com/ashirvad47/L.C.D/tree/master/1940-maximum-xor-for-each-query) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/ashirvad47/L.C.D/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2048-build-array-from-permutation](https://github.com/ashirvad47/L.C.D/tree/master/2048-build-array-from-permutation) |

| [2058-concatenation-of-array](https://github.com/ashirvad47/L.C.D/tree/master/2058-concatenation-of-array) |

| [2107-find-unique-binary-string](https://github.com/ashirvad47/L.C.D/tree/master/2107-find-unique-binary-string) |

| [2144-maximum-difference-between-increasing-elements](https://github.com/ashirvad47/L.C.D/tree/master/2144-maximum-difference-between-increasing-elements) |

| [2145-grid-game](https://github.com/ashirvad47/L.C.D/tree/master/2145-grid-game) |

| [2162-partition-array-into-two-arrays-to-minimize-sum-difference](https://github.com/ashirvad47/L.C.D/tree/master/2162-partition-array-into-two-arrays-to-minimize-sum-difference) |

| [2164-two-best-non-overlapping-events](https://github.com/ashirvad47/L.C.D/tree/master/2164-two-best-non-overlapping-events) |

| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/ashirvad47/L.C.D/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |

| [2179-most-beautiful-item-for-each-query](https://github.com/ashirvad47/L.C.D/tree/master/2179-most-beautiful-item-for-each-query) |

| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/ashirvad47/L.C.D/tree/master/2180-maximum-number-of-tasks-you-can-assign) |

| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/ashirvad47/L.C.D/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |

| [2204-find-subsequence-of-length-k-with-the-largest-sum](https://github.com/ashirvad47/L.C.D/tree/master/2204-find-subsequence-of-length-k-with-the-largest-sum) |

| [2215-finding-3-digit-even-numbers](https://github.com/ashirvad47/L.C.D/tree/master/2215-finding-3-digit-even-numbers) |

| [2232-adding-spaces-to-a-string](https://github.com/ashirvad47/L.C.D/tree/master/2232-adding-spaces-to-a-string) |

| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/ashirvad47/L.C.D/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |

| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/ashirvad47/L.C.D/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |

| [2262-solving-questions-with-brainpower](https://github.com/ashirvad47/L.C.D/tree/master/2262-solving-questions-with-brainpower) |

| [2265-partition-array-according-to-given-pivot](https://github.com/ashirvad47/L.C.D/tree/master/2265-partition-array-according-to-given-pivot) |

| [2267-minimum-difference-in-sums-after-removal-of-elements](https://github.com/ashirvad47/L.C.D/tree/master/2267-minimum-difference-in-sums-after-removal-of-elements) |

| [2292-counting-words-with-a-given-prefix](https://github.com/ashirvad47/L.C.D/tree/master/2292-counting-words-with-a-given-prefix) |

| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/ashirvad47/L.C.D/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |

| [2358-number-of-ways-to-split-array](https://github.com/ashirvad47/L.C.D/tree/master/2358-number-of-ways-to-split-array) |

| [2400-minimum-score-after-removals-on-a-tree](https://github.com/ashirvad47/L.C.D/tree/master/2400-minimum-score-after-removals-on-a-tree) |

| [2448-count-number-of-bad-pairs](https://github.com/ashirvad47/L.C.D/tree/master/2448-count-number-of-bad-pairs) |

| [2465-shifting-letters-ii](https://github.com/ashirvad47/L.C.D/tree/master/2465-shifting-letters-ii) |

| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/ashirvad47/L.C.D/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |

| [2479-meeting-rooms-iii](https://github.com/ashirvad47/L.C.D/tree/master/2479-meeting-rooms-iii) |

| [2497-maximum-matching-of-players-with-trainers](https://github.com/ashirvad47/L.C.D/tree/master/2497-maximum-matching-of-players-with-trainers) |

| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/ashirvad47/L.C.D/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |

| [2527-count-subarrays-with-fixed-bounds](https://github.com/ashirvad47/L.C.D/tree/master/2527-count-subarrays-with-fixed-bounds) |

| [2533-bitwise-xor-of-all-pairings](https://github.com/ashirvad47/L.C.D/tree/master/2533-bitwise-xor-of-all-pairings) |

| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/ashirvad47/L.C.D/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |

| [2551-apply-operations-to-an-array](https://github.com/ashirvad47/L.C.D/tree/master/2551-apply-operations-to-an-array) |

| [2554-minimum-total-distance-traveled](https://github.com/ashirvad47/L.C.D/tree/master/2554-minimum-total-distance-traveled) |

| [2564-most-profitable-path-in-a-tree](https://github.com/ashirvad47/L.C.D/tree/master/2564-most-profitable-path-in-a-tree) |

| [2586-longest-square-streak-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/2586-longest-square-streak-in-an-array) |

| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/ashirvad47/L.C.D/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/ashirvad47/L.C.D/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2681-put-marbles-in-bags](https://github.com/ashirvad47/L.C.D/tree/master/2681-put-marbles-in-bags) |

| [2685-first-completely-painted-row-or-column](https://github.com/ashirvad47/L.C.D/tree/master/2685-first-completely-painted-row-or-column) |

| [2689-rearranging-fruits](https://github.com/ashirvad47/L.C.D/tree/master/2689-rearranging-fruits) |

| [2691-count-vowel-strings-in-ranges](https://github.com/ashirvad47/L.C.D/tree/master/2691-count-vowel-strings-in-ranges) |

| [2692-take-gifts-from-the-richest-pile](https://github.com/ashirvad47/L.C.D/tree/master/2692-take-gifts-from-the-richest-pile) |

| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/ashirvad47/L.C.D/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |

| [2699-count-the-number-of-fair-pairs](https://github.com/ashirvad47/L.C.D/tree/master/2699-count-the-number-of-fair-pairs) |

| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/ashirvad47/L.C.D/tree/master/2707-merge-two-2d-arrays-by-summing-values) |

| [2716-prime-subtraction-operation](https://github.com/ashirvad47/L.C.D/tree/master/2716-prime-subtraction-operation) |

| [2720-minimize-the-maximum-difference-of-pairs](https://github.com/ashirvad47/L.C.D/tree/master/2720-minimize-the-maximum-difference-of-pairs) |

| [2764-maximum-number-of-fish-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/2764-maximum-number-of-fish-in-a-grid) |

| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/ashirvad47/L.C.D/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |

| [2792-neighboring-bitwise-xor](https://github.com/ashirvad47/L.C.D/tree/master/2792-neighboring-bitwise-xor) |

| [2794-maximum-number-of-moves-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/2794-maximum-number-of-moves-in-a-grid) |

| [2868-continuous-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/2868-continuous-subarrays) |

| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/ashirvad47/L.C.D/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |

| [2915-count-of-interesting-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/2915-count-of-interesting-subarrays) |

| [3142-longest-unequal-adjacent-groups-subsequence-ii](https://github.com/ashirvad47/L.C.D/tree/master/3142-longest-unequal-adjacent-groups-subsequence-ii) |

| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ashirvad47/L.C.D/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |

| [3152-maximum-value-of-an-ordered-triplet-ii](https://github.com/ashirvad47/L.C.D/tree/master/3152-maximum-value-of-an-ordered-triplet-ii) |

| [3154-maximum-value-of-an-ordered-triplet-i](https://github.com/ashirvad47/L.C.D/tree/master/3154-maximum-value-of-an-ordered-triplet-i) |

| [3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros](https://github.com/ashirvad47/L.C.D/tree/master/3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/ashirvad47/L.C.D/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

| [3194-find-words-containing-character](https://github.com/ashirvad47/L.C.D/tree/master/3194-find-words-containing-character) |

| [3213-count-subarrays-where-max-element-appears-at-least-k-times](https://github.com/ashirvad47/L.C.D/tree/master/3213-count-subarrays-where-max-element-appears-at-least-k-times) |

| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/ashirvad47/L.C.D/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |

| [3241-divide-array-into-arrays-with-max-difference](https://github.com/ashirvad47/L.C.D/tree/master/3241-divide-array-into-arrays-with-max-difference) |

| [3251-maximum-area-of-longest-diagonal-rectangle](https://github.com/ashirvad47/L.C.D/tree/master/3251-maximum-area-of-longest-diagonal-rectangle) |

| [3291-find-if-array-can-be-sorted](https://github.com/ashirvad47/L.C.D/tree/master/3291-find-if-array-can-be-sorted) |

| [3307-find-the-maximum-sum-of-node-values](https://github.com/ashirvad47/L.C.D/tree/master/3307-find-the-maximum-sum-of-node-values) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/ashirvad47/L.C.D/tree/master/3309-count-prefix-and-suffix-pairs-i) |

| [3321-type-of-triangle](https://github.com/ashirvad47/L.C.D/tree/master/3321-type-of-triangle) |

| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/ashirvad47/L.C.D/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |

| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/ashirvad47/L.C.D/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |

| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/ashirvad47/L.C.D/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |

| [3427-special-array-ii](https://github.com/ashirvad47/L.C.D/tree/master/3427-special-array-ii) |

| [3429-special-array-i](https://github.com/ashirvad47/L.C.D/tree/master/3429-special-array-i) |

| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/ashirvad47/L.C.D/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |

| [3459-find-the-minimum-area-to-cover-all-ones-ii](https://github.com/ashirvad47/L.C.D/tree/master/3459-find-the-minimum-area-to-cover-all-ones-ii) |

| [3461-find-the-minimum-area-to-cover-all-ones-i](https://github.com/ashirvad47/L.C.D/tree/master/3461-find-the-minimum-area-to-cover-all-ones-i) |

| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/ashirvad47/L.C.D/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |

| [3491-find-the-maximum-length-of-valid-subsequence-ii](https://github.com/ashirvad47/L.C.D/tree/master/3491-find-the-maximum-length-of-valid-subsequence-ii) |

| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/ashirvad47/L.C.D/tree/master/3522-find-the-power-of-k-size-subarrays-i) |

| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/ashirvad47/L.C.D/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |

| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/ashirvad47/L.C.D/tree/master/3627-find-minimum-time-to-reach-last-room-i) |

| [3628-find-minimum-time-to-reach-last-room-ii](https://github.com/ashirvad47/L.C.D/tree/master/3628-find-minimum-time-to-reach-last-room-ii) |

| [3639-zero-array-transformation-i](https://github.com/ashirvad47/L.C.D/tree/master/3639-zero-array-transformation-i) |

| [3643-zero-array-transformation-ii](https://github.com/ashirvad47/L.C.D/tree/master/3643-zero-array-transformation-ii) |

| [3647-zero-array-transformation-iii](https://github.com/ashirvad47/L.C.D/tree/master/3647-zero-array-transformation-iii) |

| [3648-find-the-maximum-number-of-fruits-collected](https://github.com/ashirvad47/L.C.D/tree/master/3648-find-the-maximum-number-of-fruits-collected) |

| [3656-minimum-number-of-operations-to-make-elements-in-array-distinct](https://github.com/ashirvad47/L.C.D/tree/master/3656-minimum-number-of-operations-to-make-elements-in-array-distinct) |

| [3733-length-of-longest-v-shaped-diagonal-segment](https://github.com/ashirvad47/L.C.D/tree/master/3733-length-of-longest-v-shaped-diagonal-segment) |

| [3741-reschedule-meetings-for-maximum-free-time-ii](https://github.com/ashirvad47/L.C.D/tree/master/3741-reschedule-meetings-for-maximum-free-time-ii) |

| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/ashirvad47/L.C.D/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |

| [3747-maximum-difference-between-adjacent-elements-in-a-circular-array](https://github.com/ashirvad47/L.C.D/tree/master/3747-maximum-difference-between-adjacent-elements-in-a-circular-array) |

| [3789-maximize-subarrays-after-removing-one-conflicting-pair](https://github.com/ashirvad47/L.C.D/tree/master/3789-maximize-subarrays-after-removing-one-conflicting-pair) |

| [3791-fruits-into-baskets-iii](https://github.com/ashirvad47/L.C.D/tree/master/3791-fruits-into-baskets-iii) |

## Backtracking

|  |

| ------- |

| [0022-generate-parentheses](https://github.com/ashirvad47/L.C.D/tree/master/0022-generate-parentheses) |

| [0046-permutations](https://github.com/ashirvad47/L.C.D/tree/master/0046-permutations) |

| [0051-n-queens](https://github.com/ashirvad47/L.C.D/tree/master/0051-n-queens) |

| [0052-n-queens-ii](https://github.com/ashirvad47/L.C.D/tree/master/0052-n-queens-ii) |

| [0078-subsets](https://github.com/ashirvad47/L.C.D/tree/master/0078-subsets) |

| [0090-subsets-ii](https://github.com/ashirvad47/L.C.D/tree/master/0090-subsets-ii) |

| [0494-target-sum](https://github.com/ashirvad47/L.C.D/tree/master/0494-target-sum) |

| [1160-letter-tile-possibilities](https://github.com/ashirvad47/L.C.D/tree/master/1160-letter-tile-possibilities) |

| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/ashirvad47/L.C.D/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |

| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/ashirvad47/L.C.D/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |

| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/ashirvad47/L.C.D/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |

| [1976-splitting-a-string-into-descending-consecutive-values](https://github.com/ashirvad47/L.C.D/tree/master/1976-splitting-a-string-into-descending-consecutive-values) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/ashirvad47/L.C.D/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2107-find-unique-binary-string](https://github.com/ashirvad47/L.C.D/tree/master/2107-find-unique-binary-string) |

| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/ashirvad47/L.C.D/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |

| [2456-construct-smallest-number-from-di-string](https://github.com/ashirvad47/L.C.D/tree/master/2456-construct-smallest-number-from-di-string) |

| [2802-find-the-punishment-number-of-an-integer](https://github.com/ashirvad47/L.C.D/tree/master/2802-find-the-punishment-number-of-an-integer) |

## Database

|  |

| ------- |

| [0176-second-highest-salary](https://github.com/ashirvad47/L.C.D/tree/master/0176-second-highest-salary) |

| [0180-consecutive-numbers](https://github.com/ashirvad47/L.C.D/tree/master/0180-consecutive-numbers) |

| [0185-department-top-three-salaries](https://github.com/ashirvad47/L.C.D/tree/master/0185-department-top-three-salaries) |

| [0196-delete-duplicate-emails](https://github.com/ashirvad47/L.C.D/tree/master/0196-delete-duplicate-emails) |

| [0197-rising-temperature](https://github.com/ashirvad47/L.C.D/tree/master/0197-rising-temperature) |

| [0570-managers-with-at-least-5-direct-reports](https://github.com/ashirvad47/L.C.D/tree/master/0570-managers-with-at-least-5-direct-reports) |

| [0577-employee-bonus](https://github.com/ashirvad47/L.C.D/tree/master/0577-employee-bonus) |

| [0584-find-customer-referee](https://github.com/ashirvad47/L.C.D/tree/master/0584-find-customer-referee) |

| [0585-investments-in-2016](https://github.com/ashirvad47/L.C.D/tree/master/0585-investments-in-2016) |

| [0595-big-countries](https://github.com/ashirvad47/L.C.D/tree/master/0595-big-countries) |

| [0596-classes-more-than-5-students](https://github.com/ashirvad47/L.C.D/tree/master/0596-classes-more-than-5-students) |

| [0602-friend-requests-ii-who-has-the-most-friends](https://github.com/ashirvad47/L.C.D/tree/master/0602-friend-requests-ii-who-has-the-most-friends) |

| [0610-triangle-judgement](https://github.com/ashirvad47/L.C.D/tree/master/0610-triangle-judgement) |

| [0619-biggest-single-number](https://github.com/ashirvad47/L.C.D/tree/master/0619-biggest-single-number) |

| [0620-not-boring-movies](https://github.com/ashirvad47/L.C.D/tree/master/0620-not-boring-movies) |

| [0626-exchange-seats](https://github.com/ashirvad47/L.C.D/tree/master/0626-exchange-seats) |

| [1135-customers-who-bought-all-products](https://github.com/ashirvad47/L.C.D/tree/master/1135-customers-who-bought-all-products) |

| [1153-product-sales-analysis-i](https://github.com/ashirvad47/L.C.D/tree/master/1153-product-sales-analysis-i) |

| [1155-product-sales-analysis-iii](https://github.com/ashirvad47/L.C.D/tree/master/1155-product-sales-analysis-iii) |

| [1161-project-employees-i](https://github.com/ashirvad47/L.C.D/tree/master/1161-project-employees-i) |

| [1182-game-play-analysis-iv](https://github.com/ashirvad47/L.C.D/tree/master/1182-game-play-analysis-iv) |

| [1245-user-activity-for-the-past-30-days-i](https://github.com/ashirvad47/L.C.D/tree/master/1245-user-activity-for-the-past-30-days-i) |

| [1258-article-views-i](https://github.com/ashirvad47/L.C.D/tree/master/1258-article-views-i) |

| [1278-product-price-at-a-given-date](https://github.com/ashirvad47/L.C.D/tree/master/1278-product-price-at-a-given-date) |

| [1292-immediate-food-delivery-ii](https://github.com/ashirvad47/L.C.D/tree/master/1292-immediate-food-delivery-ii) |

| [1317-monthly-transactions-i](https://github.com/ashirvad47/L.C.D/tree/master/1317-monthly-transactions-i) |

| [1327-last-person-to-fit-in-the-bus](https://github.com/ashirvad47/L.C.D/tree/master/1327-last-person-to-fit-in-the-bus) |

| [1338-queries-quality-and-percentage](https://github.com/ashirvad47/L.C.D/tree/master/1338-queries-quality-and-percentage) |

| [1390-average-selling-price](https://github.com/ashirvad47/L.C.D/tree/master/1390-average-selling-price) |

| [1415-students-and-examinations](https://github.com/ashirvad47/L.C.D/tree/master/1415-students-and-examinations) |

| [1452-restaurant-growth](https://github.com/ashirvad47/L.C.D/tree/master/1452-restaurant-growth) |

| [1462-list-the-products-ordered-in-a-period](https://github.com/ashirvad47/L.C.D/tree/master/1462-list-the-products-ordered-in-a-period) |

| [1480-movie-rating](https://github.com/ashirvad47/L.C.D/tree/master/1480-movie-rating) |

| [1509-replace-employee-id-with-the-unique-identifier](https://github.com/ashirvad47/L.C.D/tree/master/1509-replace-employee-id-with-the-unique-identifier) |

| [1625-group-sold-products-by-the-date](https://github.com/ashirvad47/L.C.D/tree/master/1625-group-sold-products-by-the-date) |

| [1664-find-users-with-valid-e-mails](https://github.com/ashirvad47/L.C.D/tree/master/1664-find-users-with-valid-e-mails) |

| [1670-patients-with-a-condition](https://github.com/ashirvad47/L.C.D/tree/master/1670-patients-with-a-condition) |

| [1724-customer-who-visited-but-did-not-make-any-transactions](https://github.com/ashirvad47/L.C.D/tree/master/1724-customer-who-visited-but-did-not-make-any-transactions) |

| [1773-percentage-of-users-attended-a-contest](https://github.com/ashirvad47/L.C.D/tree/master/1773-percentage-of-users-attended-a-contest) |

| [1801-average-time-of-process-per-machine](https://github.com/ashirvad47/L.C.D/tree/master/1801-average-time-of-process-per-machine) |

| [1811-fix-names-in-a-table](https://github.com/ashirvad47/L.C.D/tree/master/1811-fix-names-in-a-table) |

| [1827-invalid-tweets](https://github.com/ashirvad47/L.C.D/tree/master/1827-invalid-tweets) |

| [1877-find-followers-count](https://github.com/ashirvad47/L.C.D/tree/master/1877-find-followers-count) |

| [1882-the-number-of-employees-which-report-to-each-employee](https://github.com/ashirvad47/L.C.D/tree/master/1882-the-number-of-employees-which-report-to-each-employee) |

| [1908-recyclable-and-low-fat-products](https://github.com/ashirvad47/L.C.D/tree/master/1908-recyclable-and-low-fat-products) |

| [1942-primary-department-for-each-employee](https://github.com/ashirvad47/L.C.D/tree/master/1942-primary-department-for-each-employee) |

| [2057-count-salary-categories](https://github.com/ashirvad47/L.C.D/tree/master/2057-count-salary-categories) |

| [2087-confirmation-rate](https://github.com/ashirvad47/L.C.D/tree/master/2087-confirmation-rate) |

| [2127-employees-whose-manager-left-the-company](https://github.com/ashirvad47/L.C.D/tree/master/2127-employees-whose-manager-left-the-company) |

| [2495-number-of-unique-subjects-taught-by-each-teacher](https://github.com/ashirvad47/L.C.D/tree/master/2495-number-of-unique-subjects-taught-by-each-teacher) |

## Hash Table

|  |

| ------- |

| [0001-two-sum](https://github.com/ashirvad47/L.C.D/tree/master/0001-two-sum) |

| [0003-longest-substring-without-repeating-characters](https://github.com/ashirvad47/L.C.D/tree/master/0003-longest-substring-without-repeating-characters) |

| [0012-integer-to-roman](https://github.com/ashirvad47/L.C.D/tree/master/0012-integer-to-roman) |

| [0013-roman-to-integer](https://github.com/ashirvad47/L.C.D/tree/master/0013-roman-to-integer) |

| [0036-valid-sudoku](https://github.com/ashirvad47/L.C.D/tree/master/0036-valid-sudoku) |

| [0049-group-anagrams](https://github.com/ashirvad47/L.C.D/tree/master/0049-group-anagrams) |

| [0073-set-matrix-zeroes](https://github.com/ashirvad47/L.C.D/tree/master/0073-set-matrix-zeroes) |

| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |

| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |

| [0128-longest-consecutive-sequence](https://github.com/ashirvad47/L.C.D/tree/master/0128-longest-consecutive-sequence) |

| [0133-clone-graph](https://github.com/ashirvad47/L.C.D/tree/master/0133-clone-graph) |

| [0138-copy-list-with-random-pointer](https://github.com/ashirvad47/L.C.D/tree/master/0138-copy-list-with-random-pointer) |

| [0139-word-break](https://github.com/ashirvad47/L.C.D/tree/master/0139-word-break) |

| [0141-linked-list-cycle](https://github.com/ashirvad47/L.C.D/tree/master/0141-linked-list-cycle) |

| [0169-majority-element](https://github.com/ashirvad47/L.C.D/tree/master/0169-majority-element) |

| [0202-happy-number](https://github.com/ashirvad47/L.C.D/tree/master/0202-happy-number) |

| [0205-isomorphic-strings](https://github.com/ashirvad47/L.C.D/tree/master/0205-isomorphic-strings) |

| [0208-implement-trie-prefix-tree](https://github.com/ashirvad47/L.C.D/tree/master/0208-implement-trie-prefix-tree) |

| [0217-contains-duplicate](https://github.com/ashirvad47/L.C.D/tree/master/0217-contains-duplicate) |

| [0219-contains-duplicate-ii](https://github.com/ashirvad47/L.C.D/tree/master/0219-contains-duplicate-ii) |

| [0242-valid-anagram](https://github.com/ashirvad47/L.C.D/tree/master/0242-valid-anagram) |

| [0290-word-pattern](https://github.com/ashirvad47/L.C.D/tree/master/0290-word-pattern) |

| [0347-top-k-frequent-elements](https://github.com/ashirvad47/L.C.D/tree/master/0347-top-k-frequent-elements) |

| [0380-insert-delete-getrandom-o1](https://github.com/ashirvad47/L.C.D/tree/master/0380-insert-delete-getrandom-o1) |

| [0383-ransom-note](https://github.com/ashirvad47/L.C.D/tree/master/0383-ransom-note) |

| [0496-next-greater-element-i](https://github.com/ashirvad47/L.C.D/tree/master/0496-next-greater-element-i) |

| [0532-k-diff-pairs-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/0532-k-diff-pairs-in-an-array) |

| [0567-permutation-in-string](https://github.com/ashirvad47/L.C.D/tree/master/0567-permutation-in-string) |

| [0594-longest-harmonious-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0594-longest-harmonious-subsequence) |

| [0692-top-k-frequent-words](https://github.com/ashirvad47/L.C.D/tree/master/0692-top-k-frequent-words) |

| [0896-smallest-subtree-with-all-the-deepest-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0896-smallest-subtree-with-all-the-deepest-nodes) |

| [0900-reordered-power-of-2](https://github.com/ashirvad47/L.C.D/tree/master/0900-reordered-power-of-2) |

| [0905-length-of-longest-fibonacci-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0905-length-of-longest-fibonacci-subsequence) |

| [0920-uncommon-words-from-two-sentences](https://github.com/ashirvad47/L.C.D/tree/master/0920-uncommon-words-from-two-sentences) |

| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |

| [0940-fruit-into-baskets](https://github.com/ashirvad47/L.C.D/tree/master/0940-fruit-into-baskets) |

| [0952-word-subsets](https://github.com/ashirvad47/L.C.D/tree/master/0952-word-subsets) |

| [1160-letter-tile-possibilities](https://github.com/ashirvad47/L.C.D/tree/master/1160-letter-tile-possibilities) |

| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/ashirvad47/L.C.D/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |

| [1227-number-of-equivalent-domino-pairs](https://github.com/ashirvad47/L.C.D/tree/master/1227-number-of-equivalent-domino-pairs) |

| [1364-tuple-with-same-product](https://github.com/ashirvad47/L.C.D/tree/master/1364-tuple-with-same-product) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [1468-check-if-n-and-its-double-exist](https://github.com/ashirvad47/L.C.D/tree/master/1468-check-if-n-and-its-double-exist) |

| [1502-construct-k-palindrome-strings](https://github.com/ashirvad47/L.C.D/tree/master/1502-construct-k-palindrome-strings) |

| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/ashirvad47/L.C.D/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |

| [1813-maximum-erasure-value](https://github.com/ashirvad47/L.C.D/tree/master/1813-maximum-erasure-value) |

| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/ashirvad47/L.C.D/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |

| [1925-count-nice-pairs-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/1925-count-nice-pairs-in-an-array) |

| [2059-unique-length-3-palindromic-subsequences](https://github.com/ashirvad47/L.C.D/tree/master/2059-unique-length-3-palindromic-subsequences) |

| [2107-find-unique-binary-string](https://github.com/ashirvad47/L.C.D/tree/master/2107-find-unique-binary-string) |

| [2204-find-subsequence-of-length-k-with-the-largest-sum](https://github.com/ashirvad47/L.C.D/tree/master/2204-find-subsequence-of-length-k-with-the-largest-sum) |

| [2215-finding-3-digit-even-numbers](https://github.com/ashirvad47/L.C.D/tree/master/2215-finding-3-digit-even-numbers) |

| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/ashirvad47/L.C.D/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |

| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/ashirvad47/L.C.D/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |

| [2300-construct-string-with-repeat-limit](https://github.com/ashirvad47/L.C.D/tree/master/2300-construct-string-with-repeat-limit) |

| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/ashirvad47/L.C.D/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |

| [2434-design-a-number-container-system](https://github.com/ashirvad47/L.C.D/tree/master/2434-design-a-number-container-system) |

| [2448-count-number-of-bad-pairs](https://github.com/ashirvad47/L.C.D/tree/master/2448-count-number-of-bad-pairs) |

| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/ashirvad47/L.C.D/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |

| [2479-meeting-rooms-iii](https://github.com/ashirvad47/L.C.D/tree/master/2479-meeting-rooms-iii) |

| [2586-longest-square-streak-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/2586-longest-square-streak-in-an-array) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/ashirvad47/L.C.D/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2677-cousins-in-binary-tree-ii](https://github.com/ashirvad47/L.C.D/tree/master/2677-cousins-in-binary-tree-ii) |

| [2685-first-completely-painted-row-or-column](https://github.com/ashirvad47/L.C.D/tree/master/2685-first-completely-painted-row-or-column) |

| [2689-rearranging-fruits](https://github.com/ashirvad47/L.C.D/tree/master/2689-rearranging-fruits) |

| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/ashirvad47/L.C.D/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |

| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/ashirvad47/L.C.D/tree/master/2707-merge-two-2d-arrays-by-summing-values) |

| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/ashirvad47/L.C.D/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |

| [2915-count-of-interesting-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/2915-count-of-interesting-subarrays) |

| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/ashirvad47/L.C.D/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |

| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/ashirvad47/L.C.D/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |

| [3455-minimum-length-of-string-after-operations](https://github.com/ashirvad47/L.C.D/tree/master/3455-minimum-length-of-string-after-operations) |

| [3629-total-characters-in-string-after-transformations-i](https://github.com/ashirvad47/L.C.D/tree/master/3629-total-characters-in-string-after-transformations-i) |

| [3630-total-characters-in-string-after-transformations-ii](https://github.com/ashirvad47/L.C.D/tree/master/3630-total-characters-in-string-after-transformations-ii) |

| [3656-minimum-number-of-operations-to-make-elements-in-array-distinct](https://github.com/ashirvad47/L.C.D/tree/master/3656-minimum-number-of-operations-to-make-elements-in-array-distinct) |

| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/ashirvad47/L.C.D/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |

## String

|  |

| ------- |

| [0003-longest-substring-without-repeating-characters](https://github.com/ashirvad47/L.C.D/tree/master/0003-longest-substring-without-repeating-characters) |

| [0005-longest-palindromic-substring](https://github.com/ashirvad47/L.C.D/tree/master/0005-longest-palindromic-substring) |

| [0006-zigzag-conversion](https://github.com/ashirvad47/L.C.D/tree/master/0006-zigzag-conversion) |

| [0012-integer-to-roman](https://github.com/ashirvad47/L.C.D/tree/master/0012-integer-to-roman) |

| [0013-roman-to-integer](https://github.com/ashirvad47/L.C.D/tree/master/0013-roman-to-integer) |

| [0014-longest-common-prefix](https://github.com/ashirvad47/L.C.D/tree/master/0014-longest-common-prefix) |

| [0020-valid-parentheses](https://github.com/ashirvad47/L.C.D/tree/master/0020-valid-parentheses) |

| [0022-generate-parentheses](https://github.com/ashirvad47/L.C.D/tree/master/0022-generate-parentheses) |

| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/ashirvad47/L.C.D/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |

| [0049-group-anagrams](https://github.com/ashirvad47/L.C.D/tree/master/0049-group-anagrams) |

| [0058-length-of-last-word](https://github.com/ashirvad47/L.C.D/tree/master/0058-length-of-last-word) |

| [0067-add-binary](https://github.com/ashirvad47/L.C.D/tree/master/0067-add-binary) |

| [0071-simplify-path](https://github.com/ashirvad47/L.C.D/tree/master/0071-simplify-path) |

| [0072-edit-distance](https://github.com/ashirvad47/L.C.D/tree/master/0072-edit-distance) |

| [0115-distinct-subsequences](https://github.com/ashirvad47/L.C.D/tree/master/0115-distinct-subsequences) |

| [0125-valid-palindrome](https://github.com/ashirvad47/L.C.D/tree/master/0125-valid-palindrome) |

| [0139-word-break](https://github.com/ashirvad47/L.C.D/tree/master/0139-word-break) |

| [0151-reverse-words-in-a-string](https://github.com/ashirvad47/L.C.D/tree/master/0151-reverse-words-in-a-string) |

| [0205-isomorphic-strings](https://github.com/ashirvad47/L.C.D/tree/master/0205-isomorphic-strings) |

| [0208-implement-trie-prefix-tree](https://github.com/ashirvad47/L.C.D/tree/master/0208-implement-trie-prefix-tree) |

| [0211-design-add-and-search-words-data-structure](https://github.com/ashirvad47/L.C.D/tree/master/0211-design-add-and-search-words-data-structure) |

| [0224-basic-calculator](https://github.com/ashirvad47/L.C.D/tree/master/0224-basic-calculator) |

| [0242-valid-anagram](https://github.com/ashirvad47/L.C.D/tree/master/0242-valid-anagram) |

| [0290-word-pattern](https://github.com/ashirvad47/L.C.D/tree/master/0290-word-pattern) |

| [0345-reverse-vowels-of-a-string](https://github.com/ashirvad47/L.C.D/tree/master/0345-reverse-vowels-of-a-string) |

| [0383-ransom-note](https://github.com/ashirvad47/L.C.D/tree/master/0383-ransom-note) |

| [0392-is-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0392-is-subsequence) |

| [0399-evaluate-division](https://github.com/ashirvad47/L.C.D/tree/master/0399-evaluate-division) |

| [0474-ones-and-zeroes](https://github.com/ashirvad47/L.C.D/tree/master/0474-ones-and-zeroes) |

| [0516-longest-palindromic-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0516-longest-palindromic-subsequence) |

| [0567-permutation-in-string](https://github.com/ashirvad47/L.C.D/tree/master/0567-permutation-in-string) |

| [0583-delete-operation-for-two-strings](https://github.com/ashirvad47/L.C.D/tree/master/0583-delete-operation-for-two-strings) |

| [0647-palindromic-substrings](https://github.com/ashirvad47/L.C.D/tree/master/0647-palindromic-substrings) |

| [0692-top-k-frequent-words](https://github.com/ashirvad47/L.C.D/tree/master/0692-top-k-frequent-words) |

| [0712-minimum-ascii-delete-sum-for-two-strings](https://github.com/ashirvad47/L.C.D/tree/master/0712-minimum-ascii-delete-sum-for-two-strings) |

| [0812-rotate-string](https://github.com/ashirvad47/L.C.D/tree/master/0812-rotate-string) |

| [0920-uncommon-words-from-two-sentences](https://github.com/ashirvad47/L.C.D/tree/master/0920-uncommon-words-from-two-sentences) |

| [0952-word-subsets](https://github.com/ashirvad47/L.C.D/tree/master/0952-word-subsets) |

| [1058-lexicographically-smallest-equivalent-string](https://github.com/ashirvad47/L.C.D/tree/master/1058-lexicographically-smallest-equivalent-string) |

| [1093-recover-a-tree-from-preorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/1093-recover-a-tree-from-preorder-traversal) |

| [1146-greatest-common-divisor-of-strings](https://github.com/ashirvad47/L.C.D/tree/master/1146-greatest-common-divisor-of-strings) |

| [1160-letter-tile-possibilities](https://github.com/ashirvad47/L.C.D/tree/master/1160-letter-tile-possibilities) |

| [1170-shortest-common-supersequence](https://github.com/ashirvad47/L.C.D/tree/master/1170-shortest-common-supersequence) |

| [1197-parsing-a-boolean-expression](https://github.com/ashirvad47/L.C.D/tree/master/1197-parsing-a-boolean-expression) |

| [1250-longest-common-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/1250-longest-common-subsequence) |

| [1302-delete-characters-to-make-fancy-string](https://github.com/ashirvad47/L.C.D/tree/master/1302-delete-characters-to-make-fancy-string) |

| [1304-longest-happy-string](https://github.com/ashirvad47/L.C.D/tree/master/1304-longest-happy-string) |

| [1350-remove-sub-folders-from-the-filesystem](https://github.com/ashirvad47/L.C.D/tree/master/1350-remove-sub-folders-from-the-filesystem) |

| [1437-minimum-insertion-steps-to-make-a-string-palindrome](https://github.com/ashirvad47/L.C.D/tree/master/1437-minimum-insertion-steps-to-make-a-string-palindrome) |

| [1502-construct-k-palindrome-strings](https://github.com/ashirvad47/L.C.D/tree/master/1502-construct-k-palindrome-strings) |

| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/ashirvad47/L.C.D/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |

| [1524-string-matching-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/1524-string-matching-in-an-array) |

| [1537-maximum-score-after-splitting-a-string](https://github.com/ashirvad47/L.C.D/tree/master/1537-maximum-score-after-splitting-a-string) |

| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/ashirvad47/L.C.D/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |

| [1667-find-kth-bit-in-nth-binary-string](https://github.com/ashirvad47/L.C.D/tree/master/1667-find-kth-bit-in-nth-binary-string) |

| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/ashirvad47/L.C.D/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |

| [1818-maximum-score-from-removing-substrings](https://github.com/ashirvad47/L.C.D/tree/master/1818-maximum-score-from-removing-substrings) |

| [1894-merge-strings-alternately](https://github.com/ashirvad47/L.C.D/tree/master/1894-merge-strings-alternately) |

| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/ashirvad47/L.C.D/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/ashirvad47/L.C.D/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |

| [1976-splitting-a-string-into-descending-consecutive-values](https://github.com/ashirvad47/L.C.D/tree/master/1976-splitting-a-string-into-descending-consecutive-values) |

| [2021-remove-all-occurrences-of-a-substring](https://github.com/ashirvad47/L.C.D/tree/master/2021-remove-all-occurrences-of-a-substring) |

| [2059-unique-length-3-palindromic-subsequences](https://github.com/ashirvad47/L.C.D/tree/master/2059-unique-length-3-palindromic-subsequences) |

| [2107-find-unique-binary-string](https://github.com/ashirvad47/L.C.D/tree/master/2107-find-unique-binary-string) |

| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/ashirvad47/L.C.D/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |

| [2232-adding-spaces-to-a-string](https://github.com/ashirvad47/L.C.D/tree/master/2232-adding-spaces-to-a-string) |

| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/ashirvad47/L.C.D/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |

| [2292-counting-words-with-a-given-prefix](https://github.com/ashirvad47/L.C.D/tree/master/2292-counting-words-with-a-given-prefix) |

| [2300-construct-string-with-repeat-limit](https://github.com/ashirvad47/L.C.D/tree/master/2300-construct-string-with-repeat-limit) |

| [2346-largest-3-same-digit-number-in-string](https://github.com/ashirvad47/L.C.D/tree/master/2346-largest-3-same-digit-number-in-string) |

| [2414-move-pieces-to-obtain-a-string](https://github.com/ashirvad47/L.C.D/tree/master/2414-move-pieces-to-obtain-a-string) |

| [2456-construct-smallest-number-from-di-string](https://github.com/ashirvad47/L.C.D/tree/master/2456-construct-smallest-number-from-di-string) |

| [2465-shifting-letters-ii](https://github.com/ashirvad47/L.C.D/tree/master/2465-shifting-letters-ii) |

| [2580-circular-sentence](https://github.com/ashirvad47/L.C.D/tree/master/2580-circular-sentence) |

| [2691-count-vowel-strings-in-ranges](https://github.com/ashirvad47/L.C.D/tree/master/2691-count-vowel-strings-in-ranges) |

| [2757-count-of-integers](https://github.com/ashirvad47/L.C.D/tree/master/2757-count-of-integers) |

| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/ashirvad47/L.C.D/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |

| [3142-longest-unequal-adjacent-groups-subsequence-ii](https://github.com/ashirvad47/L.C.D/tree/master/3142-longest-unequal-adjacent-groups-subsequence-ii) |

| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ashirvad47/L.C.D/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |

| [3174-minimum-number-of-changes-to-make-binary-string-beautiful](https://github.com/ashirvad47/L.C.D/tree/master/3174-minimum-number-of-changes-to-make-binary-string-beautiful) |

| [3194-find-words-containing-character](https://github.com/ashirvad47/L.C.D/tree/master/3194-find-words-containing-character) |

| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/ashirvad47/L.C.D/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/ashirvad47/L.C.D/tree/master/3309-count-prefix-and-suffix-pairs-i) |

| [3379-score-of-a-string](https://github.com/ashirvad47/L.C.D/tree/master/3379-score-of-a-string) |

| [3396-valid-word](https://github.com/ashirvad47/L.C.D/tree/master/3396-valid-word) |

| [3447-clear-digits](https://github.com/ashirvad47/L.C.D/tree/master/3447-clear-digits) |

| [3451-string-compression-iii](https://github.com/ashirvad47/L.C.D/tree/master/3451-string-compression-iii) |

| [3455-minimum-length-of-string-after-operations](https://github.com/ashirvad47/L.C.D/tree/master/3455-minimum-length-of-string-after-operations) |

| [3617-find-the-original-typed-string-i](https://github.com/ashirvad47/L.C.D/tree/master/3617-find-the-original-typed-string-i) |

| [3618-find-the-original-typed-string-ii](https://github.com/ashirvad47/L.C.D/tree/master/3618-find-the-original-typed-string-ii) |

| [3629-total-characters-in-string-after-transformations-i](https://github.com/ashirvad47/L.C.D/tree/master/3629-total-characters-in-string-after-transformations-i) |

| [3630-total-characters-in-string-after-transformations-ii](https://github.com/ashirvad47/L.C.D/tree/master/3630-total-characters-in-string-after-transformations-ii) |

| [3637-count-number-of-balanced-permutations](https://github.com/ashirvad47/L.C.D/tree/master/3637-count-number-of-balanced-permutations) |

| [3683-find-the-lexicographically-largest-string-from-the-box-i](https://github.com/ashirvad47/L.C.D/tree/master/3683-find-the-lexicographically-largest-string-from-the-box-i) |

| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/ashirvad47/L.C.D/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |

| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/ashirvad47/L.C.D/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |

## Counting

|  |

| ------- |

| [0169-majority-element](https://github.com/ashirvad47/L.C.D/tree/master/0169-majority-element) |

| [0347-top-k-frequent-elements](https://github.com/ashirvad47/L.C.D/tree/master/0347-top-k-frequent-elements) |

| [0383-ransom-note](https://github.com/ashirvad47/L.C.D/tree/master/0383-ransom-note) |

| [0594-longest-harmonious-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0594-longest-harmonious-subsequence) |

| [0692-top-k-frequent-words](https://github.com/ashirvad47/L.C.D/tree/master/0692-top-k-frequent-words) |

| [0900-reordered-power-of-2](https://github.com/ashirvad47/L.C.D/tree/master/0900-reordered-power-of-2) |

| [0920-uncommon-words-from-two-sentences](https://github.com/ashirvad47/L.C.D/tree/master/0920-uncommon-words-from-two-sentences) |

| [1160-letter-tile-possibilities](https://github.com/ashirvad47/L.C.D/tree/master/1160-letter-tile-possibilities) |

| [1227-number-of-equivalent-domino-pairs](https://github.com/ashirvad47/L.C.D/tree/master/1227-number-of-equivalent-domino-pairs) |

| [1364-tuple-with-same-product](https://github.com/ashirvad47/L.C.D/tree/master/1364-tuple-with-same-product) |

| [1396-count-servers-that-communicate](https://github.com/ashirvad47/L.C.D/tree/master/1396-count-servers-that-communicate) |

| [1502-construct-k-palindrome-strings](https://github.com/ashirvad47/L.C.D/tree/master/1502-construct-k-palindrome-strings) |

| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/ashirvad47/L.C.D/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |

| [1925-count-nice-pairs-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/1925-count-nice-pairs-in-an-array) |

| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/ashirvad47/L.C.D/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |

| [2300-construct-string-with-repeat-limit](https://github.com/ashirvad47/L.C.D/tree/master/2300-construct-string-with-repeat-limit) |

| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/ashirvad47/L.C.D/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |

| [2448-count-number-of-bad-pairs](https://github.com/ashirvad47/L.C.D/tree/master/2448-count-number-of-bad-pairs) |

| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/ashirvad47/L.C.D/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |

| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/ashirvad47/L.C.D/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |

| [3455-minimum-length-of-string-after-operations](https://github.com/ashirvad47/L.C.D/tree/master/3455-minimum-length-of-string-after-operations) |

| [3629-total-characters-in-string-after-transformations-i](https://github.com/ashirvad47/L.C.D/tree/master/3629-total-characters-in-string-after-transformations-i) |

| [3630-total-characters-in-string-after-transformations-ii](https://github.com/ashirvad47/L.C.D/tree/master/3630-total-characters-in-string-after-transformations-ii) |

| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/ashirvad47/L.C.D/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |

## Two Pointers

|  |

| ------- |

| [0005-longest-palindromic-substring](https://github.com/ashirvad47/L.C.D/tree/master/0005-longest-palindromic-substring) |

| [0011-container-with-most-water](https://github.com/ashirvad47/L.C.D/tree/master/0011-container-with-most-water) |

| [0015-3sum](https://github.com/ashirvad47/L.C.D/tree/master/0015-3sum) |

| [0019-remove-nth-node-from-end-of-list](https://github.com/ashirvad47/L.C.D/tree/master/0019-remove-nth-node-from-end-of-list) |

| [0026-remove-duplicates-from-sorted-array](https://github.com/ashirvad47/L.C.D/tree/master/0026-remove-duplicates-from-sorted-array) |

| [0027-remove-element](https://github.com/ashirvad47/L.C.D/tree/master/0027-remove-element) |

| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/ashirvad47/L.C.D/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |

| [0042-trapping-rain-water](https://github.com/ashirvad47/L.C.D/tree/master/0042-trapping-rain-water) |

| [0061-rotate-list](https://github.com/ashirvad47/L.C.D/tree/master/0061-rotate-list) |

| [0075-sort-colors](https://github.com/ashirvad47/L.C.D/tree/master/0075-sort-colors) |

| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/ashirvad47/L.C.D/tree/master/0080-remove-duplicates-from-sorted-array-ii) |

| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/ashirvad47/L.C.D/tree/master/0082-remove-duplicates-from-sorted-list-ii) |

| [0086-partition-list](https://github.com/ashirvad47/L.C.D/tree/master/0086-partition-list) |

| [0088-merge-sorted-array](https://github.com/ashirvad47/L.C.D/tree/master/0088-merge-sorted-array) |

| [0125-valid-palindrome](https://github.com/ashirvad47/L.C.D/tree/master/0125-valid-palindrome) |

| [0141-linked-list-cycle](https://github.com/ashirvad47/L.C.D/tree/master/0141-linked-list-cycle) |

| [0151-reverse-words-in-a-string](https://github.com/ashirvad47/L.C.D/tree/master/0151-reverse-words-in-a-string) |

| [0167-two-sum-ii-input-array-is-sorted](https://github.com/ashirvad47/L.C.D/tree/master/0167-two-sum-ii-input-array-is-sorted) |

| [0189-rotate-array](https://github.com/ashirvad47/L.C.D/tree/master/0189-rotate-array) |

| [0202-happy-number](https://github.com/ashirvad47/L.C.D/tree/master/0202-happy-number) |

| [0283-move-zeroes](https://github.com/ashirvad47/L.C.D/tree/master/0283-move-zeroes) |

| [0287-find-the-duplicate-number](https://github.com/ashirvad47/L.C.D/tree/master/0287-find-the-duplicate-number) |

| [0345-reverse-vowels-of-a-string](https://github.com/ashirvad47/L.C.D/tree/master/0345-reverse-vowels-of-a-string) |

| [0392-is-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0392-is-subsequence) |

| [0532-k-diff-pairs-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/0532-k-diff-pairs-in-an-array) |

| [0567-permutation-in-string](https://github.com/ashirvad47/L.C.D/tree/master/0567-permutation-in-string) |

| [0647-palindromic-substrings](https://github.com/ashirvad47/L.C.D/tree/master/0647-palindromic-substrings) |

| [0908-middle-of-the-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/0908-middle-of-the-linked-list) |

| [1468-check-if-n-and-its-double-exist](https://github.com/ashirvad47/L.C.D/tree/master/1468-check-if-n-and-its-double-exist) |

| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/ashirvad47/L.C.D/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |

| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/ashirvad47/L.C.D/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |

| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/ashirvad47/L.C.D/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |

| [1894-merge-strings-alternately](https://github.com/ashirvad47/L.C.D/tree/master/1894-merge-strings-alternately) |

| [2162-partition-array-into-two-arrays-to-minimize-sum-difference](https://github.com/ashirvad47/L.C.D/tree/master/2162-partition-array-into-two-arrays-to-minimize-sum-difference) |

| [2232-adding-spaces-to-a-string](https://github.com/ashirvad47/L.C.D/tree/master/2232-adding-spaces-to-a-string) |

| [2265-partition-array-according-to-given-pivot](https://github.com/ashirvad47/L.C.D/tree/master/2265-partition-array-according-to-given-pivot) |

| [2414-move-pieces-to-obtain-a-string](https://github.com/ashirvad47/L.C.D/tree/master/2414-move-pieces-to-obtain-a-string) |

| [2497-maximum-matching-of-players-with-trainers](https://github.com/ashirvad47/L.C.D/tree/master/2497-maximum-matching-of-players-with-trainers) |

| [2551-apply-operations-to-an-array](https://github.com/ashirvad47/L.C.D/tree/master/2551-apply-operations-to-an-array) |

| [2699-count-the-number-of-fair-pairs](https://github.com/ashirvad47/L.C.D/tree/master/2699-count-the-number-of-fair-pairs) |

| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/ashirvad47/L.C.D/tree/master/2707-merge-two-2d-arrays-by-summing-values) |

| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/ashirvad47/L.C.D/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |

| [3683-find-the-lexicographically-largest-string-from-the-box-i](https://github.com/ashirvad47/L.C.D/tree/master/3683-find-the-lexicographically-largest-string-from-the-box-i) |

## Sorting

|  |

| ------- |

| [0015-3sum](https://github.com/ashirvad47/L.C.D/tree/master/0015-3sum) |

| [0049-group-anagrams](https://github.com/ashirvad47/L.C.D/tree/master/0049-group-anagrams) |

| [0056-merge-intervals](https://github.com/ashirvad47/L.C.D/tree/master/0056-merge-intervals) |

| [0075-sort-colors](https://github.com/ashirvad47/L.C.D/tree/master/0075-sort-colors) |

| [0088-merge-sorted-array](https://github.com/ashirvad47/L.C.D/tree/master/0088-merge-sorted-array) |

| [0169-majority-element](https://github.com/ashirvad47/L.C.D/tree/master/0169-majority-element) |

| [0217-contains-duplicate](https://github.com/ashirvad47/L.C.D/tree/master/0217-contains-duplicate) |

| [0242-valid-anagram](https://github.com/ashirvad47/L.C.D/tree/master/0242-valid-anagram) |

| [0274-h-index](https://github.com/ashirvad47/L.C.D/tree/master/0274-h-index) |

| [0347-top-k-frequent-elements](https://github.com/ashirvad47/L.C.D/tree/master/0347-top-k-frequent-elements) |

| [0368-largest-divisible-subset](https://github.com/ashirvad47/L.C.D/tree/master/0368-largest-divisible-subset) |

| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/ashirvad47/L.C.D/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |

| [0532-k-diff-pairs-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/0532-k-diff-pairs-in-an-array) |

| [0594-longest-harmonious-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0594-longest-harmonious-subsequence) |

| [0692-top-k-frequent-words](https://github.com/ashirvad47/L.C.D/tree/master/0692-top-k-frequent-words) |

| [0780-max-chunks-to-make-sorted](https://github.com/ashirvad47/L.C.D/tree/master/0780-max-chunks-to-make-sorted) |

| [0900-reordered-power-of-2](https://github.com/ashirvad47/L.C.D/tree/master/0900-reordered-power-of-2) |

| [1468-check-if-n-and-its-double-exist](https://github.com/ashirvad47/L.C.D/tree/master/1468-check-if-n-and-its-double-exist) |

| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/ashirvad47/L.C.D/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |

| [2164-two-best-non-overlapping-events](https://github.com/ashirvad47/L.C.D/tree/master/2164-two-best-non-overlapping-events) |

| [2179-most-beautiful-item-for-each-query](https://github.com/ashirvad47/L.C.D/tree/master/2179-most-beautiful-item-for-each-query) |

| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/ashirvad47/L.C.D/tree/master/2180-maximum-number-of-tasks-you-can-assign) |

| [2204-find-subsequence-of-length-k-with-the-largest-sum](https://github.com/ashirvad47/L.C.D/tree/master/2204-find-subsequence-of-length-k-with-the-largest-sum) |

| [2215-finding-3-digit-even-numbers](https://github.com/ashirvad47/L.C.D/tree/master/2215-finding-3-digit-even-numbers) |

| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/ashirvad47/L.C.D/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |

| [2479-meeting-rooms-iii](https://github.com/ashirvad47/L.C.D/tree/master/2479-meeting-rooms-iii) |

| [2497-maximum-matching-of-players-with-trainers](https://github.com/ashirvad47/L.C.D/tree/master/2497-maximum-matching-of-players-with-trainers) |

| [2554-minimum-total-distance-traveled](https://github.com/ashirvad47/L.C.D/tree/master/2554-minimum-total-distance-traveled) |

| [2586-longest-square-streak-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/2586-longest-square-streak-in-an-array) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/ashirvad47/L.C.D/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/2646-kth-largest-sum-in-a-binary-tree) |

| [2681-put-marbles-in-bags](https://github.com/ashirvad47/L.C.D/tree/master/2681-put-marbles-in-bags) |

| [2689-rearranging-fruits](https://github.com/ashirvad47/L.C.D/tree/master/2689-rearranging-fruits) |

| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/ashirvad47/L.C.D/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |

| [2699-count-the-number-of-fair-pairs](https://github.com/ashirvad47/L.C.D/tree/master/2699-count-the-number-of-fair-pairs) |

| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/ashirvad47/L.C.D/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |

| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/ashirvad47/L.C.D/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |

| [3241-divide-array-into-arrays-with-max-difference](https://github.com/ashirvad47/L.C.D/tree/master/3241-divide-array-into-arrays-with-max-difference) |

| [3291-find-if-array-can-be-sorted](https://github.com/ashirvad47/L.C.D/tree/master/3291-find-if-array-can-be-sorted) |

| [3307-find-the-maximum-sum-of-node-values](https://github.com/ashirvad47/L.C.D/tree/master/3307-find-the-maximum-sum-of-node-values) |

| [3321-type-of-triangle](https://github.com/ashirvad47/L.C.D/tree/master/3321-type-of-triangle) |

| [3647-zero-array-transformation-iii](https://github.com/ashirvad47/L.C.D/tree/master/3647-zero-array-transformation-iii) |

## Divide and Conquer

|  |

| ------- |

| [0004-median-of-two-sorted-arrays](https://github.com/ashirvad47/L.C.D/tree/master/0004-median-of-two-sorted-arrays) |

| [0053-maximum-subarray](https://github.com/ashirvad47/L.C.D/tree/master/0053-maximum-subarray) |

| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |

| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |

| [0169-majority-element](https://github.com/ashirvad47/L.C.D/tree/master/0169-majority-element) |

| [0347-top-k-frequent-elements](https://github.com/ashirvad47/L.C.D/tree/master/0347-top-k-frequent-elements) |

| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |

## Math

|  |

| ------- |

| [0002-add-two-numbers](https://github.com/ashirvad47/L.C.D/tree/master/0002-add-two-numbers) |

| [0012-integer-to-roman](https://github.com/ashirvad47/L.C.D/tree/master/0012-integer-to-roman) |

| [0013-roman-to-integer](https://github.com/ashirvad47/L.C.D/tree/master/0013-roman-to-integer) |

| [0048-rotate-image](https://github.com/ashirvad47/L.C.D/tree/master/0048-rotate-image) |

| [0050-powx-n](https://github.com/ashirvad47/L.C.D/tree/master/0050-powx-n) |

| [0062-unique-paths](https://github.com/ashirvad47/L.C.D/tree/master/0062-unique-paths) |

| [0066-plus-one](https://github.com/ashirvad47/L.C.D/tree/master/0066-plus-one) |

| [0067-add-binary](https://github.com/ashirvad47/L.C.D/tree/master/0067-add-binary) |

| [0070-climbing-stairs](https://github.com/ashirvad47/L.C.D/tree/master/0070-climbing-stairs) |

| [0150-evaluate-reverse-polish-notation](https://github.com/ashirvad47/L.C.D/tree/master/0150-evaluate-reverse-polish-notation) |

| [0189-rotate-array](https://github.com/ashirvad47/L.C.D/tree/master/0189-rotate-array) |

| [0202-happy-number](https://github.com/ashirvad47/L.C.D/tree/master/0202-happy-number) |

| [0224-basic-calculator](https://github.com/ashirvad47/L.C.D/tree/master/0224-basic-calculator) |

| [0231-power-of-two](https://github.com/ashirvad47/L.C.D/tree/master/0231-power-of-two) |

| [0279-perfect-squares](https://github.com/ashirvad47/L.C.D/tree/master/0279-perfect-squares) |

| [0326-power-of-three](https://github.com/ashirvad47/L.C.D/tree/master/0326-power-of-three) |

| [0368-largest-divisible-subset](https://github.com/ashirvad47/L.C.D/tree/master/0368-largest-divisible-subset) |

| [0380-insert-delete-getrandom-o1](https://github.com/ashirvad47/L.C.D/tree/master/0380-insert-delete-getrandom-o1) |

| [0670-maximum-swap](https://github.com/ashirvad47/L.C.D/tree/master/0670-maximum-swap) |

| [0826-soup-servings](https://github.com/ashirvad47/L.C.D/tree/master/0826-soup-servings) |

| [0867-new-21-game](https://github.com/ashirvad47/L.C.D/tree/master/0867-new-21-game) |

| [0900-reordered-power-of-2](https://github.com/ashirvad47/L.C.D/tree/master/0900-reordered-power-of-2) |

| [1146-greatest-common-divisor-of-strings](https://github.com/ashirvad47/L.C.D/tree/master/1146-greatest-common-divisor-of-strings) |

| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/ashirvad47/L.C.D/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |

| [1421-find-numbers-with-even-number-of-digits](https://github.com/ashirvad47/L.C.D/tree/master/1421-find-numbers-with-even-number-of-digits) |

| [1448-maximum-69-number](https://github.com/ashirvad47/L.C.D/tree/master/1448-maximum-69-number) |

| [1477-product-of-the-last-k-numbers](https://github.com/ashirvad47/L.C.D/tree/master/1477-product-of-the-last-k-numbers) |

| [1529-max-difference-you-can-get-from-changing-an-integer](https://github.com/ashirvad47/L.C.D/tree/master/1529-max-difference-you-can-get-from-changing-an-integer) |

| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/ashirvad47/L.C.D/tree/master/1631-number-of-sub-arrays-with-odd-sum) |

| [1925-count-nice-pairs-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/1925-count-nice-pairs-in-an-array) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/ashirvad47/L.C.D/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2278-find-three-consecutive-integers-that-sum-to-a-given-number](https://github.com/ashirvad47/L.C.D/tree/master/2278-find-three-consecutive-integers-that-sum-to-a-given-number) |

| [2351-number-of-ways-to-buy-pens-and-pencils](https://github.com/ashirvad47/L.C.D/tree/master/2351-number-of-ways-to-buy-pens-and-pencils) |

| [2448-count-number-of-bad-pairs](https://github.com/ashirvad47/L.C.D/tree/master/2448-count-number-of-bad-pairs) |

| [2704-maximum-difference-by-remapping-a-digit](https://github.com/ashirvad47/L.C.D/tree/master/2704-maximum-difference-by-remapping-a-digit) |

| [2716-prime-subtraction-operation](https://github.com/ashirvad47/L.C.D/tree/master/2716-prime-subtraction-operation) |

| [2757-count-of-integers](https://github.com/ashirvad47/L.C.D/tree/master/2757-count-of-integers) |

| [2802-find-the-punishment-number-of-an-integer](https://github.com/ashirvad47/L.C.D/tree/master/2802-find-the-punishment-number-of-an-integer) |

| [2812-find-the-maximum-achievable-number](https://github.com/ashirvad47/L.C.D/tree/master/2812-find-the-maximum-achievable-number) |

| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |

| [3172-divisible-and-non-divisible-sums-difference](https://github.com/ashirvad47/L.C.D/tree/master/3172-divisible-and-non-divisible-sums-difference) |

| [3201-distribute-candies-among-children-ii](https://github.com/ashirvad47/L.C.D/tree/master/3201-distribute-candies-among-children-ii) |

| [3321-type-of-triangle](https://github.com/ashirvad47/L.C.D/tree/master/3321-type-of-triangle) |

| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/ashirvad47/L.C.D/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |

| [3600-find-the-k-th-character-in-string-game-i](https://github.com/ashirvad47/L.C.D/tree/master/3600-find-the-k-th-character-in-string-game-i) |

| [3629-total-characters-in-string-after-transformations-i](https://github.com/ashirvad47/L.C.D/tree/master/3629-total-characters-in-string-after-transformations-i) |

| [3630-total-characters-in-string-after-transformations-ii](https://github.com/ashirvad47/L.C.D/tree/master/3630-total-characters-in-string-after-transformations-ii) |

| [3637-count-number-of-balanced-permutations](https://github.com/ashirvad47/L.C.D/tree/master/3637-count-number-of-balanced-permutations) |

| [3682-count-the-number-of-arrays-with-k-matching-adjacent-elements](https://github.com/ashirvad47/L.C.D/tree/master/3682-count-the-number-of-arrays-with-k-matching-adjacent-elements) |

## Dynamic Programming

|  |

| ------- |

| [0005-longest-palindromic-substring](https://github.com/ashirvad47/L.C.D/tree/master/0005-longest-palindromic-substring) |

| [0022-generate-parentheses](https://github.com/ashirvad47/L.C.D/tree/master/0022-generate-parentheses) |

| [0042-trapping-rain-water](https://github.com/ashirvad47/L.C.D/tree/master/0042-trapping-rain-water) |

| [0045-jump-game-ii](https://github.com/ashirvad47/L.C.D/tree/master/0045-jump-game-ii) |

| [0053-maximum-subarray](https://github.com/ashirvad47/L.C.D/tree/master/0053-maximum-subarray) |

| [0055-jump-game](https://github.com/ashirvad47/L.C.D/tree/master/0055-jump-game) |

| [0062-unique-paths](https://github.com/ashirvad47/L.C.D/tree/master/0062-unique-paths) |

| [0070-climbing-stairs](https://github.com/ashirvad47/L.C.D/tree/master/0070-climbing-stairs) |

| [0072-edit-distance](https://github.com/ashirvad47/L.C.D/tree/master/0072-edit-distance) |

| [0115-distinct-subsequences](https://github.com/ashirvad47/L.C.D/tree/master/0115-distinct-subsequences) |

| [0118-pascals-triangle](https://github.com/ashirvad47/L.C.D/tree/master/0118-pascals-triangle) |

| [0119-pascals-triangle-ii](https://github.com/ashirvad47/L.C.D/tree/master/0119-pascals-triangle-ii) |

| [0121-best-time-to-buy-and-sell-stock](https://github.com/ashirvad47/L.C.D/tree/master/0121-best-time-to-buy-and-sell-stock) |

| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/ashirvad47/L.C.D/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |

| [0124-binary-tree-maximum-path-sum](https://github.com/ashirvad47/L.C.D/tree/master/0124-binary-tree-maximum-path-sum) |

| [0139-word-break](https://github.com/ashirvad47/L.C.D/tree/master/0139-word-break) |

| [0198-house-robber](https://github.com/ashirvad47/L.C.D/tree/master/0198-house-robber) |

| [0279-perfect-squares](https://github.com/ashirvad47/L.C.D/tree/master/0279-perfect-squares) |

| [0300-longest-increasing-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0300-longest-increasing-subsequence) |

| [0322-coin-change](https://github.com/ashirvad47/L.C.D/tree/master/0322-coin-change) |

| [0338-counting-bits](https://github.com/ashirvad47/L.C.D/tree/master/0338-counting-bits) |

| [0368-largest-divisible-subset](https://github.com/ashirvad47/L.C.D/tree/master/0368-largest-divisible-subset) |

| [0377-combination-sum-iv](https://github.com/ashirvad47/L.C.D/tree/master/0377-combination-sum-iv) |

| [0392-is-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0392-is-subsequence) |

| [0416-partition-equal-subset-sum](https://github.com/ashirvad47/L.C.D/tree/master/0416-partition-equal-subset-sum) |

| [0474-ones-and-zeroes](https://github.com/ashirvad47/L.C.D/tree/master/0474-ones-and-zeroes) |

| [0494-target-sum](https://github.com/ashirvad47/L.C.D/tree/master/0494-target-sum) |

| [0516-longest-palindromic-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0516-longest-palindromic-subsequence) |

| [0518-coin-change-ii](https://github.com/ashirvad47/L.C.D/tree/master/0518-coin-change-ii) |

| [0542-01-matrix](https://github.com/ashirvad47/L.C.D/tree/master/0542-01-matrix) |

| [0583-delete-operation-for-two-strings](https://github.com/ashirvad47/L.C.D/tree/master/0583-delete-operation-for-two-strings) |

| [0647-palindromic-substrings](https://github.com/ashirvad47/L.C.D/tree/master/0647-palindromic-substrings) |

| [0712-minimum-ascii-delete-sum-for-two-strings](https://github.com/ashirvad47/L.C.D/tree/master/0712-minimum-ascii-delete-sum-for-two-strings) |

| [0806-domino-and-tromino-tiling](https://github.com/ashirvad47/L.C.D/tree/master/0806-domino-and-tromino-tiling) |

| [0826-soup-servings](https://github.com/ashirvad47/L.C.D/tree/master/0826-soup-servings) |

| [0867-new-21-game](https://github.com/ashirvad47/L.C.D/tree/master/0867-new-21-game) |

| [0905-length-of-longest-fibonacci-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0905-length-of-longest-fibonacci-subsequence) |

| [0934-bitwise-ors-of-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/0934-bitwise-ors-of-subarrays) |

| [1105-uncrossed-lines](https://github.com/ashirvad47/L.C.D/tree/master/1105-uncrossed-lines) |

| [1130-last-stone-weight-ii](https://github.com/ashirvad47/L.C.D/tree/master/1130-last-stone-weight-ii) |

| [1170-shortest-common-supersequence](https://github.com/ashirvad47/L.C.D/tree/master/1170-shortest-common-supersequence) |

| [1250-longest-common-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/1250-longest-common-subsequence) |

| [1393-maximum-value-of-k-coins-from-piles](https://github.com/ashirvad47/L.C.D/tree/master/1393-maximum-value-of-k-coins-from-piles) |

| [1402-count-square-submatrices-with-all-ones](https://github.com/ashirvad47/L.C.D/tree/master/1402-count-square-submatrices-with-all-ones) |

| [1437-minimum-insertion-steps-to-make-a-string-palindrome](https://github.com/ashirvad47/L.C.D/tree/master/1437-minimum-insertion-steps-to-make-a-string-palindrome) |

| [1628-count-submatrices-with-all-ones](https://github.com/ashirvad47/L.C.D/tree/master/1628-count-submatrices-with-all-ones) |

| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/ashirvad47/L.C.D/tree/master/1631-number-of-sub-arrays-with-odd-sum) |

| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/ashirvad47/L.C.D/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |

| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/ashirvad47/L.C.D/tree/master/1849-maximum-absolute-sum-of-any-subarray) |

| [2028-the-earliest-and-latest-rounds-where-players-compete](https://github.com/ashirvad47/L.C.D/tree/master/2028-the-earliest-and-latest-rounds-where-players-compete) |

| [2061-painting-a-grid-with-three-different-colors](https://github.com/ashirvad47/L.C.D/tree/master/2061-painting-a-grid-with-three-different-colors) |

| [2162-partition-array-into-two-arrays-to-minimize-sum-difference](https://github.com/ashirvad47/L.C.D/tree/master/2162-partition-array-into-two-arrays-to-minimize-sum-difference) |

| [2164-two-best-non-overlapping-events](https://github.com/ashirvad47/L.C.D/tree/master/2164-two-best-non-overlapping-events) |

| [2262-solving-questions-with-brainpower](https://github.com/ashirvad47/L.C.D/tree/master/2262-solving-questions-with-brainpower) |

| [2267-minimum-difference-in-sums-after-removal-of-elements](https://github.com/ashirvad47/L.C.D/tree/master/2267-minimum-difference-in-sums-after-removal-of-elements) |

| [2554-minimum-total-distance-traveled](https://github.com/ashirvad47/L.C.D/tree/master/2554-minimum-total-distance-traveled) |

| [2586-longest-square-streak-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/2586-longest-square-streak-in-an-array) |

| [2757-count-of-integers](https://github.com/ashirvad47/L.C.D/tree/master/2757-count-of-integers) |

| [2794-maximum-number-of-moves-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/2794-maximum-number-of-moves-in-a-grid) |

| [3142-longest-unequal-adjacent-groups-subsequence-ii](https://github.com/ashirvad47/L.C.D/tree/master/3142-longest-unequal-adjacent-groups-subsequence-ii) |

| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ashirvad47/L.C.D/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |

| [3307-find-the-maximum-sum-of-node-values](https://github.com/ashirvad47/L.C.D/tree/master/3307-find-the-maximum-sum-of-node-values) |

| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/ashirvad47/L.C.D/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |

| [3491-find-the-maximum-length-of-valid-subsequence-ii](https://github.com/ashirvad47/L.C.D/tree/master/3491-find-the-maximum-length-of-valid-subsequence-ii) |

| [3618-find-the-original-typed-string-ii](https://github.com/ashirvad47/L.C.D/tree/master/3618-find-the-original-typed-string-ii) |

| [3629-total-characters-in-string-after-transformations-i](https://github.com/ashirvad47/L.C.D/tree/master/3629-total-characters-in-string-after-transformations-i) |

| [3630-total-characters-in-string-after-transformations-ii](https://github.com/ashirvad47/L.C.D/tree/master/3630-total-characters-in-string-after-transformations-ii) |

| [3637-count-number-of-balanced-permutations](https://github.com/ashirvad47/L.C.D/tree/master/3637-count-number-of-balanced-permutations) |

| [3648-find-the-maximum-number-of-fruits-collected](https://github.com/ashirvad47/L.C.D/tree/master/3648-find-the-maximum-number-of-fruits-collected) |

| [3733-length-of-longest-v-shaped-diagonal-segment](https://github.com/ashirvad47/L.C.D/tree/master/3733-length-of-longest-v-shaped-diagonal-segment) |

## Greedy

|  |

| ------- |

| [0011-container-with-most-water](https://github.com/ashirvad47/L.C.D/tree/master/0011-container-with-most-water) |

| [0045-jump-game-ii](https://github.com/ashirvad47/L.C.D/tree/master/0045-jump-game-ii) |

| [0055-jump-game](https://github.com/ashirvad47/L.C.D/tree/master/0055-jump-game) |

| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/ashirvad47/L.C.D/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |

| [0134-gas-station](https://github.com/ashirvad47/L.C.D/tree/master/0134-gas-station) |

| [0135-candy](https://github.com/ashirvad47/L.C.D/tree/master/0135-candy) |

| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/ashirvad47/L.C.D/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |

| [0605-can-place-flowers](https://github.com/ashirvad47/L.C.D/tree/master/0605-can-place-flowers) |

| [0670-maximum-swap](https://github.com/ashirvad47/L.C.D/tree/master/0670-maximum-swap) |

| [0780-max-chunks-to-make-sorted](https://github.com/ashirvad47/L.C.D/tree/master/0780-max-chunks-to-make-sorted) |

| [1049-minimum-domino-rotations-for-equal-row](https://github.com/ashirvad47/L.C.D/tree/master/1049-minimum-domino-rotations-for-equal-row) |

| [1304-longest-happy-string](https://github.com/ashirvad47/L.C.D/tree/master/1304-longest-happy-string) |

| [1448-maximum-69-number](https://github.com/ashirvad47/L.C.D/tree/master/1448-maximum-69-number) |

| [1502-construct-k-palindrome-strings](https://github.com/ashirvad47/L.C.D/tree/master/1502-construct-k-palindrome-strings) |

| [1529-max-difference-you-can-get-from-changing-an-integer](https://github.com/ashirvad47/L.C.D/tree/master/1529-max-difference-you-can-get-from-changing-an-integer) |

| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/ashirvad47/L.C.D/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |

| [1818-maximum-score-from-removing-substrings](https://github.com/ashirvad47/L.C.D/tree/master/1818-maximum-score-from-removing-substrings) |

| [1917-maximum-average-pass-ratio](https://github.com/ashirvad47/L.C.D/tree/master/1917-maximum-average-pass-ratio) |

| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/ashirvad47/L.C.D/tree/master/2180-maximum-number-of-tasks-you-can-assign) |

| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/ashirvad47/L.C.D/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |

| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/ashirvad47/L.C.D/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |

| [2300-construct-string-with-repeat-limit](https://github.com/ashirvad47/L.C.D/tree/master/2300-construct-string-with-repeat-limit) |

| [2456-construct-smallest-number-from-di-string](https://github.com/ashirvad47/L.C.D/tree/master/2456-construct-smallest-number-from-di-string) |

| [2497-maximum-matching-of-players-with-trainers](https://github.com/ashirvad47/L.C.D/tree/master/2497-maximum-matching-of-players-with-trainers) |

| [2509-minimize-xor](https://github.com/ashirvad47/L.C.D/tree/master/2509-minimize-xor) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/ashirvad47/L.C.D/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2681-put-marbles-in-bags](https://github.com/ashirvad47/L.C.D/tree/master/2681-put-marbles-in-bags) |

| [2689-rearranging-fruits](https://github.com/ashirvad47/L.C.D/tree/master/2689-rearranging-fruits) |

| [2704-maximum-difference-by-remapping-a-digit](https://github.com/ashirvad47/L.C.D/tree/master/2704-maximum-difference-by-remapping-a-digit) |

| [2716-prime-subtraction-operation](https://github.com/ashirvad47/L.C.D/tree/master/2716-prime-subtraction-operation) |

| [2720-minimize-the-maximum-difference-of-pairs](https://github.com/ashirvad47/L.C.D/tree/master/2720-minimize-the-maximum-difference-of-pairs) |

| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ashirvad47/L.C.D/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |

| [3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros](https://github.com/ashirvad47/L.C.D/tree/master/3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros) |

| [3241-divide-array-into-arrays-with-max-difference](https://github.com/ashirvad47/L.C.D/tree/master/3241-divide-array-into-arrays-with-max-difference) |

| [3307-find-the-maximum-sum-of-node-values](https://github.com/ashirvad47/L.C.D/tree/master/3307-find-the-maximum-sum-of-node-values) |

| [3647-zero-array-transformation-iii](https://github.com/ashirvad47/L.C.D/tree/master/3647-zero-array-transformation-iii) |

| [3741-reschedule-meetings-for-maximum-free-time-ii](https://github.com/ashirvad47/L.C.D/tree/master/3741-reschedule-meetings-for-maximum-free-time-ii) |

| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/ashirvad47/L.C.D/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |

## Counting Sort

|  |

| ------- |

| [0274-h-index](https://github.com/ashirvad47/L.C.D/tree/master/0274-h-index) |

## Design

|  |

| ------- |

| [0155-min-stack](https://github.com/ashirvad47/L.C.D/tree/master/0155-min-stack) |

| [0173-binary-search-tree-iterator](https://github.com/ashirvad47/L.C.D/tree/master/0173-binary-search-tree-iterator) |

| [0208-implement-trie-prefix-tree](https://github.com/ashirvad47/L.C.D/tree/master/0208-implement-trie-prefix-tree) |

| [0211-design-add-and-search-words-data-structure](https://github.com/ashirvad47/L.C.D/tree/master/0211-design-add-and-search-words-data-structure) |

| [0380-insert-delete-getrandom-o1](https://github.com/ashirvad47/L.C.D/tree/master/0380-insert-delete-getrandom-o1) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [1477-product-of-the-last-k-numbers](https://github.com/ashirvad47/L.C.D/tree/master/1477-product-of-the-last-k-numbers) |

| [2434-design-a-number-container-system](https://github.com/ashirvad47/L.C.D/tree/master/2434-design-a-number-container-system) |

## Randomized

|  |

| ------- |

| [0380-insert-delete-getrandom-o1](https://github.com/ashirvad47/L.C.D/tree/master/0380-insert-delete-getrandom-o1) |

## Prefix Sum

|  |

| ------- |

| [0209-minimum-size-subarray-sum](https://github.com/ashirvad47/L.C.D/tree/master/0209-minimum-size-subarray-sum) |

| [0238-product-of-array-except-self](https://github.com/ashirvad47/L.C.D/tree/master/0238-product-of-array-except-self) |

| [1393-maximum-value-of-k-coins-from-piles](https://github.com/ashirvad47/L.C.D/tree/master/1393-maximum-value-of-k-coins-from-piles) |

| [1477-product-of-the-last-k-numbers](https://github.com/ashirvad47/L.C.D/tree/master/1477-product-of-the-last-k-numbers) |

| [1537-maximum-score-after-splitting-a-string](https://github.com/ashirvad47/L.C.D/tree/master/1537-maximum-score-after-splitting-a-string) |

| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/ashirvad47/L.C.D/tree/master/1631-number-of-sub-arrays-with-odd-sum) |

| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/ashirvad47/L.C.D/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |

| [1940-maximum-xor-for-each-query](https://github.com/ashirvad47/L.C.D/tree/master/1940-maximum-xor-for-each-query) |

| [2059-unique-length-3-palindromic-subsequences](https://github.com/ashirvad47/L.C.D/tree/master/2059-unique-length-3-palindromic-subsequences) |

| [2145-grid-game](https://github.com/ashirvad47/L.C.D/tree/master/2145-grid-game) |

| [2358-number-of-ways-to-split-array](https://github.com/ashirvad47/L.C.D/tree/master/2358-number-of-ways-to-split-array) |

| [2465-shifting-letters-ii](https://github.com/ashirvad47/L.C.D/tree/master/2465-shifting-letters-ii) |

| [2691-count-vowel-strings-in-ranges](https://github.com/ashirvad47/L.C.D/tree/master/2691-count-vowel-strings-in-ranges) |

| [2915-count-of-interesting-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/2915-count-of-interesting-subarrays) |

| [3427-special-array-ii](https://github.com/ashirvad47/L.C.D/tree/master/3427-special-array-ii) |

| [3618-find-the-original-typed-string-ii](https://github.com/ashirvad47/L.C.D/tree/master/3618-find-the-original-typed-string-ii) |

| [3639-zero-array-transformation-i](https://github.com/ashirvad47/L.C.D/tree/master/3639-zero-array-transformation-i) |

| [3643-zero-array-transformation-ii](https://github.com/ashirvad47/L.C.D/tree/master/3643-zero-array-transformation-ii) |

| [3647-zero-array-transformation-iii](https://github.com/ashirvad47/L.C.D/tree/master/3647-zero-array-transformation-iii) |

| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/ashirvad47/L.C.D/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |

| [3789-maximize-subarrays-after-removing-one-conflicting-pair](https://github.com/ashirvad47/L.C.D/tree/master/3789-maximize-subarrays-after-removing-one-conflicting-pair) |

## Trie

|  |

| ------- |

| [0014-longest-common-prefix](https://github.com/ashirvad47/L.C.D/tree/master/0014-longest-common-prefix) |

| [0139-word-break](https://github.com/ashirvad47/L.C.D/tree/master/0139-word-break) |

| [0208-implement-trie-prefix-tree](https://github.com/ashirvad47/L.C.D/tree/master/0208-implement-trie-prefix-tree) |

| [0211-design-add-and-search-words-data-structure](https://github.com/ashirvad47/L.C.D/tree/master/0211-design-add-and-search-words-data-structure) |

| [0386-lexicographical-numbers](https://github.com/ashirvad47/L.C.D/tree/master/0386-lexicographical-numbers) |

| [0440-k-th-smallest-in-lexicographical-order](https://github.com/ashirvad47/L.C.D/tree/master/0440-k-th-smallest-in-lexicographical-order) |

| [0692-top-k-frequent-words](https://github.com/ashirvad47/L.C.D/tree/master/0692-top-k-frequent-words) |

| [1350-remove-sub-folders-from-the-filesystem](https://github.com/ashirvad47/L.C.D/tree/master/1350-remove-sub-folders-from-the-filesystem) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/ashirvad47/L.C.D/tree/master/3309-count-prefix-and-suffix-pairs-i) |

## String Matching

|  |

| ------- |

| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/ashirvad47/L.C.D/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |

| [0812-rotate-string](https://github.com/ashirvad47/L.C.D/tree/master/0812-rotate-string) |

| [1524-string-matching-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/1524-string-matching-in-an-array) |

| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/ashirvad47/L.C.D/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |

| [2292-counting-words-with-a-given-prefix](https://github.com/ashirvad47/L.C.D/tree/master/2292-counting-words-with-a-given-prefix) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/ashirvad47/L.C.D/tree/master/3309-count-prefix-and-suffix-pairs-i) |

## Binary Search

|  |

| ------- |

| [0004-median-of-two-sorted-arrays](https://github.com/ashirvad47/L.C.D/tree/master/0004-median-of-two-sorted-arrays) |

| [0035-search-insert-position](https://github.com/ashirvad47/L.C.D/tree/master/0035-search-insert-position) |

| [0074-search-a-2d-matrix](https://github.com/ashirvad47/L.C.D/tree/master/0074-search-a-2d-matrix) |

| [0167-two-sum-ii-input-array-is-sorted](https://github.com/ashirvad47/L.C.D/tree/master/0167-two-sum-ii-input-array-is-sorted) |

| [0209-minimum-size-subarray-sum](https://github.com/ashirvad47/L.C.D/tree/master/0209-minimum-size-subarray-sum) |

| [0222-count-complete-tree-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0222-count-complete-tree-nodes) |

| [0287-find-the-duplicate-number](https://github.com/ashirvad47/L.C.D/tree/master/0287-find-the-duplicate-number) |

| [0300-longest-increasing-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0300-longest-increasing-subsequence) |

| [0532-k-diff-pairs-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/0532-k-diff-pairs-in-an-array) |

| [1335-maximum-candies-allocated-to-k-children](https://github.com/ashirvad47/L.C.D/tree/master/1335-maximum-candies-allocated-to-k-children) |

| [1468-check-if-n-and-its-double-exist](https://github.com/ashirvad47/L.C.D/tree/master/1468-check-if-n-and-its-double-exist) |

| [1621-number-of-subsequences-that-satisfy-the-given-sum-condition](https://github.com/ashirvad47/L.C.D/tree/master/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) |

| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/ashirvad47/L.C.D/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |

| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/ashirvad47/L.C.D/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |

| [1886-minimum-limit-of-balls-in-a-bag](https://github.com/ashirvad47/L.C.D/tree/master/1886-minimum-limit-of-balls-in-a-bag) |

| [2162-partition-array-into-two-arrays-to-minimize-sum-difference](https://github.com/ashirvad47/L.C.D/tree/master/2162-partition-array-into-two-arrays-to-minimize-sum-difference) |

| [2164-two-best-non-overlapping-events](https://github.com/ashirvad47/L.C.D/tree/master/2164-two-best-non-overlapping-events) |

| [2179-most-beautiful-item-for-each-query](https://github.com/ashirvad47/L.C.D/tree/master/2179-most-beautiful-item-for-each-query) |

| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/ashirvad47/L.C.D/tree/master/2180-maximum-number-of-tasks-you-can-assign) |

| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/ashirvad47/L.C.D/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |

| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/ashirvad47/L.C.D/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |

| [2586-longest-square-streak-in-an-array](https://github.com/ashirvad47/L.C.D/tree/master/2586-longest-square-streak-in-an-array) |

| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/ashirvad47/L.C.D/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/ashirvad47/L.C.D/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2699-count-the-number-of-fair-pairs](https://github.com/ashirvad47/L.C.D/tree/master/2699-count-the-number-of-fair-pairs) |

| [2716-prime-subtraction-operation](https://github.com/ashirvad47/L.C.D/tree/master/2716-prime-subtraction-operation) |

| [2720-minimize-the-maximum-difference-of-pairs](https://github.com/ashirvad47/L.C.D/tree/master/2720-minimize-the-maximum-difference-of-pairs) |

| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/ashirvad47/L.C.D/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/ashirvad47/L.C.D/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/ashirvad47/L.C.D/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |

| [3427-special-array-ii](https://github.com/ashirvad47/L.C.D/tree/master/3427-special-array-ii) |

| [3643-zero-array-transformation-ii](https://github.com/ashirvad47/L.C.D/tree/master/3643-zero-array-transformation-ii) |

| [3791-fruits-into-baskets-iii](https://github.com/ashirvad47/L.C.D/tree/master/3791-fruits-into-baskets-iii) |

## Recursion

|  |

| ------- |

| [0002-add-two-numbers](https://github.com/ashirvad47/L.C.D/tree/master/0002-add-two-numbers) |

| [0021-merge-two-sorted-lists](https://github.com/ashirvad47/L.C.D/tree/master/0021-merge-two-sorted-lists) |

| [0025-reverse-nodes-in-k-group](https://github.com/ashirvad47/L.C.D/tree/master/0025-reverse-nodes-in-k-group) |

| [0050-powx-n](https://github.com/ashirvad47/L.C.D/tree/master/0050-powx-n) |

| [0206-reverse-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/0206-reverse-linked-list) |

| [0224-basic-calculator](https://github.com/ashirvad47/L.C.D/tree/master/0224-basic-calculator) |

| [0231-power-of-two](https://github.com/ashirvad47/L.C.D/tree/master/0231-power-of-two) |

| [0326-power-of-three](https://github.com/ashirvad47/L.C.D/tree/master/0326-power-of-three) |

| [1197-parsing-a-boolean-expression](https://github.com/ashirvad47/L.C.D/tree/master/1197-parsing-a-boolean-expression) |

| [1667-find-kth-bit-in-nth-binary-string](https://github.com/ashirvad47/L.C.D/tree/master/1667-find-kth-bit-in-nth-binary-string) |

| [3600-find-the-k-th-character-in-string-game-i](https://github.com/ashirvad47/L.C.D/tree/master/3600-find-the-k-th-character-in-string-game-i) |

## Stack

|  |

| ------- |

| [0020-valid-parentheses](https://github.com/ashirvad47/L.C.D/tree/master/0020-valid-parentheses) |

| [0042-trapping-rain-water](https://github.com/ashirvad47/L.C.D/tree/master/0042-trapping-rain-water) |

| [0071-simplify-path](https://github.com/ashirvad47/L.C.D/tree/master/0071-simplify-path) |

| [0094-binary-tree-inorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0094-binary-tree-inorder-traversal) |

| [0114-flatten-binary-tree-to-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/0114-flatten-binary-tree-to-linked-list) |

| [0145-binary-tree-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0145-binary-tree-postorder-traversal) |

| [0150-evaluate-reverse-polish-notation](https://github.com/ashirvad47/L.C.D/tree/master/0150-evaluate-reverse-polish-notation) |

| [0155-min-stack](https://github.com/ashirvad47/L.C.D/tree/master/0155-min-stack) |

| [0173-binary-search-tree-iterator](https://github.com/ashirvad47/L.C.D/tree/master/0173-binary-search-tree-iterator) |

| [0224-basic-calculator](https://github.com/ashirvad47/L.C.D/tree/master/0224-basic-calculator) |

| [0496-next-greater-element-i](https://github.com/ashirvad47/L.C.D/tree/master/0496-next-greater-element-i) |

| [0739-daily-temperatures](https://github.com/ashirvad47/L.C.D/tree/master/0739-daily-temperatures) |

| [0780-max-chunks-to-make-sorted](https://github.com/ashirvad47/L.C.D/tree/master/0780-max-chunks-to-make-sorted) |

| [1197-parsing-a-boolean-expression](https://github.com/ashirvad47/L.C.D/tree/master/1197-parsing-a-boolean-expression) |

| [1628-count-submatrices-with-all-ones](https://github.com/ashirvad47/L.C.D/tree/master/1628-count-submatrices-with-all-ones) |

| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/ashirvad47/L.C.D/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |

| [1818-maximum-score-from-removing-substrings](https://github.com/ashirvad47/L.C.D/tree/master/1818-maximum-score-from-removing-substrings) |

| [2021-remove-all-occurrences-of-a-substring](https://github.com/ashirvad47/L.C.D/tree/master/2021-remove-all-occurrences-of-a-substring) |

| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/ashirvad47/L.C.D/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |

| [2456-construct-smallest-number-from-di-string](https://github.com/ashirvad47/L.C.D/tree/master/2456-construct-smallest-number-from-di-string) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/ashirvad47/L.C.D/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

| [3447-clear-digits](https://github.com/ashirvad47/L.C.D/tree/master/3447-clear-digits) |

## Monotonic Stack

|  |

| ------- |

| [0042-trapping-rain-water](https://github.com/ashirvad47/L.C.D/tree/master/0042-trapping-rain-water) |

| [0496-next-greater-element-i](https://github.com/ashirvad47/L.C.D/tree/master/0496-next-greater-element-i) |

| [0739-daily-temperatures](https://github.com/ashirvad47/L.C.D/tree/master/0739-daily-temperatures) |

| [0780-max-chunks-to-make-sorted](https://github.com/ashirvad47/L.C.D/tree/master/0780-max-chunks-to-make-sorted) |

| [1628-count-submatrices-with-all-ones](https://github.com/ashirvad47/L.C.D/tree/master/1628-count-submatrices-with-all-ones) |

| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/ashirvad47/L.C.D/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/ashirvad47/L.C.D/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

## Linked List

|  |

| ------- |

| [0002-add-two-numbers](https://github.com/ashirvad47/L.C.D/tree/master/0002-add-two-numbers) |

| [0019-remove-nth-node-from-end-of-list](https://github.com/ashirvad47/L.C.D/tree/master/0019-remove-nth-node-from-end-of-list) |

| [0021-merge-two-sorted-lists](https://github.com/ashirvad47/L.C.D/tree/master/0021-merge-two-sorted-lists) |

| [0025-reverse-nodes-in-k-group](https://github.com/ashirvad47/L.C.D/tree/master/0025-reverse-nodes-in-k-group) |

| [0061-rotate-list](https://github.com/ashirvad47/L.C.D/tree/master/0061-rotate-list) |

| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/ashirvad47/L.C.D/tree/master/0082-remove-duplicates-from-sorted-list-ii) |

| [0086-partition-list](https://github.com/ashirvad47/L.C.D/tree/master/0086-partition-list) |

| [0092-reverse-linked-list-ii](https://github.com/ashirvad47/L.C.D/tree/master/0092-reverse-linked-list-ii) |

| [0114-flatten-binary-tree-to-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/0114-flatten-binary-tree-to-linked-list) |

| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/ashirvad47/L.C.D/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |

| [0138-copy-list-with-random-pointer](https://github.com/ashirvad47/L.C.D/tree/master/0138-copy-list-with-random-pointer) |

| [0141-linked-list-cycle](https://github.com/ashirvad47/L.C.D/tree/master/0141-linked-list-cycle) |

| [0206-reverse-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/0206-reverse-linked-list) |

| [0908-middle-of-the-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/0908-middle-of-the-linked-list) |

| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/ashirvad47/L.C.D/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |

| [2299-merge-nodes-in-between-zeros](https://github.com/ashirvad47/L.C.D/tree/master/2299-merge-nodes-in-between-zeros) |

| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |

## Sliding Window

|  |

| ------- |

| [0003-longest-substring-without-repeating-characters](https://github.com/ashirvad47/L.C.D/tree/master/0003-longest-substring-without-repeating-characters) |

| [0209-minimum-size-subarray-sum](https://github.com/ashirvad47/L.C.D/tree/master/0209-minimum-size-subarray-sum) |

| [0219-contains-duplicate-ii](https://github.com/ashirvad47/L.C.D/tree/master/0219-contains-duplicate-ii) |

| [0567-permutation-in-string](https://github.com/ashirvad47/L.C.D/tree/master/0567-permutation-in-string) |

| [0594-longest-harmonious-subsequence](https://github.com/ashirvad47/L.C.D/tree/master/0594-longest-harmonious-subsequence) |

| [0867-new-21-game](https://github.com/ashirvad47/L.C.D/tree/master/0867-new-21-game) |

| [0940-fruit-into-baskets](https://github.com/ashirvad47/L.C.D/tree/master/0940-fruit-into-baskets) |

| [1755-defuse-the-bomb](https://github.com/ashirvad47/L.C.D/tree/master/1755-defuse-the-bomb) |

| [1813-maximum-erasure-value](https://github.com/ashirvad47/L.C.D/tree/master/1813-maximum-erasure-value) |

| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/ashirvad47/L.C.D/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |

| [2527-count-subarrays-with-fixed-bounds](https://github.com/ashirvad47/L.C.D/tree/master/2527-count-subarrays-with-fixed-bounds) |

| [2868-continuous-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/2868-continuous-subarrays) |

| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/ashirvad47/L.C.D/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |

| [3213-count-subarrays-where-max-element-appears-at-least-k-times](https://github.com/ashirvad47/L.C.D/tree/master/3213-count-subarrays-where-max-element-appears-at-least-k-times) |

| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/ashirvad47/L.C.D/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |

| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/ashirvad47/L.C.D/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |

| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/ashirvad47/L.C.D/tree/master/3522-find-the-power-of-k-size-subarrays-i) |

| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/ashirvad47/L.C.D/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |

| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/ashirvad47/L.C.D/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |

## Depth-First Search

|  |

| ------- |

| [0094-binary-tree-inorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0094-binary-tree-inorder-traversal) |

| [0098-validate-binary-search-tree](https://github.com/ashirvad47/L.C.D/tree/master/0098-validate-binary-search-tree) |

| [0100-same-tree](https://github.com/ashirvad47/L.C.D/tree/master/0100-same-tree) |

| [0101-symmetric-tree](https://github.com/ashirvad47/L.C.D/tree/master/0101-symmetric-tree) |

| [0104-maximum-depth-of-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0104-maximum-depth-of-binary-tree) |

| [0112-path-sum](https://github.com/ashirvad47/L.C.D/tree/master/0112-path-sum) |

| [0114-flatten-binary-tree-to-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/0114-flatten-binary-tree-to-linked-list) |

| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/ashirvad47/L.C.D/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |

| [0124-binary-tree-maximum-path-sum](https://github.com/ashirvad47/L.C.D/tree/master/0124-binary-tree-maximum-path-sum) |

| [0129-sum-root-to-leaf-numbers](https://github.com/ashirvad47/L.C.D/tree/master/0129-sum-root-to-leaf-numbers) |

| [0130-surrounded-regions](https://github.com/ashirvad47/L.C.D/tree/master/0130-surrounded-regions) |

| [0133-clone-graph](https://github.com/ashirvad47/L.C.D/tree/master/0133-clone-graph) |

| [0145-binary-tree-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0145-binary-tree-postorder-traversal) |

| [0200-number-of-islands](https://github.com/ashirvad47/L.C.D/tree/master/0200-number-of-islands) |

| [0207-course-schedule](https://github.com/ashirvad47/L.C.D/tree/master/0207-course-schedule) |

| [0211-design-add-and-search-words-data-structure](https://github.com/ashirvad47/L.C.D/tree/master/0211-design-add-and-search-words-data-structure) |

| [0226-invert-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0226-invert-binary-tree) |

| [0230-kth-smallest-element-in-a-bst](https://github.com/ashirvad47/L.C.D/tree/master/0230-kth-smallest-element-in-a-bst) |

| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |

| [0386-lexicographical-numbers](https://github.com/ashirvad47/L.C.D/tree/master/0386-lexicographical-numbers) |

| [0399-evaluate-division](https://github.com/ashirvad47/L.C.D/tree/master/0399-evaluate-division) |

| [0530-minimum-absolute-difference-in-bst](https://github.com/ashirvad47/L.C.D/tree/master/0530-minimum-absolute-difference-in-bst) |

| [0637-average-of-levels-in-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0637-average-of-levels-in-binary-tree) |

| [0684-redundant-connection](https://github.com/ashirvad47/L.C.D/tree/master/0684-redundant-connection) |

| [0799-minimum-distance-between-bst-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0799-minimum-distance-between-bst-nodes) |

| [0820-find-eventual-safe-states](https://github.com/ashirvad47/L.C.D/tree/master/0820-find-eventual-safe-states) |

| [0854-making-a-large-island](https://github.com/ashirvad47/L.C.D/tree/master/0854-making-a-large-island) |

| [0896-smallest-subtree-with-all-the-deepest-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0896-smallest-subtree-with-all-the-deepest-nodes) |

| [0988-flip-equivalent-binary-trees](https://github.com/ashirvad47/L.C.D/tree/master/0988-flip-equivalent-binary-trees) |

| [1093-recover-a-tree-from-preorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/1093-recover-a-tree-from-preorder-traversal) |

| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/ashirvad47/L.C.D/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |

| [1350-remove-sub-folders-from-the-filesystem](https://github.com/ashirvad47/L.C.D/tree/master/1350-remove-sub-folders-from-the-filesystem) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [1396-count-servers-that-communicate](https://github.com/ashirvad47/L.C.D/tree/master/1396-count-servers-that-communicate) |

| [1558-course-schedule-iv](https://github.com/ashirvad47/L.C.D/tree/master/1558-course-schedule-iv) |

| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/ashirvad47/L.C.D/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |

| [2400-minimum-score-after-removals-on-a-tree](https://github.com/ashirvad47/L.C.D/tree/master/2400-minimum-score-after-removals-on-a-tree) |

| [2438-find-closest-node-to-given-two-nodes](https://github.com/ashirvad47/L.C.D/tree/master/2438-find-closest-node-to-given-two-nodes) |

| [2493-reverse-odd-levels-of-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/2493-reverse-odd-levels-of-binary-tree) |

| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/ashirvad47/L.C.D/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |

| [2564-most-profitable-path-in-a-tree](https://github.com/ashirvad47/L.C.D/tree/master/2564-most-profitable-path-in-a-tree) |

| [2677-cousins-in-binary-tree-ii](https://github.com/ashirvad47/L.C.D/tree/master/2677-cousins-in-binary-tree-ii) |

| [2764-maximum-number-of-fish-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/2764-maximum-number-of-fish-in-a-grid) |

| [3058-maximum-number-of-k-divisible-components](https://github.com/ashirvad47/L.C.D/tree/master/3058-maximum-number-of-k-divisible-components) |

| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/ashirvad47/L.C.D/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |

| [3633-maximize-the-number-of-target-nodes-after-connecting-trees-i](https://github.com/ashirvad47/L.C.D/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i) |

## Heap (Priority Queue)

|  |

| ------- |

| [0347-top-k-frequent-elements](https://github.com/ashirvad47/L.C.D/tree/master/0347-top-k-frequent-elements) |

| [0407-trapping-rain-water-ii](https://github.com/ashirvad47/L.C.D/tree/master/0407-trapping-rain-water-ii) |

| [0692-top-k-frequent-words](https://github.com/ashirvad47/L.C.D/tree/master/0692-top-k-frequent-words) |

| [1127-last-stone-weight](https://github.com/ashirvad47/L.C.D/tree/master/1127-last-stone-weight) |

| [1304-longest-happy-string](https://github.com/ashirvad47/L.C.D/tree/master/1304-longest-happy-string) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [1917-maximum-average-pass-ratio](https://github.com/ashirvad47/L.C.D/tree/master/1917-maximum-average-pass-ratio) |

| [2164-two-best-non-overlapping-events](https://github.com/ashirvad47/L.C.D/tree/master/2164-two-best-non-overlapping-events) |

| [2204-find-subsequence-of-length-k-with-the-largest-sum](https://github.com/ashirvad47/L.C.D/tree/master/2204-find-subsequence-of-length-k-with-the-largest-sum) |

| [2267-minimum-difference-in-sums-after-removal-of-elements](https://github.com/ashirvad47/L.C.D/tree/master/2267-minimum-difference-in-sums-after-removal-of-elements) |

| [2300-construct-string-with-repeat-limit](https://github.com/ashirvad47/L.C.D/tree/master/2300-construct-string-with-repeat-limit) |

| [2434-design-a-number-container-system](https://github.com/ashirvad47/L.C.D/tree/master/2434-design-a-number-container-system) |

| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/ashirvad47/L.C.D/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |

| [2479-meeting-rooms-iii](https://github.com/ashirvad47/L.C.D/tree/master/2479-meeting-rooms-iii) |

| [2681-put-marbles-in-bags](https://github.com/ashirvad47/L.C.D/tree/master/2681-put-marbles-in-bags) |

| [2692-take-gifts-from-the-richest-pile](https://github.com/ashirvad47/L.C.D/tree/master/2692-take-gifts-from-the-richest-pile) |

| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/ashirvad47/L.C.D/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |

| [2868-continuous-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/2868-continuous-subarrays) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/ashirvad47/L.C.D/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/ashirvad47/L.C.D/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |

| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/ashirvad47/L.C.D/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |

| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/ashirvad47/L.C.D/tree/master/3627-find-minimum-time-to-reach-last-room-i) |

| [3628-find-minimum-time-to-reach-last-room-ii](https://github.com/ashirvad47/L.C.D/tree/master/3628-find-minimum-time-to-reach-last-room-ii) |

| [3647-zero-array-transformation-iii](https://github.com/ashirvad47/L.C.D/tree/master/3647-zero-array-transformation-iii) |

## Bucket Sort

|  |

| ------- |

| [0347-top-k-frequent-elements](https://github.com/ashirvad47/L.C.D/tree/master/0347-top-k-frequent-elements) |

| [0692-top-k-frequent-words](https://github.com/ashirvad47/L.C.D/tree/master/0692-top-k-frequent-words) |

## Quickselect

|  |

| ------- |

| [0347-top-k-frequent-elements](https://github.com/ashirvad47/L.C.D/tree/master/0347-top-k-frequent-elements) |

## Union Find

|  |

| ------- |

| [0128-longest-consecutive-sequence](https://github.com/ashirvad47/L.C.D/tree/master/0128-longest-consecutive-sequence) |

| [0130-surrounded-regions](https://github.com/ashirvad47/L.C.D/tree/master/0130-surrounded-regions) |

| [0200-number-of-islands](https://github.com/ashirvad47/L.C.D/tree/master/0200-number-of-islands) |

| [0399-evaluate-division](https://github.com/ashirvad47/L.C.D/tree/master/0399-evaluate-division) |

| [0684-redundant-connection](https://github.com/ashirvad47/L.C.D/tree/master/0684-redundant-connection) |

| [0854-making-a-large-island](https://github.com/ashirvad47/L.C.D/tree/master/0854-making-a-large-island) |

| [1058-lexicographically-smallest-equivalent-string](https://github.com/ashirvad47/L.C.D/tree/master/1058-lexicographically-smallest-equivalent-string) |

| [1396-count-servers-that-communicate](https://github.com/ashirvad47/L.C.D/tree/master/1396-count-servers-that-communicate) |

| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/ashirvad47/L.C.D/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |

| [2764-maximum-number-of-fish-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/2764-maximum-number-of-fish-in-a-grid) |

| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/ashirvad47/L.C.D/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |

## Simulation

|  |

| ------- |

| [0054-spiral-matrix](https://github.com/ashirvad47/L.C.D/tree/master/0054-spiral-matrix) |

| [0067-add-binary](https://github.com/ashirvad47/L.C.D/tree/master/0067-add-binary) |

| [0289-game-of-life](https://github.com/ashirvad47/L.C.D/tree/master/0289-game-of-life) |

| [0498-diagonal-traverse](https://github.com/ashirvad47/L.C.D/tree/master/0498-diagonal-traverse) |

| [1667-find-kth-bit-in-nth-binary-string](https://github.com/ashirvad47/L.C.D/tree/master/1667-find-kth-bit-in-nth-binary-string) |

| [2021-remove-all-occurrences-of-a-substring](https://github.com/ashirvad47/L.C.D/tree/master/2021-remove-all-occurrences-of-a-substring) |

| [2048-build-array-from-permutation](https://github.com/ashirvad47/L.C.D/tree/master/2048-build-array-from-permutation) |

| [2058-concatenation-of-array](https://github.com/ashirvad47/L.C.D/tree/master/2058-concatenation-of-array) |

| [2232-adding-spaces-to-a-string](https://github.com/ashirvad47/L.C.D/tree/master/2232-adding-spaces-to-a-string) |

| [2265-partition-array-according-to-given-pivot](https://github.com/ashirvad47/L.C.D/tree/master/2265-partition-array-according-to-given-pivot) |

| [2278-find-three-consecutive-integers-that-sum-to-a-given-number](https://github.com/ashirvad47/L.C.D/tree/master/2278-find-three-consecutive-integers-that-sum-to-a-given-number) |

| [2299-merge-nodes-in-between-zeros](https://github.com/ashirvad47/L.C.D/tree/master/2299-merge-nodes-in-between-zeros) |

| [2479-meeting-rooms-iii](https://github.com/ashirvad47/L.C.D/tree/master/2479-meeting-rooms-iii) |

| [2551-apply-operations-to-an-array](https://github.com/ashirvad47/L.C.D/tree/master/2551-apply-operations-to-an-array) |

| [2692-take-gifts-from-the-richest-pile](https://github.com/ashirvad47/L.C.D/tree/master/2692-take-gifts-from-the-richest-pile) |

| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/ashirvad47/L.C.D/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |

| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/ashirvad47/L.C.D/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |

| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/ashirvad47/L.C.D/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |

| [3447-clear-digits](https://github.com/ashirvad47/L.C.D/tree/master/3447-clear-digits) |

| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/ashirvad47/L.C.D/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |

| [3600-find-the-k-th-character-in-string-game-i](https://github.com/ashirvad47/L.C.D/tree/master/3600-find-the-k-th-character-in-string-game-i) |

## Enumeration

|  |

| ------- |

| [0900-reordered-power-of-2](https://github.com/ashirvad47/L.C.D/tree/master/0900-reordered-power-of-2) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/ashirvad47/L.C.D/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/ashirvad47/L.C.D/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |

| [2215-finding-3-digit-even-numbers](https://github.com/ashirvad47/L.C.D/tree/master/2215-finding-3-digit-even-numbers) |

| [2351-number-of-ways-to-buy-pens-and-pencils](https://github.com/ashirvad47/L.C.D/tree/master/2351-number-of-ways-to-buy-pens-and-pencils) |

| [3201-distribute-candies-among-children-ii](https://github.com/ashirvad47/L.C.D/tree/master/3201-distribute-candies-among-children-ii) |

| [3459-find-the-minimum-area-to-cover-all-ones-ii](https://github.com/ashirvad47/L.C.D/tree/master/3459-find-the-minimum-area-to-cover-all-ones-ii) |

| [3683-find-the-lexicographically-largest-string-from-the-box-i](https://github.com/ashirvad47/L.C.D/tree/master/3683-find-the-lexicographically-largest-string-from-the-box-i) |

| [3741-reschedule-meetings-for-maximum-free-time-ii](https://github.com/ashirvad47/L.C.D/tree/master/3741-reschedule-meetings-for-maximum-free-time-ii) |

| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/ashirvad47/L.C.D/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |

| [3789-maximize-subarrays-after-removing-one-conflicting-pair](https://github.com/ashirvad47/L.C.D/tree/master/3789-maximize-subarrays-after-removing-one-conflicting-pair) |

## Matrix

|  |

| ------- |

| [0036-valid-sudoku](https://github.com/ashirvad47/L.C.D/tree/master/0036-valid-sudoku) |

| [0048-rotate-image](https://github.com/ashirvad47/L.C.D/tree/master/0048-rotate-image) |

| [0054-spiral-matrix](https://github.com/ashirvad47/L.C.D/tree/master/0054-spiral-matrix) |

| [0073-set-matrix-zeroes](https://github.com/ashirvad47/L.C.D/tree/master/0073-set-matrix-zeroes) |

| [0074-search-a-2d-matrix](https://github.com/ashirvad47/L.C.D/tree/master/0074-search-a-2d-matrix) |

| [0130-surrounded-regions](https://github.com/ashirvad47/L.C.D/tree/master/0130-surrounded-regions) |

| [0200-number-of-islands](https://github.com/ashirvad47/L.C.D/tree/master/0200-number-of-islands) |

| [0289-game-of-life](https://github.com/ashirvad47/L.C.D/tree/master/0289-game-of-life) |

| [0407-trapping-rain-water-ii](https://github.com/ashirvad47/L.C.D/tree/master/0407-trapping-rain-water-ii) |

| [0498-diagonal-traverse](https://github.com/ashirvad47/L.C.D/tree/master/0498-diagonal-traverse) |

| [0542-01-matrix](https://github.com/ashirvad47/L.C.D/tree/master/0542-01-matrix) |

| [0854-making-a-large-island](https://github.com/ashirvad47/L.C.D/tree/master/0854-making-a-large-island) |

| [0945-snakes-and-ladders](https://github.com/ashirvad47/L.C.D/tree/master/0945-snakes-and-ladders) |

| [1036-rotting-oranges](https://github.com/ashirvad47/L.C.D/tree/master/1036-rotting-oranges) |

| [1396-count-servers-that-communicate](https://github.com/ashirvad47/L.C.D/tree/master/1396-count-servers-that-communicate) |

| [1402-count-square-submatrices-with-all-ones](https://github.com/ashirvad47/L.C.D/tree/master/1402-count-square-submatrices-with-all-ones) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [1628-count-submatrices-with-all-ones](https://github.com/ashirvad47/L.C.D/tree/master/1628-count-submatrices-with-all-ones) |

| [1876-map-of-highest-peak](https://github.com/ashirvad47/L.C.D/tree/master/1876-map-of-highest-peak) |

| [2145-grid-game](https://github.com/ashirvad47/L.C.D/tree/master/2145-grid-game) |

| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/ashirvad47/L.C.D/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |

| [2685-first-completely-painted-row-or-column](https://github.com/ashirvad47/L.C.D/tree/master/2685-first-completely-painted-row-or-column) |

| [2764-maximum-number-of-fish-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/2764-maximum-number-of-fish-in-a-grid) |

| [2794-maximum-number-of-moves-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/2794-maximum-number-of-moves-in-a-grid) |

| [3459-find-the-minimum-area-to-cover-all-ones-ii](https://github.com/ashirvad47/L.C.D/tree/master/3459-find-the-minimum-area-to-cover-all-ones-ii) |

| [3461-find-the-minimum-area-to-cover-all-ones-i](https://github.com/ashirvad47/L.C.D/tree/master/3461-find-the-minimum-area-to-cover-all-ones-i) |

| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/ashirvad47/L.C.D/tree/master/3627-find-minimum-time-to-reach-last-room-i) |

| [3628-find-minimum-time-to-reach-last-room-ii](https://github.com/ashirvad47/L.C.D/tree/master/3628-find-minimum-time-to-reach-last-room-ii) |

| [3648-find-the-maximum-number-of-fruits-collected](https://github.com/ashirvad47/L.C.D/tree/master/3648-find-the-maximum-number-of-fruits-collected) |

| [3733-length-of-longest-v-shaped-diagonal-segment](https://github.com/ashirvad47/L.C.D/tree/master/3733-length-of-longest-v-shaped-diagonal-segment) |

## Breadth-First Search

|  |

| ------- |

| [0100-same-tree](https://github.com/ashirvad47/L.C.D/tree/master/0100-same-tree) |

| [0101-symmetric-tree](https://github.com/ashirvad47/L.C.D/tree/master/0101-symmetric-tree) |

| [0102-binary-tree-level-order-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0102-binary-tree-level-order-traversal) |

| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0103-binary-tree-zigzag-level-order-traversal) |

| [0104-maximum-depth-of-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0104-maximum-depth-of-binary-tree) |

| [0112-path-sum](https://github.com/ashirvad47/L.C.D/tree/master/0112-path-sum) |

| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/ashirvad47/L.C.D/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |

| [0130-surrounded-regions](https://github.com/ashirvad47/L.C.D/tree/master/0130-surrounded-regions) |

| [0133-clone-graph](https://github.com/ashirvad47/L.C.D/tree/master/0133-clone-graph) |

| [0200-number-of-islands](https://github.com/ashirvad47/L.C.D/tree/master/0200-number-of-islands) |

| [0207-course-schedule](https://github.com/ashirvad47/L.C.D/tree/master/0207-course-schedule) |

| [0226-invert-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0226-invert-binary-tree) |

| [0279-perfect-squares](https://github.com/ashirvad47/L.C.D/tree/master/0279-perfect-squares) |

| [0322-coin-change](https://github.com/ashirvad47/L.C.D/tree/master/0322-coin-change) |

| [0399-evaluate-division](https://github.com/ashirvad47/L.C.D/tree/master/0399-evaluate-division) |

| [0407-trapping-rain-water-ii](https://github.com/ashirvad47/L.C.D/tree/master/0407-trapping-rain-water-ii) |

| [0530-minimum-absolute-difference-in-bst](https://github.com/ashirvad47/L.C.D/tree/master/0530-minimum-absolute-difference-in-bst) |

| [0542-01-matrix](https://github.com/ashirvad47/L.C.D/tree/master/0542-01-matrix) |

| [0637-average-of-levels-in-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0637-average-of-levels-in-binary-tree) |

| [0684-redundant-connection](https://github.com/ashirvad47/L.C.D/tree/master/0684-redundant-connection) |

| [0799-minimum-distance-between-bst-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0799-minimum-distance-between-bst-nodes) |

| [0820-find-eventual-safe-states](https://github.com/ashirvad47/L.C.D/tree/master/0820-find-eventual-safe-states) |

| [0854-making-a-large-island](https://github.com/ashirvad47/L.C.D/tree/master/0854-making-a-large-island) |

| [0896-smallest-subtree-with-all-the-deepest-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0896-smallest-subtree-with-all-the-deepest-nodes) |

| [0945-snakes-and-ladders](https://github.com/ashirvad47/L.C.D/tree/master/0945-snakes-and-ladders) |

| [1036-rotting-oranges](https://github.com/ashirvad47/L.C.D/tree/master/1036-rotting-oranges) |

| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/ashirvad47/L.C.D/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [1396-count-servers-that-communicate](https://github.com/ashirvad47/L.C.D/tree/master/1396-count-servers-that-communicate) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [1558-course-schedule-iv](https://github.com/ashirvad47/L.C.D/tree/master/1558-course-schedule-iv) |

| [1876-map-of-highest-peak](https://github.com/ashirvad47/L.C.D/tree/master/1876-map-of-highest-peak) |

| [2493-reverse-odd-levels-of-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/2493-reverse-odd-levels-of-binary-tree) |

| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/ashirvad47/L.C.D/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |

| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/ashirvad47/L.C.D/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |

| [2564-most-profitable-path-in-a-tree](https://github.com/ashirvad47/L.C.D/tree/master/2564-most-profitable-path-in-a-tree) |

| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/ashirvad47/L.C.D/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |

| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/2646-kth-largest-sum-in-a-binary-tree) |

| [2677-cousins-in-binary-tree-ii](https://github.com/ashirvad47/L.C.D/tree/master/2677-cousins-in-binary-tree-ii) |

| [2764-maximum-number-of-fish-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/2764-maximum-number-of-fish-in-a-grid) |

| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/ashirvad47/L.C.D/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |

| [3633-maximize-the-number-of-target-nodes-after-connecting-trees-i](https://github.com/ashirvad47/L.C.D/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i) |

## Bit Manipulation

|  |

| ------- |

| [0067-add-binary](https://github.com/ashirvad47/L.C.D/tree/master/0067-add-binary) |

| [0078-subsets](https://github.com/ashirvad47/L.C.D/tree/master/0078-subsets) |

| [0090-subsets-ii](https://github.com/ashirvad47/L.C.D/tree/master/0090-subsets-ii) |

| [0222-count-complete-tree-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0222-count-complete-tree-nodes) |

| [0231-power-of-two](https://github.com/ashirvad47/L.C.D/tree/master/0231-power-of-two) |

| [0287-find-the-duplicate-number](https://github.com/ashirvad47/L.C.D/tree/master/0287-find-the-duplicate-number) |

| [0338-counting-bits](https://github.com/ashirvad47/L.C.D/tree/master/0338-counting-bits) |

| [0934-bitwise-ors-of-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/0934-bitwise-ors-of-subarrays) |

| [1940-maximum-xor-for-each-query](https://github.com/ashirvad47/L.C.D/tree/master/1940-maximum-xor-for-each-query) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/ashirvad47/L.C.D/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2059-unique-length-3-palindromic-subsequences](https://github.com/ashirvad47/L.C.D/tree/master/2059-unique-length-3-palindromic-subsequences) |

| [2162-partition-array-into-two-arrays-to-minimize-sum-difference](https://github.com/ashirvad47/L.C.D/tree/master/2162-partition-array-into-two-arrays-to-minimize-sum-difference) |

| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/ashirvad47/L.C.D/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |

| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/ashirvad47/L.C.D/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |

| [2400-minimum-score-after-removals-on-a-tree](https://github.com/ashirvad47/L.C.D/tree/master/2400-minimum-score-after-removals-on-a-tree) |

| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/ashirvad47/L.C.D/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |

| [2509-minimize-xor](https://github.com/ashirvad47/L.C.D/tree/master/2509-minimize-xor) |

| [2533-bitwise-xor-of-all-pairings](https://github.com/ashirvad47/L.C.D/tree/master/2533-bitwise-xor-of-all-pairings) |

| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/ashirvad47/L.C.D/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |

| [2792-neighboring-bitwise-xor](https://github.com/ashirvad47/L.C.D/tree/master/2792-neighboring-bitwise-xor) |

| [3291-find-if-array-can-be-sorted](https://github.com/ashirvad47/L.C.D/tree/master/3291-find-if-array-can-be-sorted) |

| [3307-find-the-maximum-sum-of-node-values](https://github.com/ashirvad47/L.C.D/tree/master/3307-find-the-maximum-sum-of-node-values) |

| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/ashirvad47/L.C.D/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |

| [3394-minimum-array-end](https://github.com/ashirvad47/L.C.D/tree/master/3394-minimum-array-end) |

| [3600-find-the-k-th-character-in-string-game-i](https://github.com/ashirvad47/L.C.D/tree/master/3600-find-the-k-th-character-in-string-game-i) |

## Tree

|  |

| ------- |

| [0094-binary-tree-inorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0094-binary-tree-inorder-traversal) |

| [0098-validate-binary-search-tree](https://github.com/ashirvad47/L.C.D/tree/master/0098-validate-binary-search-tree) |

| [0100-same-tree](https://github.com/ashirvad47/L.C.D/tree/master/0100-same-tree) |

| [0101-symmetric-tree](https://github.com/ashirvad47/L.C.D/tree/master/0101-symmetric-tree) |

| [0102-binary-tree-level-order-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0102-binary-tree-level-order-traversal) |

| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0103-binary-tree-zigzag-level-order-traversal) |

| [0104-maximum-depth-of-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0104-maximum-depth-of-binary-tree) |

| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |

| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |

| [0112-path-sum](https://github.com/ashirvad47/L.C.D/tree/master/0112-path-sum) |

| [0114-flatten-binary-tree-to-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/0114-flatten-binary-tree-to-linked-list) |

| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/ashirvad47/L.C.D/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |

| [0124-binary-tree-maximum-path-sum](https://github.com/ashirvad47/L.C.D/tree/master/0124-binary-tree-maximum-path-sum) |

| [0129-sum-root-to-leaf-numbers](https://github.com/ashirvad47/L.C.D/tree/master/0129-sum-root-to-leaf-numbers) |

| [0145-binary-tree-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0145-binary-tree-postorder-traversal) |

| [0173-binary-search-tree-iterator](https://github.com/ashirvad47/L.C.D/tree/master/0173-binary-search-tree-iterator) |

| [0222-count-complete-tree-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0222-count-complete-tree-nodes) |

| [0226-invert-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0226-invert-binary-tree) |

| [0230-kth-smallest-element-in-a-bst](https://github.com/ashirvad47/L.C.D/tree/master/0230-kth-smallest-element-in-a-bst) |

| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |

| [0530-minimum-absolute-difference-in-bst](https://github.com/ashirvad47/L.C.D/tree/master/0530-minimum-absolute-difference-in-bst) |

| [0637-average-of-levels-in-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0637-average-of-levels-in-binary-tree) |

| [0799-minimum-distance-between-bst-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0799-minimum-distance-between-bst-nodes) |

| [0896-smallest-subtree-with-all-the-deepest-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0896-smallest-subtree-with-all-the-deepest-nodes) |

| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |

| [0988-flip-equivalent-binary-trees](https://github.com/ashirvad47/L.C.D/tree/master/0988-flip-equivalent-binary-trees) |

| [1093-recover-a-tree-from-preorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/1093-recover-a-tree-from-preorder-traversal) |

| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/ashirvad47/L.C.D/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [2400-minimum-score-after-removals-on-a-tree](https://github.com/ashirvad47/L.C.D/tree/master/2400-minimum-score-after-removals-on-a-tree) |

| [2493-reverse-odd-levels-of-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/2493-reverse-odd-levels-of-binary-tree) |

| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/ashirvad47/L.C.D/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |

| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/ashirvad47/L.C.D/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |

| [2564-most-profitable-path-in-a-tree](https://github.com/ashirvad47/L.C.D/tree/master/2564-most-profitable-path-in-a-tree) |

| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/2646-kth-largest-sum-in-a-binary-tree) |

| [2677-cousins-in-binary-tree-ii](https://github.com/ashirvad47/L.C.D/tree/master/2677-cousins-in-binary-tree-ii) |

| [3058-maximum-number-of-k-divisible-components](https://github.com/ashirvad47/L.C.D/tree/master/3058-maximum-number-of-k-divisible-components) |

| [3307-find-the-maximum-sum-of-node-values](https://github.com/ashirvad47/L.C.D/tree/master/3307-find-the-maximum-sum-of-node-values) |

| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/ashirvad47/L.C.D/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |

| [3633-maximize-the-number-of-target-nodes-after-connecting-trees-i](https://github.com/ashirvad47/L.C.D/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i) |

## Binary Tree

|  |

| ------- |

| [0094-binary-tree-inorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0094-binary-tree-inorder-traversal) |

| [0098-validate-binary-search-tree](https://github.com/ashirvad47/L.C.D/tree/master/0098-validate-binary-search-tree) |

| [0100-same-tree](https://github.com/ashirvad47/L.C.D/tree/master/0100-same-tree) |

| [0101-symmetric-tree](https://github.com/ashirvad47/L.C.D/tree/master/0101-symmetric-tree) |

| [0102-binary-tree-level-order-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0102-binary-tree-level-order-traversal) |

| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0103-binary-tree-zigzag-level-order-traversal) |

| [0104-maximum-depth-of-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0104-maximum-depth-of-binary-tree) |

| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |

| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |

| [0112-path-sum](https://github.com/ashirvad47/L.C.D/tree/master/0112-path-sum) |

| [0114-flatten-binary-tree-to-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/0114-flatten-binary-tree-to-linked-list) |

| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/ashirvad47/L.C.D/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |

| [0124-binary-tree-maximum-path-sum](https://github.com/ashirvad47/L.C.D/tree/master/0124-binary-tree-maximum-path-sum) |

| [0129-sum-root-to-leaf-numbers](https://github.com/ashirvad47/L.C.D/tree/master/0129-sum-root-to-leaf-numbers) |

| [0145-binary-tree-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0145-binary-tree-postorder-traversal) |

| [0173-binary-search-tree-iterator](https://github.com/ashirvad47/L.C.D/tree/master/0173-binary-search-tree-iterator) |

| [0222-count-complete-tree-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0222-count-complete-tree-nodes) |

| [0226-invert-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0226-invert-binary-tree) |

| [0230-kth-smallest-element-in-a-bst](https://github.com/ashirvad47/L.C.D/tree/master/0230-kth-smallest-element-in-a-bst) |

| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |

| [0530-minimum-absolute-difference-in-bst](https://github.com/ashirvad47/L.C.D/tree/master/0530-minimum-absolute-difference-in-bst) |

| [0637-average-of-levels-in-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/0637-average-of-levels-in-binary-tree) |

| [0799-minimum-distance-between-bst-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0799-minimum-distance-between-bst-nodes) |

| [0896-smallest-subtree-with-all-the-deepest-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0896-smallest-subtree-with-all-the-deepest-nodes) |

| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |

| [0988-flip-equivalent-binary-trees](https://github.com/ashirvad47/L.C.D/tree/master/0988-flip-equivalent-binary-trees) |

| [1093-recover-a-tree-from-preorder-traversal](https://github.com/ashirvad47/L.C.D/tree/master/1093-recover-a-tree-from-preorder-traversal) |

| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/ashirvad47/L.C.D/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |

| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |

| [2493-reverse-odd-levels-of-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/2493-reverse-odd-levels-of-binary-tree) |

| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/ashirvad47/L.C.D/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |

| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/ashirvad47/L.C.D/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |

| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/ashirvad47/L.C.D/tree/master/2646-kth-largest-sum-in-a-binary-tree) |

| [2677-cousins-in-binary-tree-ii](https://github.com/ashirvad47/L.C.D/tree/master/2677-cousins-in-binary-tree-ii) |

## Number Theory

|  |

| ------- |

| [2716-prime-subtraction-operation](https://github.com/ashirvad47/L.C.D/tree/master/2716-prime-subtraction-operation) |

| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/ashirvad47/L.C.D/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |

## Memoization

|  |

| ------- |

| [0070-climbing-stairs](https://github.com/ashirvad47/L.C.D/tree/master/0070-climbing-stairs) |

| [0139-word-break](https://github.com/ashirvad47/L.C.D/tree/master/0139-word-break) |

| [2028-the-earliest-and-latest-rounds-where-players-compete](https://github.com/ashirvad47/L.C.D/tree/master/2028-the-earliest-and-latest-rounds-where-players-compete) |

| [3733-length-of-longest-v-shaped-diagonal-segment](https://github.com/ashirvad47/L.C.D/tree/master/3733-length-of-longest-v-shaped-diagonal-segment) |

## Queue

|  |

| ------- |

| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/ashirvad47/L.C.D/tree/master/2180-maximum-number-of-tasks-you-can-assign) |

| [2527-count-subarrays-with-fixed-bounds](https://github.com/ashirvad47/L.C.D/tree/master/2527-count-subarrays-with-fixed-bounds) |

| [2868-continuous-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/2868-continuous-subarrays) |

## Ordered Set

|  |

| ------- |

| [2162-partition-array-into-two-arrays-to-minimize-sum-difference](https://github.com/ashirvad47/L.C.D/tree/master/2162-partition-array-into-two-arrays-to-minimize-sum-difference) |

| [2434-design-a-number-container-system](https://github.com/ashirvad47/L.C.D/tree/master/2434-design-a-number-container-system) |

| [2868-continuous-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/2868-continuous-subarrays) |

| [3791-fruits-into-baskets-iii](https://github.com/ashirvad47/L.C.D/tree/master/3791-fruits-into-baskets-iii) |

## Monotonic Queue

|  |

| ------- |

| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/ashirvad47/L.C.D/tree/master/2180-maximum-number-of-tasks-you-can-assign) |

| [2527-count-subarrays-with-fixed-bounds](https://github.com/ashirvad47/L.C.D/tree/master/2527-count-subarrays-with-fixed-bounds) |

| [2868-continuous-subarrays](https://github.com/ashirvad47/L.C.D/tree/master/2868-continuous-subarrays) |

## Binary Indexed Tree

|  |

| ------- |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/ashirvad47/L.C.D/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

## Segment Tree

|  |

| ------- |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/ashirvad47/L.C.D/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

| [3789-maximize-subarrays-after-removing-one-conflicting-pair](https://github.com/ashirvad47/L.C.D/tree/master/3789-maximize-subarrays-after-removing-one-conflicting-pair) |

| [3791-fruits-into-baskets-iii](https://github.com/ashirvad47/L.C.D/tree/master/3791-fruits-into-baskets-iii) |

## Graph

|  |

| ------- |

| [0133-clone-graph](https://github.com/ashirvad47/L.C.D/tree/master/0133-clone-graph) |

| [0207-course-schedule](https://github.com/ashirvad47/L.C.D/tree/master/0207-course-schedule) |

| [0399-evaluate-division](https://github.com/ashirvad47/L.C.D/tree/master/0399-evaluate-division) |

| [0684-redundant-connection](https://github.com/ashirvad47/L.C.D/tree/master/0684-redundant-connection) |

| [0820-find-eventual-safe-states](https://github.com/ashirvad47/L.C.D/tree/master/0820-find-eventual-safe-states) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [1558-course-schedule-iv](https://github.com/ashirvad47/L.C.D/tree/master/1558-course-schedule-iv) |

| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/ashirvad47/L.C.D/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |

| [2438-find-closest-node-to-given-two-nodes](https://github.com/ashirvad47/L.C.D/tree/master/2438-find-closest-node-to-given-two-nodes) |

| [2564-most-profitable-path-in-a-tree](https://github.com/ashirvad47/L.C.D/tree/master/2564-most-profitable-path-in-a-tree) |

| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/ashirvad47/L.C.D/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |

| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/ashirvad47/L.C.D/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |

| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/ashirvad47/L.C.D/tree/master/3627-find-minimum-time-to-reach-last-room-i) |

| [3628-find-minimum-time-to-reach-last-room-ii](https://github.com/ashirvad47/L.C.D/tree/master/3628-find-minimum-time-to-reach-last-room-ii) |

## Rolling Hash

|  |

| ------- |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/ashirvad47/L.C.D/tree/master/3309-count-prefix-and-suffix-pairs-i) |

## Hash Function

|  |

| ------- |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/ashirvad47/L.C.D/tree/master/3309-count-prefix-and-suffix-pairs-i) |

## Brainteaser

|  |

| ------- |

| [2533-bitwise-xor-of-all-pairings](https://github.com/ashirvad47/L.C.D/tree/master/2533-bitwise-xor-of-all-pairings) |

## Shortest Path

|  |

| ------- |

| [0399-evaluate-division](https://github.com/ashirvad47/L.C.D/tree/master/0399-evaluate-division) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ashirvad47/L.C.D/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/ashirvad47/L.C.D/tree/master/3627-find-minimum-time-to-reach-last-room-i) |

| [3628-find-minimum-time-to-reach-last-room-ii](https://github.com/ashirvad47/L.C.D/tree/master/3628-find-minimum-time-to-reach-last-room-ii) |

## Topological Sort

|  |

| ------- |

| [0207-course-schedule](https://github.com/ashirvad47/L.C.D/tree/master/0207-course-schedule) |

| [0820-find-eventual-safe-states](https://github.com/ashirvad47/L.C.D/tree/master/0820-find-eventual-safe-states) |

| [1558-course-schedule-iv](https://github.com/ashirvad47/L.C.D/tree/master/1558-course-schedule-iv) |

| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/ashirvad47/L.C.D/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |

## Binary Search Tree

|  |

| ------- |

| [0098-validate-binary-search-tree](https://github.com/ashirvad47/L.C.D/tree/master/0098-validate-binary-search-tree) |

| [0173-binary-search-tree-iterator](https://github.com/ashirvad47/L.C.D/tree/master/0173-binary-search-tree-iterator) |

| [0230-kth-smallest-element-in-a-bst](https://github.com/ashirvad47/L.C.D/tree/master/0230-kth-smallest-element-in-a-bst) |

| [0530-minimum-absolute-difference-in-bst](https://github.com/ashirvad47/L.C.D/tree/master/0530-minimum-absolute-difference-in-bst) |

| [0799-minimum-distance-between-bst-nodes](https://github.com/ashirvad47/L.C.D/tree/master/0799-minimum-distance-between-bst-nodes) |

## Iterator

|  |

| ------- |

| [0173-binary-search-tree-iterator](https://github.com/ashirvad47/L.C.D/tree/master/0173-binary-search-tree-iterator) |

## Data Stream

|  |

| ------- |

| [1477-product-of-the-last-k-numbers](https://github.com/ashirvad47/L.C.D/tree/master/1477-product-of-the-last-k-numbers) |

## Combinatorics

|  |

| ------- |

| [0062-unique-paths](https://github.com/ashirvad47/L.C.D/tree/master/0062-unique-paths) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/ashirvad47/L.C.D/tree/master/1993-sum-of-all-subset-xor-totals) |

| [3201-distribute-candies-among-children-ii](https://github.com/ashirvad47/L.C.D/tree/master/3201-distribute-candies-among-children-ii) |

| [3637-count-number-of-balanced-permutations](https://github.com/ashirvad47/L.C.D/tree/master/3637-count-number-of-balanced-permutations) |

| [3682-count-the-number-of-arrays-with-k-matching-adjacent-elements](https://github.com/ashirvad47/L.C.D/tree/master/3682-count-the-number-of-arrays-with-k-matching-adjacent-elements) |

## Bitmask

|  |

| ------- |

| [2162-partition-array-into-two-arrays-to-minimize-sum-difference](https://github.com/ashirvad47/L.C.D/tree/master/2162-partition-array-into-two-arrays-to-minimize-sum-difference) |

## Probability and Statistics

|  |

| ------- |

| [0826-soup-servings](https://github.com/ashirvad47/L.C.D/tree/master/0826-soup-servings) |

| [0867-new-21-game](https://github.com/ashirvad47/L.C.D/tree/master/0867-new-21-game) |