DataStructures_and_Algorithms

KO | EN

gitlite — search

#javascript #python #hacktoberfest #ai #typescript #llm #macos #nodejs #java #vue #awesome-list #pytorch #mcp #ios

DataStructures_and_Algorithms

(★ 7)

A repository of Leetcode solutions for interesting DSA problems

DataStructures_and_Algorithms Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# LeetCode Topics
## Dynamic Programming
|  |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0005-longest-palindromic-substring) |
| [0010-regular-expression-matching](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0010-regular-expression-matching) |
| [0022-generate-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0022-generate-parentheses) |
| [0032-longest-valid-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0032-longest-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0042-trapping-rain-water) |
| [0044-wildcard-matching](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0044-wildcard-matching) |
| [0045-jump-game-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0045-jump-game-ii) |
| [0053-maximum-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0053-maximum-subarray) |
| [0055-jump-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0055-jump-game) |
| [0062-unique-paths](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0062-unique-paths) |
| [0064-minimum-path-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0064-minimum-path-sum) |
| [0070-climbing-stairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0070-climbing-stairs) |
| [0072-edit-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0072-edit-distance) |
| [0085-maximal-rectangle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0085-maximal-rectangle) |
| [0091-decode-ways](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0091-decode-ways) |
| [0097-interleaving-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0097-interleaving-string) |
| [0115-distinct-subsequences](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0115-distinct-subsequences) |
| [0118-pascals-triangle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0118-pascals-triangle) |
| [0120-triangle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0120-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0124-binary-tree-maximum-path-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0124-binary-tree-maximum-path-sum) |
| [0131-palindrome-partitioning](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0131-palindrome-partitioning) |
| [0139-word-break](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0139-word-break) |
| [0152-maximum-product-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0152-maximum-product-subarray) |
| [0174-dungeon-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0174-dungeon-game) |
| [0188-best-time-to-buy-and-sell-stock-iv](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0188-best-time-to-buy-and-sell-stock-iv) |
| [0198-house-robber](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0198-house-robber) |
| [0213-house-robber-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0213-house-robber-ii) |
| [0221-maximal-square](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0221-maximal-square) |
| [0300-longest-increasing-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0300-longest-increasing-subsequence) |
| [0309-best-time-to-buy-and-sell-stock-with-cooldown](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0309-best-time-to-buy-and-sell-stock-with-cooldown) |
| [0312-burst-balloons](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0312-burst-balloons) |
| [0322-coin-change](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0322-coin-change) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0337-house-robber-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0337-house-robber-iii) |
| [0354-russian-doll-envelopes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0354-russian-doll-envelopes) |
| [0368-largest-divisible-subset](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0368-largest-divisible-subset) |
| [0410-split-array-largest-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0410-split-array-largest-sum) |
| [0416-partition-equal-subset-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0416-partition-equal-subset-sum) |
| [0435-non-overlapping-intervals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0435-non-overlapping-intervals) |
| [0487-max-consecutive-ones-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0487-max-consecutive-ones-ii) |
| [0494-target-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0494-target-sum) |
| [0516-longest-palindromic-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0516-longest-palindromic-subsequence) |
| [0518-coin-change-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0518-coin-change-ii) |
| [0542-01-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0542-01-matrix) |
| [0646-maximum-length-of-pair-chain](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0646-maximum-length-of-pair-chain) |
| [0647-palindromic-substrings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0647-palindromic-substrings) |
| [0678-valid-parenthesis-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0678-valid-parenthesis-string) |
| [0688-knight-probability-in-chessboard](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0688-knight-probability-in-chessboard) |
| [0747-min-cost-climbing-stairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0747-min-cost-climbing-stairs) |
| [0787-sliding-puzzle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0787-sliding-puzzle) |
| [0803-cheapest-flights-within-k-stops](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0803-cheapest-flights-within-k-stops) |
| [0806-domino-and-tromino-tiling](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0806-domino-and-tromino-tiling) |
| [0863-sum-of-distances-in-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0863-sum-of-distances-in-tree) |
| [0868-push-dominoes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0868-push-dominoes) |
| [0875-longest-mountain-in-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0875-longest-mountain-in-array) |
| [0877-shortest-path-visiting-all-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0877-shortest-path-visiting-all-nodes) |
| [0905-length-of-longest-fibonacci-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0905-length-of-longest-fibonacci-subsequence) |
| [0911-profitable-schemes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0911-profitable-schemes) |
| [0930-all-possible-full-binary-trees](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0930-all-possible-full-binary-trees) |
| [0934-bitwise-ors-of-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0934-bitwise-ors-of-subarrays) |
| [0943-sum-of-subarray-minimums](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0943-sum-of-subarray-minimums) |
| [0962-flip-string-to-monotone-increasing](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0962-flip-string-to-monotone-increasing) |
| [1130-last-stone-weight-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1130-last-stone-weight-ii) |
| [1170-shortest-common-supersequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1170-shortest-common-supersequence) |
| [1178-valid-palindrome-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1178-valid-palindrome-iii) |
| [1250-longest-common-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1250-longest-common-subsequence) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [1474-longest-zigzag-path-in-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1474-longest-zigzag-path-in-a-binary-tree) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1628-count-submatrices-with-all-ones](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1628-count-submatrices-with-all-ones) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1849-maximum-absolute-sum-of-any-subarray) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [1881-closest-subsequence-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1881-closest-subsequence-sum) |
| [1986-largest-color-value-in-a-directed-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1986-largest-color-value-in-a-directed-graph) |
| [2061-painting-a-grid-with-three-different-colors](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2061-painting-a-grid-with-three-different-colors) |
| [2090-number-of-ways-to-arrive-at-destination](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2090-number-of-ways-to-arrive-at-destination) |
| [2164-two-best-non-overlapping-events](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2164-two-best-non-overlapping-events) |
| [2262-solving-questions-with-brainpower](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2262-solving-questions-with-brainpower) |
| [2415-count-the-number-of-ideal-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2415-count-the-number-of-ideal-arrays) |
| [3142-longest-unequal-adjacent-groups-subsequence-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3142-longest-unequal-adjacent-groups-subsequence-ii) |
| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |
| [3243-count-the-number-of-powerful-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3243-count-the-number-of-powerful-integers) |
| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |
| [3491-find-the-maximum-length-of-valid-subsequence-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3491-find-the-maximum-length-of-valid-subsequence-ii) |
| [3630-total-characters-in-string-after-transformations-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3630-total-characters-in-string-after-transformations-ii) |
| [3637-count-number-of-balanced-permutations](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3637-count-number-of-balanced-permutations) |
## Tree
|  |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0110-balanced-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0110-balanced-binary-tree) |
| [0112-path-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0113-path-sum-ii) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |
| [0124-binary-tree-maximum-path-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0129-sum-root-to-leaf-numbers) |
| [0173-binary-search-tree-iterator](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0173-binary-search-tree-iterator) |
| [0199-binary-tree-right-side-view](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0199-binary-tree-right-side-view) |
| [0226-invert-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0257-binary-tree-paths) |
| [0285-inorder-successor-in-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0285-inorder-successor-in-bst) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0314-binary-tree-vertical-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0314-binary-tree-vertical-order-traversal) |
| [0337-house-robber-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0337-house-robber-iii) |
| [0404-sum-of-left-leaves](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0404-sum-of-left-leaves) |
| [0437-path-sum-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0437-path-sum-iii) |
| [0449-serialize-and-deserialize-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0449-serialize-and-deserialize-bst) |
| [0543-diameter-of-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0543-diameter-of-binary-tree) |
| [0572-subtree-of-another-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0572-subtree-of-another-tree) |
| [0652-find-duplicate-subtrees](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0652-find-duplicate-subtrees) |
| [0655-print-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0655-print-binary-tree) |
| [0758-convert-binary-search-tree-to-sorted-doubly-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0758-convert-binary-search-tree-to-sorted-doubly-linked-list) |
| [0765-serialize-and-deserialize-n-ary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0765-serialize-and-deserialize-n-ary-tree) |
| [0789-kth-largest-element-in-a-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0789-kth-largest-element-in-a-stream) |
| [0799-minimum-distance-between-bst-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0799-minimum-distance-between-bst-nodes) |
| [0863-sum-of-distances-in-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0863-sum-of-distances-in-tree) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [0896-smallest-subtree-with-all-the-deepest-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0896-smallest-subtree-with-all-the-deepest-nodes) |
| [0930-all-possible-full-binary-trees](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0930-all-possible-full-binary-trees) |
| [0975-range-sum-of-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0975-range-sum-of-bst) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1079-sum-of-root-to-leaf-binary-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1079-sum-of-root-to-leaf-binary-numbers) |
| [1177-tree-diameter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1177-tree-diameter) |
| [1207-delete-nodes-and-return-forest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1207-delete-nodes-and-return-forest) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [1254-deepest-leaves-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1254-deepest-leaves-sum) |
| [1275-validate-binary-tree-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1275-validate-binary-tree-nodes) |
| [1474-longest-zigzag-path-in-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1474-longest-zigzag-path-in-a-binary-tree) |
| [1544-count-good-nodes-in-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1544-count-good-nodes-in-binary-tree) |
| [1790-lowest-common-ancestor-of-a-binary-tree-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1790-lowest-common-ancestor-of-a-binary-tree-iii) |
| [1883-find-distance-in-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1883-find-distance-in-a-binary-tree) |
| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |
| [3633-maximize-the-number-of-target-nodes-after-connecting-trees-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i) |
## Recursion
|  |
| ------- |
| [0002-add-two-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0002-add-two-numbers) |
| [0010-regular-expression-matching](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0010-regular-expression-matching) |
| [0021-merge-two-sorted-lists](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0021-merge-two-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0024-swap-nodes-in-pairs) |
| [0025-reverse-nodes-in-k-group](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0025-reverse-nodes-in-k-group) |
| [0044-wildcard-matching](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0044-wildcard-matching) |
| [0050-powx-n](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0050-powx-n) |
| [0143-reorder-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0143-reorder-list) |
| [0206-reverse-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0206-reverse-linked-list) |
| [0224-basic-calculator](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0224-basic-calculator) |
| [0234-palindrome-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0234-palindrome-linked-list) |
| [0247-strobogrammatic-number-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0247-strobogrammatic-number-ii) |
| [0273-integer-to-english-words](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0273-integer-to-english-words) |
| [0326-power-of-three](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0326-power-of-three) |
| [0930-all-possible-full-binary-trees](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0930-all-possible-full-binary-trees) |
| [2050-count-good-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2050-count-good-numbers) |
## Memoization
|  |
| ------- |
| [0070-climbing-stairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0070-climbing-stairs) |
| [0139-word-break](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0139-word-break) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0787-sliding-puzzle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0787-sliding-puzzle) |
| [0930-all-possible-full-binary-trees](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0930-all-possible-full-binary-trees) |
| [1986-largest-color-value-in-a-directed-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1986-largest-color-value-in-a-directed-graph) |
## Binary Tree
|  |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0110-balanced-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0110-balanced-binary-tree) |
| [0112-path-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0113-path-sum-ii) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |
| [0124-binary-tree-maximum-path-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0129-sum-root-to-leaf-numbers) |
| [0173-binary-search-tree-iterator](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0173-binary-search-tree-iterator) |
| [0199-binary-tree-right-side-view](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0199-binary-tree-right-side-view) |
| [0226-invert-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0257-binary-tree-paths) |
| [0285-inorder-successor-in-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0285-inorder-successor-in-bst) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0314-binary-tree-vertical-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0314-binary-tree-vertical-order-traversal) |
| [0337-house-robber-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0337-house-robber-iii) |
| [0404-sum-of-left-leaves](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0404-sum-of-left-leaves) |
| [0437-path-sum-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0437-path-sum-iii) |
| [0449-serialize-and-deserialize-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0449-serialize-and-deserialize-bst) |
| [0543-diameter-of-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0543-diameter-of-binary-tree) |
| [0572-subtree-of-another-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0572-subtree-of-another-tree) |
| [0652-find-duplicate-subtrees](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0652-find-duplicate-subtrees) |
| [0655-print-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0655-print-binary-tree) |
| [0758-convert-binary-search-tree-to-sorted-doubly-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0758-convert-binary-search-tree-to-sorted-doubly-linked-list) |
| [0789-kth-largest-element-in-a-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0789-kth-largest-element-in-a-stream) |
| [0799-minimum-distance-between-bst-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0799-minimum-distance-between-bst-nodes) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [0896-smallest-subtree-with-all-the-deepest-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0896-smallest-subtree-with-all-the-deepest-nodes) |
| [0930-all-possible-full-binary-trees](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0930-all-possible-full-binary-trees) |
| [0975-range-sum-of-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0975-range-sum-of-bst) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1079-sum-of-root-to-leaf-binary-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1079-sum-of-root-to-leaf-binary-numbers) |
| [1207-delete-nodes-and-return-forest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1207-delete-nodes-and-return-forest) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [1254-deepest-leaves-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1254-deepest-leaves-sum) |
| [1275-validate-binary-tree-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1275-validate-binary-tree-nodes) |
| [1474-longest-zigzag-path-in-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1474-longest-zigzag-path-in-a-binary-tree) |
| [1544-count-good-nodes-in-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1544-count-good-nodes-in-binary-tree) |
| [1790-lowest-common-ancestor-of-a-binary-tree-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1790-lowest-common-ancestor-of-a-binary-tree-iii) |
| [1883-find-distance-in-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1883-find-distance-in-a-binary-tree) |
| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |
## Array
|  |
| ------- |
| [0001-two-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0004-median-of-two-sorted-arrays) |
| [0011-container-with-most-water](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0018-4sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0027-remove-element) |
| [0031-next-permutation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0031-next-permutation) |
| [0033-search-in-rotated-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0035-search-insert-position) |
| [0036-valid-sudoku](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0037-sudoku-solver) |
| [0039-combination-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0040-combination-sum-ii) |
| [0041-first-missing-positive](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0041-first-missing-positive) |
| [0042-trapping-rain-water](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0045-jump-game-ii) |
| [0046-permutations](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0047-permutations-ii) |
| [0048-rotate-image](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0048-rotate-image) |
| [0049-group-anagrams](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0049-group-anagrams) |
| [0051-n-queens](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0051-n-queens) |
| [0053-maximum-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0053-maximum-subarray) |
| [0054-spiral-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0054-spiral-matrix) |
| [0055-jump-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0055-jump-game) |
| [0056-merge-intervals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0056-merge-intervals) |
| [0057-insert-interval](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0057-insert-interval) |
| [0064-minimum-path-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0064-minimum-path-sum) |
| [0066-plus-one](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0066-plus-one) |
| [0068-text-justification](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0068-text-justification) |
| [0073-set-matrix-zeroes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0074-search-a-2d-matrix) |
| [0075-sort-colors](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0075-sort-colors) |
| [0078-subsets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0078-subsets) |
| [0079-word-search](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0079-word-search) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0084-largest-rectangle-in-histogram](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0085-maximal-rectangle) |
| [0088-merge-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0088-merge-sorted-array) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0118-pascals-triangle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0118-pascals-triangle) |
| [0120-triangle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0120-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0128-longest-consecutive-sequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0128-longest-consecutive-sequence) |
| [0130-surrounded-regions](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0130-surrounded-regions) |
| [0134-gas-station](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0134-gas-station) |
| [0135-candy](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0135-candy) |
| [0136-single-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0136-single-number) |
| [0137-single-number-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0137-single-number-ii) |
| [0139-word-break](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0139-word-break) |
| [0150-evaluate-reverse-polish-notation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0150-evaluate-reverse-polish-notation) |
| [0152-maximum-product-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0152-maximum-product-subarray) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0154-find-minimum-in-rotated-sorted-array-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0154-find-minimum-in-rotated-sorted-array-ii) |
| [0157-read-n-characters-given-read4](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0157-read-n-characters-given-read4) |
| [0158-read-n-characters-given-read4-ii-call-multiple-times](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0158-read-n-characters-given-read4-ii-call-multiple-times) |
| [0162-find-peak-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0162-find-peak-element) |
| [0163-missing-ranges](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0163-missing-ranges) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0169-majority-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0169-majority-element) |
| [0174-dungeon-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0174-dungeon-game) |
| [0188-best-time-to-buy-and-sell-stock-iv](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0188-best-time-to-buy-and-sell-stock-iv) |
| [0189-rotate-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0189-rotate-array) |
| [0198-house-robber](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0198-house-robber) |
| [0200-number-of-islands](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0200-number-of-islands) |
| [0204-count-primes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0204-count-primes) |
| [0209-minimum-size-subarray-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0209-minimum-size-subarray-sum) |
| [0212-word-search-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0212-word-search-ii) |
| [0213-house-robber-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0213-house-robber-ii) |
| [0215-kth-largest-element-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0215-kth-largest-element-in-an-array) |
| [0217-contains-duplicate](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0217-contains-duplicate) |
| [0218-the-skyline-problem](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0218-the-skyline-problem) |
| [0219-contains-duplicate-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0219-contains-duplicate-ii) |
| [0221-maximal-square](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0221-maximal-square) |
| [0229-majority-element-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0229-majority-element-ii) |
| [0238-product-of-array-except-self](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0238-product-of-array-except-self) |
| [0239-sliding-window-maximum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0239-sliding-window-maximum) |
| [0240-search-a-2d-matrix-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0240-search-a-2d-matrix-ii) |
| [0247-strobogrammatic-number-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0247-strobogrammatic-number-ii) |
| [0251-flatten-2d-vector](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0251-flatten-2d-vector) |
| [0252-meeting-rooms](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0252-meeting-rooms) |
| [0253-meeting-rooms-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0253-meeting-rooms-ii) |
| [0268-missing-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0268-missing-number) |
| [0269-alien-dictionary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0269-alien-dictionary) |
| [0271-encode-and-decode-strings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0271-encode-and-decode-strings) |
| [0283-move-zeroes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0283-move-zeroes) |
| [0286-walls-and-gates](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0286-walls-and-gates) |
| [0287-find-the-duplicate-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0287-find-the-duplicate-number) |
| [0300-longest-increasing-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0300-longest-increasing-subsequence) |
| [0303-range-sum-query-immutable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0303-range-sum-query-immutable) |
| [0304-range-sum-query-2d-immutable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0304-range-sum-query-2d-immutable) |
| [0307-range-sum-query-mutable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0307-range-sum-query-mutable) |
| [0309-best-time-to-buy-and-sell-stock-with-cooldown](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0309-best-time-to-buy-and-sell-stock-with-cooldown) |
| [0312-burst-balloons](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0312-burst-balloons) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0317-shortest-distance-from-all-buildings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0317-shortest-distance-from-all-buildings) |
| [0322-coin-change](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0322-coin-change) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0330-patching-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0330-patching-array) |
| [0334-increasing-triplet-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0334-increasing-triplet-subsequence) |
| [0346-moving-average-from-data-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0346-moving-average-from-data-stream) |
| [0347-top-k-frequent-elements](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0347-top-k-frequent-elements) |
| [0348-design-tic-tac-toe](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0348-design-tic-tac-toe) |
| [0349-intersection-of-two-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0350-intersection-of-two-arrays-ii) |
| [0353-design-snake-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0353-design-snake-game) |
| [0354-russian-doll-envelopes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0354-russian-doll-envelopes) |
| [0362-design-hit-counter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0362-design-hit-counter) |
| [0368-largest-divisible-subset](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0368-largest-divisible-subset) |
| [0370-range-addition](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0370-range-addition) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0380-insert-delete-getrandom-o1](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0380-insert-delete-getrandom-o1) |
| [0381-insert-delete-getrandom-o1-duplicates-allowed](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0381-insert-delete-getrandom-o1-duplicates-allowed) |
| [0384-shuffle-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0384-shuffle-an-array) |
| [0399-evaluate-division](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0399-evaluate-division) |
| [0410-split-array-largest-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0410-split-array-largest-sum) |
| [0416-partition-equal-subset-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0416-partition-equal-subset-sum) |
| [0417-pacific-atlantic-water-flow](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0417-pacific-atlantic-water-flow) |
| [0421-maximum-xor-of-two-numbers-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0421-maximum-xor-of-two-numbers-in-an-array) |
| [0435-non-overlapping-intervals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0435-non-overlapping-intervals) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0454-4sum-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0454-4sum-ii) |
| [0456-132-pattern](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0456-132-pattern) |
| [0480-sliding-window-median](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0480-sliding-window-median) |
| [0485-max-consecutive-ones](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0485-max-consecutive-ones) |
| [0487-max-consecutive-ones-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0487-max-consecutive-ones-ii) |
| [0490-the-maze](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0490-the-maze) |
| [0494-target-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0494-target-sum) |
| [0496-next-greater-element-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0496-next-greater-element-i) |
| [0502-ipo](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0502-ipo) |
| [0503-next-greater-element-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0503-next-greater-element-ii) |
| [0518-coin-change-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0518-coin-change-ii) |
| [0523-continuous-subarray-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0523-continuous-subarray-sum) |
| [0525-contiguous-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0525-contiguous-array) |
| [0529-minesweeper](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0529-minesweeper) |
| [0540-single-element-in-a-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0540-single-element-in-a-sorted-array) |
| [0542-01-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0542-01-matrix) |
| [0560-subarray-sum-equals-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0560-subarray-sum-equals-k) |
| [0594-longest-harmonious-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0594-longest-harmonious-subsequence) |
| [0621-task-scheduler](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0621-task-scheduler) |
| [0630-course-schedule-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0630-course-schedule-iii) |
| [0636-exclusive-time-of-functions](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0636-exclusive-time-of-functions) |
| [0646-maximum-length-of-pair-chain](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0646-maximum-length-of-pair-chain) |
| [0674-longest-continuous-increasing-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0674-longest-continuous-increasing-subsequence) |
| [0679-24-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0679-24-game) |
| [0695-max-area-of-island](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0695-max-area-of-island) |
| [0713-subarray-product-less-than-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0713-subarray-product-less-than-k) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0721-accounts-merge](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0721-accounts-merge) |
| [0723-candy-crush](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0723-candy-crush) |
| [0724-find-pivot-index](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0724-find-pivot-index) |
| [0731-my-calendar-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0731-my-calendar-ii) |
| [0733-flood-fill](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0733-flood-fill) |
| [0735-asteroid-collision](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0735-asteroid-collision) |
| [0739-daily-temperatures](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0739-daily-temperatures) |
| [0747-min-cost-climbing-stairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0747-min-cost-climbing-stairs) |
| [0753-open-the-lock](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0753-open-the-lock) |
| [0761-employee-free-time](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0761-employee-free-time) |
| [0762-find-anagram-mappings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0762-find-anagram-mappings) |
| [0787-sliding-puzzle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0787-sliding-puzzle) |
| [0788-minimize-max-distance-to-gas-station](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0788-minimize-max-distance-to-gas-station) |
| [0792-binary-search](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0792-binary-search) |
| [0797-rabbits-in-forest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0797-rabbits-in-forest) |
| [0833-bus-routes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0833-bus-routes) |
| [0875-longest-mountain-in-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0875-longest-mountain-in-array) |
| [0876-hand-of-straights](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0876-hand-of-straights) |
| [0882-peak-index-in-a-mountain-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0882-peak-index-in-a-mountain-array) |
| [0890-lemonade-change](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0890-lemonade-change) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [0905-length-of-longest-fibonacci-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0905-length-of-longest-fibonacci-subsequence) |
| [0907-koko-eating-bananas](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0907-koko-eating-bananas) |
| [0911-profitable-schemes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0911-profitable-schemes) |
| [0934-bitwise-ors-of-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0934-bitwise-ors-of-subarrays) |
| [0940-fruit-into-baskets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0940-fruit-into-baskets) |
| [0943-sum-of-subarray-minimums](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0943-sum-of-subarray-minimums) |
| [0965-unique-email-addresses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0965-unique-email-addresses) |
| [0971-shortest-bridge](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0971-shortest-bridge) |
| [0990-verifying-an-alien-dictionary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0990-verifying-an-alien-dictionary) |
| [1014-k-closest-points-to-origin](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1014-k-closest-points-to-origin) |
| [1016-subarray-sums-divisible-by-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1016-subarray-sums-divisible-by-k) |
| [1028-interval-list-intersections](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1028-interval-list-intersections) |
| [1034-subarrays-with-k-different-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1034-subarrays-with-k-different-integers) |
| [1036-rotting-oranges](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1036-rotting-oranges) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1046-max-consecutive-ones-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1046-max-consecutive-ones-iii) |
| [1049-minimum-domino-rotations-for-equal-row](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1049-minimum-domino-rotations-for-equal-row) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1055-pairs-of-songs-with-total-durations-divisible-by-60](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1055-pairs-of-songs-with-total-durations-divisible-by-60) |
| [1056-capacity-to-ship-packages-within-d-days](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1056-capacity-to-ship-packages-within-d-days) |
| [1095-two-city-scheduling](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1095-two-city-scheduling) |
| [1107-minimum-swaps-to-group-all-1s-together](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1107-minimum-swaps-to-group-all-1s-together) |
| [1126-minimum-cost-to-connect-sticks](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1126-minimum-cost-to-connect-sticks) |
| [1127-last-stone-weight](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1127-last-stone-weight) |
| [1130-last-stone-weight-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1130-last-stone-weight-ii) |
| [1145-number-of-submatrices-that-sum-to-target](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1145-number-of-submatrices-that-sum-to-target) |
| [1171-shortest-path-in-binary-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1171-shortest-path-in-binary-matrix) |
| [1207-delete-nodes-and-return-forest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1207-delete-nodes-and-return-forest) |
| [1227-number-of-equivalent-domino-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1227-number-of-equivalent-domino-pairs) |
| [1293-three-consecutive-odds](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1293-three-consecutive-odds) |
| [1305-number-of-visible-people-in-a-queue](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1305-number-of-visible-people-in-a-queue) |
| [1306-minimum-absolute-difference](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1306-minimum-absolute-difference) |
| [1324-where-will-the-ball-fall](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1324-where-will-the-ball-fall) |
| [1335-maximum-candies-allocated-to-k-children](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1335-maximum-candies-allocated-to-k-children) |
| [1370-count-number-of-nice-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1370-count-number-of-nice-subarrays) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |
| [1414-shortest-path-in-a-grid-with-obstacles-elimination](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1414-shortest-path-in-a-grid-with-obstacles-elimination) |
| [1421-find-numbers-with-even-number-of-digits](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1421-find-numbers-with-even-number-of-digits) |
| [1428-jump-game-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1428-jump-game-iii) |
| [1435-xor-queries-of-a-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1435-xor-queries-of-a-subarray) |
| [1464-reduce-array-size-to-the-half](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1464-reduce-array-size-to-the-half) |
| [1476-count-negative-numbers-in-a-sorted-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1476-count-negative-numbers-in-a-sorted-matrix) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1605-minimum-number-of-days-to-make-m-bouquets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1605-minimum-number-of-days-to-make-m-bouquets) |
| [1628-count-submatrices-with-all-ones](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1628-count-submatrices-with-all-ones) |
| [1646-kth-missing-positive-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1646-kth-missing-positive-number) |
| [1656-count-good-triplets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1656-count-good-triplets) |
| [1663-detect-cycles-in-2d-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1663-detect-cycles-in-2d-grid) |
| [1706-min-cost-to-connect-all-points](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1706-min-cost-to-connect-all-points) |
| [1713-dot-product-of-two-sparse-vectors](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1713-dot-product-of-two-sparse-vectors) |
| [1753-path-with-minimum-effort](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1753-path-with-minimum-effort) |
| [1792-find-the-most-competitive-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1792-find-the-most-competitive-subsequence) |
| [1813-maximum-erasure-value](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1813-maximum-erasure-value) |
| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1849-maximum-absolute-sum-of-any-subarray) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [1881-closest-subsequence-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1881-closest-subsequence-sum) |
| [1909-buildings-with-an-ocean-view](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1909-buildings-with-an-ocean-view) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1966-frequency-of-the-most-frequent-element) |
| [1985-maximum-subarray-min-product](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1985-maximum-subarray-min-product) |
| [1993-sum-of-all-subset-xor-totals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1993-sum-of-all-subset-xor-totals) |
| [2026-merge-triplets-to-form-target-triplet](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2026-merge-triplets-to-form-target-triplet) |
| [2035-count-sub-islands](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2035-count-sub-islands) |
| [2048-build-array-from-permutation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2048-build-array-from-permutation) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
| [2164-two-best-non-overlapping-events](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2164-two-best-non-overlapping-events) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2180-maximum-number-of-tasks-you-can-assign) |
| [2215-finding-3-digit-even-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2215-finding-3-digit-even-numbers) |
| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2220-find-all-possible-recipes-from-given-supplies) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2249-count-the-hidden-sequences](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2249-count-the-hidden-sequences) |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
| [2262-solving-questions-with-brainpower](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2262-solving-questions-with-brainpower) |
| [2265-partition-array-according-to-given-pivot](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2265-partition-array-according-to-given-pivot) |
| [2277-count-equal-and-divisible-pairs-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2277-count-equal-and-divisible-pairs-in-an-array) |
| [2280-count-good-triplets-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2280-count-good-triplets-in-an-array) |
| [2308-divide-array-into-equal-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2308-divide-array-into-equal-pairs) |
| [2316-count-hills-and-valleys-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2316-count-hills-and-valleys-in-an-array) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2478-longest-nice-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2478-longest-nice-subarray) |
| [2479-meeting-rooms-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2479-meeting-rooms-iii) |
| [2483-task-scheduler-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2483-task-scheduler-ii) |
| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2527-count-subarrays-with-fixed-bounds) |
| [2551-apply-operations-to-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2551-apply-operations-to-an-array) |
| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [2625-increment-submatrices-by-one](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2625-increment-submatrices-by-one) |
| [2626-count-the-number-of-good-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2626-count-the-number-of-good-subarrays) |
| [2665-minimum-time-to-repair-cars](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2665-minimum-time-to-repair-cars) |
| [2681-put-marbles-in-bags](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2681-put-marbles-in-bags) |
| [2690-house-robber-iv](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2690-house-robber-iv) |
| [2699-count-the-number-of-fair-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2699-count-the-number-of-fair-pairs) |
| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2707-merge-two-2d-arrays-by-summing-values) |
| [2856-count-complete-subarrays-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2856-count-complete-subarrays-in-an-array) |
| [2888-minimum-index-of-a-valid-split](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2888-minimum-index-of-a-valid-split) |
| [2914-find-the-safest-path-in-a-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2914-find-the-safest-path-in-a-grid) |
| [2915-count-of-interesting-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2915-count-of-interesting-subarrays) |
| [3001-apply-operations-to-maximize-score](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3001-apply-operations-to-maximize-score) |
| [3142-longest-unequal-adjacent-groups-subsequence-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3142-longest-unequal-adjacent-groups-subsequence-ii) |
| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |
| [3152-maximum-value-of-an-ordered-triplet-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3152-maximum-value-of-an-ordered-triplet-ii) |
| [3154-maximum-value-of-an-ordered-triplet-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3154-maximum-value-of-an-ordered-triplet-i) |
| [3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros) |
| [3194-find-words-containing-character](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3194-find-words-containing-character) |
| [3213-count-subarrays-where-max-element-appears-at-least-k-times](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3213-count-subarrays-where-max-element-appears-at-least-k-times) |
| [3225-length-of-longest-subarray-with-at-most-k-frequency](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3225-length-of-longest-subarray-with-at-most-k-frequency) |
| [3227-find-missing-and-repeated-values](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3227-find-missing-and-repeated-values) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
| [3430-count-days-without-meetings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3430-count-days-without-meetings) |
| [3463-alternating-groups-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3463-alternating-groups-i) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
| [3483-alternating-groups-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3483-alternating-groups-ii) |
| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |
| [3491-find-the-maximum-length-of-valid-subsequence-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3491-find-the-maximum-length-of-valid-subsequence-ii) |
| [3621-minimum-operations-to-make-array-values-equal-to-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3621-minimum-operations-to-make-array-values-equal-to-k) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
| [3628-find-minimum-time-to-reach-last-room-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3628-find-minimum-time-to-reach-last-room-ii) |
| [3643-zero-array-transformation-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3643-zero-array-transformation-ii) |
| [3647-zero-array-transformation-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3647-zero-array-transformation-iii) |
| [3656-minimum-number-of-operations-to-make-elements-in-array-distinct](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3656-minimum-number-of-operations-to-make-elements-in-array-distinct) |
| [3657-check-if-grid-can-be-cut-into-sections](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3657-check-if-grid-can-be-cut-into-sections) |
| [3685-count-subarrays-of-length-three-with-a-condition](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3685-count-subarrays-of-length-three-with-a-condition) |
| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |
## Binary Search
|  |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0004-median-of-two-sorted-arrays) |
| [0033-search-in-rotated-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0035-search-insert-position) |
| [0069-sqrtx](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0069-sqrtx) |
| [0074-search-a-2d-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0074-search-a-2d-matrix) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0154-find-minimum-in-rotated-sorted-array-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0154-find-minimum-in-rotated-sorted-array-ii) |
| [0162-find-peak-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0209-minimum-size-subarray-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0209-minimum-size-subarray-sum) |
| [0240-search-a-2d-matrix-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0240-search-a-2d-matrix-ii) |
| [0268-missing-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0268-missing-number) |
| [0278-first-bad-version](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0278-first-bad-version) |
| [0287-find-the-duplicate-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0287-find-the-duplicate-number) |
| [0300-longest-increasing-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0300-longest-increasing-subsequence) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0349-intersection-of-two-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0350-intersection-of-two-arrays-ii) |
| [0354-russian-doll-envelopes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0354-russian-doll-envelopes) |
| [0362-design-hit-counter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0362-design-hit-counter) |
| [0374-guess-number-higher-or-lower](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0374-guess-number-higher-or-lower) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0410-split-array-largest-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0410-split-array-largest-sum) |
| [0456-132-pattern](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0456-132-pattern) |
| [0540-single-element-in-a-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0540-single-element-in-a-sorted-array) |
| [0668-kth-smallest-number-in-multiplication-table](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0668-kth-smallest-number-in-multiplication-table) |
| [0713-subarray-product-less-than-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0713-subarray-product-less-than-k) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0731-my-calendar-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0731-my-calendar-ii) |
| [0788-minimize-max-distance-to-gas-station](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0788-minimize-max-distance-to-gas-station) |
| [0792-binary-search](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0792-binary-search) |
| [0882-peak-index-in-a-mountain-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0882-peak-index-in-a-mountain-array) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [0907-koko-eating-bananas](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0907-koko-eating-bananas) |
| [1046-max-consecutive-ones-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1046-max-consecutive-ones-iii) |
| [1056-capacity-to-ship-packages-within-d-days](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1056-capacity-to-ship-packages-within-d-days) |
| [1335-maximum-candies-allocated-to-k-children](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1335-maximum-candies-allocated-to-k-children) |
| [1358-find-positive-integer-solution-for-a-given-equation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1358-find-positive-integer-solution-for-a-given-equation) |
| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |
| [1476-count-negative-numbers-in-a-sorted-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1476-count-negative-numbers-in-a-sorted-matrix) |
| [1605-minimum-number-of-days-to-make-m-bouquets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1605-minimum-number-of-days-to-make-m-bouquets) |
| [1646-kth-missing-positive-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1646-kth-missing-positive-number) |
| [1753-path-with-minimum-effort](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1753-path-with-minimum-effort) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2164-two-best-non-overlapping-events](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2164-two-best-non-overlapping-events) |
| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2180-maximum-number-of-tasks-you-can-assign) |
| [2280-count-good-triplets-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2280-count-good-triplets-in-an-array) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [2665-minimum-time-to-repair-cars](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2665-minimum-time-to-repair-cars) |
| [2690-house-robber-iv](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2690-house-robber-iv) |
| [2699-count-the-number-of-fair-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2699-count-the-number-of-fair-pairs) |
| [2914-find-the-safest-path-in-a-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2914-find-the-safest-path-in-a-grid) |
| [3643-zero-array-transformation-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3643-zero-array-transformation-ii) |
## Breadth-First Search
|  |
| ------- |
| [0100-same-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0104-maximum-depth-of-binary-tree) |
| [0112-path-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0112-path-sum) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |
| [0126-word-ladder-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0126-word-ladder-ii) |
| [0127-word-ladder](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0127-word-ladder) |
| [0130-surrounded-regions](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0130-surrounded-regions) |
| [0133-clone-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0133-clone-graph) |
| [0199-binary-tree-right-side-view](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0199-binary-tree-right-side-view) |
| [0200-number-of-islands](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0200-number-of-islands) |
| [0207-course-schedule](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0210-course-schedule-ii) |
| [0226-invert-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0226-invert-binary-tree) |
| [0261-graph-valid-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0261-graph-valid-tree) |
| [0269-alien-dictionary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0269-alien-dictionary) |
| [0286-walls-and-gates](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0286-walls-and-gates) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0301-remove-invalid-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0301-remove-invalid-parentheses) |
| [0314-binary-tree-vertical-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0314-binary-tree-vertical-order-traversal) |
| [0317-shortest-distance-from-all-buildings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0317-shortest-distance-from-all-buildings) |
| [0322-coin-change](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0322-coin-change) |
| [0323-number-of-connected-components-in-an-undirected-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0323-number-of-connected-components-in-an-undirected-graph) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0339-nested-list-weight-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0339-nested-list-weight-sum) |
| [0399-evaluate-division](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0399-evaluate-division) |
| [0404-sum-of-left-leaves](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0404-sum-of-left-leaves) |
| [0417-pacific-atlantic-water-flow](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0417-pacific-atlantic-water-flow) |
| [0433-minimum-genetic-mutation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0433-minimum-genetic-mutation) |
| [0449-serialize-and-deserialize-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0449-serialize-and-deserialize-bst) |
| [0490-the-maze](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0490-the-maze) |
| [0529-minesweeper](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0529-minesweeper) |
| [0542-01-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0542-01-matrix) |
| [0547-number-of-provinces](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0547-number-of-provinces) |
| [0655-print-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0655-print-binary-tree) |
| [0684-redundant-connection](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0684-redundant-connection) |
| [0695-max-area-of-island](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0695-max-area-of-island) |
| [0721-accounts-merge](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0721-accounts-merge) |
| [0733-flood-fill](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0733-flood-fill) |
| [0744-network-delay-time](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0744-network-delay-time) |
| [0753-open-the-lock](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0753-open-the-lock) |
| [0765-serialize-and-deserialize-n-ary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0765-serialize-and-deserialize-n-ary-tree) |
| [0787-sliding-puzzle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0787-sliding-puzzle) |
| [0799-minimum-distance-between-bst-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0799-minimum-distance-between-bst-nodes) |
| [0801-is-graph-bipartite](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0801-is-graph-bipartite) |
| [0803-cheapest-flights-within-k-stops](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0803-cheapest-flights-within-k-stops) |
| [0813-all-paths-from-source-to-target](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0813-all-paths-from-source-to-target) |
| [0833-bus-routes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0833-bus-routes) |
| [0877-shortest-path-visiting-all-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0877-shortest-path-visiting-all-nodes) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [0896-smallest-subtree-with-all-the-deepest-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0896-smallest-subtree-with-all-the-deepest-nodes) |
| [0971-shortest-bridge](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0971-shortest-bridge) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1036-rotting-oranges](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1036-rotting-oranges) |
| [1171-shortest-path-in-binary-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1171-shortest-path-in-binary-matrix) |
| [1177-tree-diameter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1177-tree-diameter) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [1254-deepest-leaves-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1254-deepest-leaves-sum) |
| [1275-validate-binary-tree-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1275-validate-binary-tree-nodes) |
| [1414-shortest-path-in-a-grid-with-obstacles-elimination](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1414-shortest-path-in-a-grid-with-obstacles-elimination) |
| [1428-jump-game-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1428-jump-game-iii) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1442-number-of-operations-to-make-network-connected) |
| [1544-count-good-nodes-in-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1544-count-good-nodes-in-binary-tree) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
| [1663-detect-cycles-in-2d-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1663-detect-cycles-in-2d-grid) |
| [1753-path-with-minimum-effort](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1753-path-with-minimum-effort) |
| [1883-find-distance-in-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1883-find-distance-in-a-binary-tree) |
| [2035-count-sub-islands](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2035-count-sub-islands) |
| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2793-count-the-number-of-complete-components](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2793-count-the-number-of-complete-components) |
| [2914-find-the-safest-path-in-a-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2914-find-the-safest-path-in-a-grid) |
| [3633-maximize-the-number-of-target-nodes-after-connecting-trees-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i) |
## Union Find
|  |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0128-longest-consecutive-sequence) |
| [0130-surrounded-regions](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0130-surrounded-regions) |
| [0200-number-of-islands](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0200-number-of-islands) |
| [0261-graph-valid-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0261-graph-valid-tree) |
| [0323-number-of-connected-components-in-an-undirected-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0323-number-of-connected-components-in-an-undirected-graph) |
| [0399-evaluate-division](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0399-evaluate-division) |
| [0547-number-of-provinces](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0547-number-of-provinces) |
| [0684-redundant-connection](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0684-redundant-connection) |
| [0695-max-area-of-island](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0695-max-area-of-island) |
| [0721-accounts-merge](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0721-accounts-merge) |
| [0801-is-graph-bipartite](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0801-is-graph-bipartite) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1275-validate-binary-tree-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1275-validate-binary-tree-nodes) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1442-number-of-operations-to-make-network-connected) |
| [1663-detect-cycles-in-2d-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1663-detect-cycles-in-2d-grid) |
| [1701-remove-max-number-of-edges-to-keep-graph-fully-traversable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1701-remove-max-number-of-edges-to-keep-graph-fully-traversable) |
| [1706-min-cost-to-connect-all-points](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1706-min-cost-to-connect-all-points) |
| [1753-path-with-minimum-effort](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1753-path-with-minimum-effort) |
| [2035-count-sub-islands](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2035-count-sub-islands) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2793-count-the-number-of-complete-components](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2793-count-the-number-of-complete-components) |
| [2914-find-the-safest-path-in-a-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2914-find-the-safest-path-in-a-grid) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
## Matrix
|  |
| ------- |
| [0036-valid-sudoku](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0037-sudoku-solver) |
| [0048-rotate-image](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0054-spiral-matrix) |
| [0064-minimum-path-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0064-minimum-path-sum) |
| [0073-set-matrix-zeroes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0074-search-a-2d-matrix) |
| [0079-word-search](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0079-word-search) |
| [0085-maximal-rectangle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0085-maximal-rectangle) |
| [0130-surrounded-regions](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0130-surrounded-regions) |
| [0174-dungeon-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0174-dungeon-game) |
| [0200-number-of-islands](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0200-number-of-islands) |
| [0212-word-search-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0212-word-search-ii) |
| [0221-maximal-square](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0221-maximal-square) |
| [0240-search-a-2d-matrix-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0240-search-a-2d-matrix-ii) |
| [0286-walls-and-gates](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0286-walls-and-gates) |
| [0304-range-sum-query-2d-immutable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0304-range-sum-query-2d-immutable) |
| [0317-shortest-distance-from-all-buildings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0317-shortest-distance-from-all-buildings) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0348-design-tic-tac-toe](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0348-design-tic-tac-toe) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0417-pacific-atlantic-water-flow](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0417-pacific-atlantic-water-flow) |
| [0490-the-maze](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0490-the-maze) |
| [0529-minesweeper](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0529-minesweeper) |
| [0542-01-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0542-01-matrix) |
| [0695-max-area-of-island](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0695-max-area-of-island) |
| [0723-candy-crush](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0723-candy-crush) |
| [0733-flood-fill](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0733-flood-fill) |
| [0787-sliding-puzzle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0787-sliding-puzzle) |
| [0971-shortest-bridge](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0971-shortest-bridge) |
| [1036-rotting-oranges](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1036-rotting-oranges) |
| [1145-number-of-submatrices-that-sum-to-target](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1145-number-of-submatrices-that-sum-to-target) |
| [1171-shortest-path-in-binary-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1171-shortest-path-in-binary-matrix) |
| [1324-where-will-the-ball-fall](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1324-where-will-the-ball-fall) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1414-shortest-path-in-a-grid-with-obstacles-elimination](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1414-shortest-path-in-a-grid-with-obstacles-elimination) |
| [1476-count-negative-numbers-in-a-sorted-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1476-count-negative-numbers-in-a-sorted-matrix) |
| [1628-count-submatrices-with-all-ones](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1628-count-submatrices-with-all-ones) |
| [1663-detect-cycles-in-2d-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1663-detect-cycles-in-2d-grid) |
| [1753-path-with-minimum-effort](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1753-path-with-minimum-effort) |
| [2035-count-sub-islands](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2035-count-sub-islands) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2625-increment-submatrices-by-one](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2625-increment-submatrices-by-one) |
| [2914-find-the-safest-path-in-a-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2914-find-the-safest-path-in-a-grid) |
| [3227-find-missing-and-repeated-values](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3227-find-missing-and-repeated-values) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
| [3628-find-minimum-time-to-reach-last-room-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3628-find-minimum-time-to-reach-last-room-ii) |
## Linked List
|  |
| ------- |
| [0002-add-two-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0021-merge-two-sorted-lists](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0021-merge-two-sorted-lists) |
| [0023-merge-k-sorted-lists](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0023-merge-k-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0024-swap-nodes-in-pairs) |
| [0025-reverse-nodes-in-k-group](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0025-reverse-nodes-in-k-group) |
| [0061-rotate-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0061-rotate-list) |
| [0092-reverse-linked-list-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0092-reverse-linked-list-ii) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |
| [0138-copy-list-with-random-pointer](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0138-copy-list-with-random-pointer) |
| [0141-linked-list-cycle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0142-linked-list-cycle-ii) |
| [0143-reorder-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0143-reorder-list) |
| [0146-lru-cache](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0146-lru-cache) |
| [0148-sort-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0160-intersection-of-two-linked-lists) |
| [0206-reverse-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0234-palindrome-linked-list) |
| [0328-odd-even-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0328-odd-even-linked-list) |
| [0445-add-two-numbers-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0445-add-two-numbers-ii) |
| [0460-lfu-cache](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0460-lfu-cache) |
| [0758-convert-binary-search-tree-to-sorted-doubly-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0758-convert-binary-search-tree-to-sorted-doubly-linked-list) |
| [0908-middle-of-the-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0908-middle-of-the-linked-list) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
## Depth-First Search
|  |
| ------- |
| [0079-word-search](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0079-word-search) |
| [0094-binary-tree-inorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0110-balanced-binary-tree) |
| [0112-path-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0113-path-sum-ii) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0116-populating-next-right-pointers-in-each-node](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0116-populating-next-right-pointers-in-each-node) |
| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |
| [0124-binary-tree-maximum-path-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0124-binary-tree-maximum-path-sum) |
| [0129-sum-root-to-leaf-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0129-sum-root-to-leaf-numbers) |
| [0130-surrounded-regions](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0130-surrounded-regions) |
| [0133-clone-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0133-clone-graph) |
| [0199-binary-tree-right-side-view](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0199-binary-tree-right-side-view) |
| [0200-number-of-islands](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0200-number-of-islands) |
| [0207-course-schedule](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0210-course-schedule-ii) |
| [0211-design-add-and-search-words-data-structure](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0211-design-add-and-search-words-data-structure) |
| [0226-invert-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0257-binary-tree-paths) |
| [0261-graph-valid-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0261-graph-valid-tree) |
| [0269-alien-dictionary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0269-alien-dictionary) |
| [0285-inorder-successor-in-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0285-inorder-successor-in-bst) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0314-binary-tree-vertical-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0314-binary-tree-vertical-order-traversal) |
| [0323-number-of-connected-components-in-an-undirected-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0323-number-of-connected-components-in-an-undirected-graph) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0332-reconstruct-itinerary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0332-reconstruct-itinerary) |
| [0337-house-robber-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0337-house-robber-iii) |
| [0339-nested-list-weight-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0339-nested-list-weight-sum) |
| [0399-evaluate-division](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0399-evaluate-division) |
| [0404-sum-of-left-leaves](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0404-sum-of-left-leaves) |
| [0417-pacific-atlantic-water-flow](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0417-pacific-atlantic-water-flow) |
| [0437-path-sum-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0437-path-sum-iii) |
| [0449-serialize-and-deserialize-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0449-serialize-and-deserialize-bst) |
| [0490-the-maze](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0490-the-maze) |
| [0529-minesweeper](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0529-minesweeper) |
| [0543-diameter-of-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0543-diameter-of-binary-tree) |
| [0547-number-of-provinces](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0547-number-of-provinces) |
| [0572-subtree-of-another-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0572-subtree-of-another-tree) |
| [0642-design-search-autocomplete-system](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0642-design-search-autocomplete-system) |
| [0652-find-duplicate-subtrees](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0652-find-duplicate-subtrees) |
| [0655-print-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0655-print-binary-tree) |
| [0684-redundant-connection](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0684-redundant-connection) |
| [0695-max-area-of-island](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0695-max-area-of-island) |
| [0721-accounts-merge](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0721-accounts-merge) |
| [0733-flood-fill](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0733-flood-fill) |
| [0744-network-delay-time](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0744-network-delay-time) |
| [0758-convert-binary-search-tree-to-sorted-doubly-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0758-convert-binary-search-tree-to-sorted-doubly-linked-list) |
| [0765-serialize-and-deserialize-n-ary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0765-serialize-and-deserialize-n-ary-tree) |
| [0799-minimum-distance-between-bst-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0799-minimum-distance-between-bst-nodes) |
| [0801-is-graph-bipartite](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0801-is-graph-bipartite) |
| [0803-cheapest-flights-within-k-stops](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0803-cheapest-flights-within-k-stops) |
| [0813-all-paths-from-source-to-target](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0813-all-paths-from-source-to-target) |
| [0863-sum-of-distances-in-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0863-sum-of-distances-in-tree) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [0896-smallest-subtree-with-all-the-deepest-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0896-smallest-subtree-with-all-the-deepest-nodes) |
| [0971-shortest-bridge](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0971-shortest-bridge) |
| [0975-range-sum-of-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0975-range-sum-of-bst) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1079-sum-of-root-to-leaf-binary-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1079-sum-of-root-to-leaf-binary-numbers) |
| [1177-tree-diameter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1177-tree-diameter) |
| [1207-delete-nodes-and-return-forest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1207-delete-nodes-and-return-forest) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [1254-deepest-leaves-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1254-deepest-leaves-sum) |
| [1275-validate-binary-tree-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1275-validate-binary-tree-nodes) |
| [1428-jump-game-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1428-jump-game-iii) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1442-number-of-operations-to-make-network-connected) |
| [1474-longest-zigzag-path-in-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1474-longest-zigzag-path-in-a-binary-tree) |
| [1544-count-good-nodes-in-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1544-count-good-nodes-in-binary-tree) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
| [1663-detect-cycles-in-2d-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1663-detect-cycles-in-2d-grid) |
| [1753-path-with-minimum-effort](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1753-path-with-minimum-effort) |
| [1883-find-distance-in-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1883-find-distance-in-a-binary-tree) |
| [2035-count-sub-islands](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2035-count-sub-islands) |
| [2438-find-closest-node-to-given-two-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2438-find-closest-node-to-given-two-nodes) |
| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |
| [2793-count-the-number-of-complete-components](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2793-count-the-number-of-complete-components) |
| [3633-maximize-the-number-of-target-nodes-after-connecting-trees-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i) |
## Simulation
|  |
| ------- |
| [0043-multiply-strings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0043-multiply-strings) |
| [0054-spiral-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0054-spiral-matrix) |
| [0067-add-binary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0067-add-binary) |
| [0068-text-justification](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0068-text-justification) |
| [0157-read-n-characters-given-read4](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0157-read-n-characters-given-read4) |
| [0158-read-n-characters-given-read4-ii-call-multiple-times](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0158-read-n-characters-given-read4-ii-call-multiple-times) |
| [0348-design-tic-tac-toe](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0348-design-tic-tac-toe) |
| [0353-design-snake-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0353-design-snake-game) |
| [0412-fizz-buzz](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0412-fizz-buzz) |
| [0723-candy-crush](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0723-candy-crush) |
| [0735-asteroid-collision](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0735-asteroid-collision) |
| [0874-backspace-string-compare](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0874-backspace-string-compare) |
| [1324-where-will-the-ball-fall](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1324-where-will-the-ball-fall) |
| [2048-build-array-from-permutation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2048-build-array-from-permutation) |
| [2265-partition-array-according-to-given-pivot](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2265-partition-array-according-to-given-pivot) |
| [2479-meeting-rooms-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2479-meeting-rooms-iii) |
| [2483-task-scheduler-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2483-task-scheduler-ii) |
| [2551-apply-operations-to-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2551-apply-operations-to-an-array) |
## Hash Table
|  |
| ------- |
| [0001-two-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0003-longest-substring-without-repeating-characters) |
| [0013-roman-to-integer](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0013-roman-to-integer) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0036-valid-sudoku](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0037-sudoku-solver) |
| [0041-first-missing-positive](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0041-first-missing-positive) |
| [0049-group-anagrams](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0049-group-anagrams) |
| [0073-set-matrix-zeroes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0073-set-matrix-zeroes) |
| [0076-minimum-window-substring](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0076-minimum-window-substring) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0126-word-ladder-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0126-word-ladder-ii) |
| [0127-word-ladder](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0127-word-ladder) |
| [0128-longest-consecutive-sequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0128-longest-consecutive-sequence) |
| [0133-clone-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0133-clone-graph) |
| [0138-copy-list-with-random-pointer](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0138-copy-list-with-random-pointer) |
| [0139-word-break](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0139-word-break) |
| [0141-linked-list-cycle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0142-linked-list-cycle-ii) |
| [0146-lru-cache](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0146-lru-cache) |
| [0160-intersection-of-two-linked-lists](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0160-intersection-of-two-linked-lists) |
| [0166-fraction-to-recurring-decimal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0166-fraction-to-recurring-decimal) |
| [0169-majority-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0169-majority-element) |
| [0202-happy-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0202-happy-number) |
| [0205-isomorphic-strings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0205-isomorphic-strings) |
| [0208-implement-trie-prefix-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0208-implement-trie-prefix-tree) |
| [0217-contains-duplicate](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0217-contains-duplicate) |
| [0219-contains-duplicate-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0219-contains-duplicate-ii) |
| [0229-majority-element-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0242-valid-anagram) |
| [0246-strobogrammatic-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0246-strobogrammatic-number) |
| [0266-palindrome-permutation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0266-palindrome-permutation) |
| [0268-missing-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0268-missing-number) |
| [0299-bulls-and-cows](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0299-bulls-and-cows) |
| [0314-binary-tree-vertical-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0314-binary-tree-vertical-order-traversal) |
| [0340-longest-substring-with-at-most-k-distinct-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0340-longest-substring-with-at-most-k-distinct-characters) |
| [0347-top-k-frequent-elements](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0347-top-k-frequent-elements) |
| [0348-design-tic-tac-toe](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0348-design-tic-tac-toe) |
| [0349-intersection-of-two-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0350-intersection-of-two-arrays-ii) |
| [0353-design-snake-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0353-design-snake-game) |
| [0359-logger-rate-limiter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0359-logger-rate-limiter) |
| [0380-insert-delete-getrandom-o1](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0380-insert-delete-getrandom-o1) |
| [0381-insert-delete-getrandom-o1-duplicates-allowed](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0381-insert-delete-getrandom-o1-duplicates-allowed) |
| [0383-ransom-note](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0387-first-unique-character-in-a-string) |
| [0409-longest-palindrome](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0409-longest-palindrome) |
| [0421-maximum-xor-of-two-numbers-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0421-maximum-xor-of-two-numbers-in-an-array) |
| [0424-longest-repeating-character-replacement](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0424-longest-repeating-character-replacement) |
| [0433-minimum-genetic-mutation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0433-minimum-genetic-mutation) |
| [0438-find-all-anagrams-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0438-find-all-anagrams-in-a-string) |
| [0454-4sum-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0454-4sum-ii) |
| [0460-lfu-cache](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0460-lfu-cache) |
| [0480-sliding-window-median](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0480-sliding-window-median) |
| [0496-next-greater-element-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0496-next-greater-element-i) |
| [0523-continuous-subarray-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0523-continuous-subarray-sum) |
| [0525-contiguous-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0525-contiguous-array) |
| [0560-subarray-sum-equals-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0560-subarray-sum-equals-k) |
| [0567-permutation-in-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0567-permutation-in-string) |
| [0594-longest-harmonious-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0594-longest-harmonious-subsequence) |
| [0621-task-scheduler](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0621-task-scheduler) |
| [0652-find-duplicate-subtrees](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0652-find-duplicate-subtrees) |
| [0721-accounts-merge](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0721-accounts-merge) |
| [0753-open-the-lock](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0753-open-the-lock) |
| [0762-find-anagram-mappings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0762-find-anagram-mappings) |
| [0768-partition-labels](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0768-partition-labels) |
| [0778-reorganize-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0778-reorganize-string) |
| [0782-jewels-and-stones](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0782-jewels-and-stones) |
| [0797-rabbits-in-forest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0797-rabbits-in-forest) |
| [0807-custom-sort-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0807-custom-sort-string) |
| [0833-bus-routes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0833-bus-routes) |
| [0876-hand-of-straights](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0876-hand-of-straights) |
| [0893-all-nodes-distance-k-in-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0893-all-nodes-distance-k-in-binary-tree) |
| [0896-smallest-subtree-with-all-the-deepest-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0896-smallest-subtree-with-all-the-deepest-nodes) |
| [0905-length-of-longest-fibonacci-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0905-length-of-longest-fibonacci-subsequence) |
| [0940-fruit-into-baskets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0940-fruit-into-baskets) |
| [0965-unique-email-addresses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0965-unique-email-addresses) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [0990-verifying-an-alien-dictionary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0990-verifying-an-alien-dictionary) |
| [1016-subarray-sums-divisible-by-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1016-subarray-sums-divisible-by-k) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1034-subarrays-with-k-different-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1034-subarrays-with-k-different-integers) |
| [1055-pairs-of-songs-with-total-durations-divisible-by-60](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1055-pairs-of-songs-with-total-durations-divisible-by-60) |
| [1145-number-of-submatrices-that-sum-to-target](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1145-number-of-submatrices-that-sum-to-target) |
| [1207-delete-nodes-and-return-forest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1207-delete-nodes-and-return-forest) |
| [1218-lowest-common-ancestor-of-deepest-leaves](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1218-lowest-common-ancestor-of-deepest-leaves) |
| [1227-number-of-equivalent-domino-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1227-number-of-equivalent-domino-pairs) |
| [1370-count-number-of-nice-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1370-count-number-of-nice-subarrays) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1464-reduce-array-size-to-the-half](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1464-reduce-array-size-to-the-half) |
| [1500-count-largest-group](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1500-count-largest-group) |
| [1668-find-longest-awesome-substring](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1668-find-longest-awesome-substring) |
| [1713-dot-product-of-two-sparse-vectors](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1713-dot-product-of-two-sparse-vectors) |
| [1770-minimum-deletions-to-make-character-frequencies-unique](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1770-minimum-deletions-to-make-character-frequencies-unique) |
| [1790-lowest-common-ancestor-of-a-binary-tree-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1790-lowest-common-ancestor-of-a-binary-tree-iii) |
| [1813-maximum-erasure-value](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1813-maximum-erasure-value) |
| [1883-find-distance-in-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1883-find-distance-in-a-binary-tree) |
| [1986-largest-color-value-in-a-directed-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1986-largest-color-value-in-a-directed-graph) |
| [2215-finding-3-digit-even-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2215-finding-3-digit-even-numbers) |
| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2220-find-all-possible-recipes-from-given-supplies) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2308-divide-array-into-equal-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2308-divide-array-into-equal-pairs) |
| [2377-check-if-number-has-equal-digit-count-and-digit-value](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2377-check-if-number-has-equal-digit-count-and-digit-value) |
| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |
| [2479-meeting-rooms-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2479-meeting-rooms-iii) |
| [2483-task-scheduler-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2483-task-scheduler-ii) |
| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |
| [2626-count-the-number-of-good-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2626-count-the-number-of-good-subarrays) |
| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2707-merge-two-2d-arrays-by-summing-values) |
| [2856-count-complete-subarrays-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2856-count-complete-subarrays-in-an-array) |
| [2888-minimum-index-of-a-valid-split](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2888-minimum-index-of-a-valid-split) |
| [2915-count-of-interesting-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2915-count-of-interesting-subarrays) |
| [3225-length-of-longest-subarray-with-at-most-k-frequency](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3225-length-of-longest-subarray-with-at-most-k-frequency) |
| [3227-find-missing-and-repeated-values](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3227-find-missing-and-repeated-values) |
| [3474-better-compression-of-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3474-better-compression-of-string) |
| [3548-find-the-count-of-good-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3548-find-the-count-of-good-integers) |
| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
| [3621-minimum-operations-to-make-array-values-equal-to-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3621-minimum-operations-to-make-array-values-equal-to-k) |
| [3630-total-characters-in-string-after-transformations-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3630-total-characters-in-string-after-transformations-ii) |
| [3656-minimum-number-of-operations-to-make-elements-in-array-distinct](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3656-minimum-number-of-operations-to-make-elements-in-array-distinct) |
| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |
## Math
|  |
| ------- |
| [0002-add-two-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0002-add-two-numbers) |
| [0007-reverse-integer](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0007-reverse-integer) |
| [0009-palindrome-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0009-palindrome-number) |
| [0013-roman-to-integer](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0013-roman-to-integer) |
| [0029-divide-two-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0029-divide-two-integers) |
| [0043-multiply-strings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0043-multiply-strings) |
| [0048-rotate-image](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0048-rotate-image) |
| [0050-powx-n](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0050-powx-n) |
| [0062-unique-paths](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0062-unique-paths) |
| [0066-plus-one](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0066-plus-one) |
| [0067-add-binary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0067-add-binary) |
| [0069-sqrtx](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0069-sqrtx) |
| [0070-climbing-stairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0070-climbing-stairs) |
| [0089-gray-code](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0089-gray-code) |
| [0150-evaluate-reverse-polish-notation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0150-evaluate-reverse-polish-notation) |
| [0166-fraction-to-recurring-decimal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0166-fraction-to-recurring-decimal) |
| [0171-excel-sheet-column-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0171-excel-sheet-column-number) |
| [0172-factorial-trailing-zeroes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0172-factorial-trailing-zeroes) |
| [0189-rotate-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0202-happy-number) |
| [0204-count-primes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0204-count-primes) |
| [0224-basic-calculator](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0224-basic-calculator) |
| [0268-missing-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0268-missing-number) |
| [0273-integer-to-english-words](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0273-integer-to-english-words) |
| [0282-expression-add-operators](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0282-expression-add-operators) |
| [0326-power-of-three](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0326-power-of-three) |
| [0368-largest-divisible-subset](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0368-largest-divisible-subset) |
| [0371-sum-of-two-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0371-sum-of-two-integers) |
| [0380-insert-delete-getrandom-o1](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0380-insert-delete-getrandom-o1) |
| [0381-insert-delete-getrandom-o1-duplicates-allowed](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0381-insert-delete-getrandom-o1-duplicates-allowed) |
| [0384-shuffle-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0384-shuffle-an-array) |
| [0412-fizz-buzz](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0412-fizz-buzz) |
| [0445-add-two-numbers-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0445-add-two-numbers-ii) |
| [0523-continuous-subarray-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0523-continuous-subarray-sum) |
| [0668-kth-smallest-number-in-multiplication-table](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0668-kth-smallest-number-in-multiplication-table) |
| [0670-maximum-swap](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0670-maximum-swap) |
| [0679-24-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0679-24-game) |
| [0797-rabbits-in-forest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0797-rabbits-in-forest) |
| [1014-k-closest-points-to-origin](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1014-k-closest-points-to-origin) |
| [1358-find-positive-integer-solution-for-a-given-equation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1358-find-positive-integer-solution-for-a-given-equation) |
| [1370-count-number-of-nice-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1370-count-number-of-nice-subarrays) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
| [1421-find-numbers-with-even-number-of-digits](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1421-find-numbers-with-even-number-of-digits) |
| [1500-count-largest-group](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1500-count-largest-group) |
| [1889-check-if-number-is-a-sum-of-powers-of-three](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1889-check-if-number-is-a-sum-of-powers-of-three) |
| [1993-sum-of-all-subset-xor-totals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1993-sum-of-all-subset-xor-totals) |
| [2050-count-good-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2050-count-good-numbers) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
| [2383-add-two-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2383-add-two-integers) |
| [2415-count-the-number-of-ideal-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2415-count-the-number-of-ideal-arrays) |
| [2610-closest-prime-numbers-in-range](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2610-closest-prime-numbers-in-range) |
| [2649-count-total-number-of-colored-cells](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2649-count-total-number-of-colored-cells) |
| [2998-count-symmetric-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2998-count-symmetric-integers) |
| [3001-apply-operations-to-maximize-score](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3001-apply-operations-to-maximize-score) |
| [3227-find-missing-and-repeated-values](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3227-find-missing-and-repeated-values) |
| [3243-count-the-number-of-powerful-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3243-count-the-number-of-powerful-integers) |
| [3548-find-the-count-of-good-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3548-find-the-count-of-good-integers) |
| [3630-total-characters-in-string-after-transformations-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3630-total-characters-in-string-after-transformations-ii) |
| [3637-count-number-of-balanced-permutations](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3637-count-number-of-balanced-permutations) |
## Divide and Conquer
|  |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0004-median-of-two-sorted-arrays) |
| [0023-merge-k-sorted-lists](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0023-merge-k-sorted-lists) |
| [0053-maximum-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0053-maximum-subarray) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0148-sort-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0148-sort-list) |
| [0169-majority-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0169-majority-element) |
| [0190-reverse-bits](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0190-reverse-bits) |
| [0191-number-of-1-bits](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0191-number-of-1-bits) |
| [0215-kth-largest-element-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0215-kth-largest-element-in-an-array) |
| [0218-the-skyline-problem](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0218-the-skyline-problem) |
| [0240-search-a-2d-matrix-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0240-search-a-2d-matrix-ii) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0347-top-k-frequent-elements](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0347-top-k-frequent-elements) |
| [1014-k-closest-points-to-origin](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1014-k-closest-points-to-origin) |
| [2280-count-good-triplets-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2280-count-good-triplets-in-an-array) |
## Bit Manipulation
|  |
| ------- |
| [0029-divide-two-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0029-divide-two-integers) |
| [0067-add-binary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0067-add-binary) |
| [0078-subsets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0078-subsets) |
| [0089-gray-code](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0089-gray-code) |
| [0136-single-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0136-single-number) |
| [0137-single-number-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0137-single-number-ii) |
| [0190-reverse-bits](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0190-reverse-bits) |
| [0191-number-of-1-bits](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0191-number-of-1-bits) |
| [0266-palindrome-permutation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0266-palindrome-permutation) |
| [0268-missing-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0268-missing-number) |
| [0287-find-the-duplicate-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0287-find-the-duplicate-number) |
| [0371-sum-of-two-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0371-sum-of-two-integers) |
| [0421-maximum-xor-of-two-numbers-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0421-maximum-xor-of-two-numbers-in-an-array) |
| [0461-hamming-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0461-hamming-distance) |
| [0877-shortest-path-visiting-all-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0877-shortest-path-visiting-all-nodes) |
| [0934-bitwise-ors-of-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0934-bitwise-ors-of-subarrays) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1435-xor-queries-of-a-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1435-xor-queries-of-a-subarray) |
| [1668-find-longest-awesome-substring](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1668-find-longest-awesome-substring) |
| [1881-closest-subsequence-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1881-closest-subsequence-sum) |
| [1993-sum-of-all-subset-xor-totals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1993-sum-of-all-subset-xor-totals) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2308-divide-array-into-equal-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2308-divide-array-into-equal-pairs) |
| [2323-minimum-bit-flips-to-convert-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2323-minimum-bit-flips-to-convert-number) |
| [2478-longest-nice-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2478-longest-nice-subarray) |
| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
## String
|  |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0003-longest-substring-without-repeating-characters) |
| [0005-longest-palindromic-substring](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0005-longest-palindromic-substring) |
| [0006-zigzag-conversion](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0006-zigzag-conversion) |
| [0008-string-to-integer-atoi](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0008-string-to-integer-atoi) |
| [0010-regular-expression-matching](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0010-regular-expression-matching) |
| [0013-roman-to-integer](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0013-roman-to-integer) |
| [0014-longest-common-prefix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0014-longest-common-prefix) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0020-valid-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0020-valid-parentheses) |
| [0022-generate-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0022-generate-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0032-longest-valid-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0032-longest-valid-parentheses) |
| [0038-count-and-say](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0038-count-and-say) |
| [0043-multiply-strings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0043-multiply-strings) |
| [0044-wildcard-matching](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0044-wildcard-matching) |
| [0049-group-anagrams](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0049-group-anagrams) |
| [0067-add-binary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0067-add-binary) |
| [0068-text-justification](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0068-text-justification) |
| [0071-simplify-path](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0071-simplify-path) |
| [0072-edit-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0072-edit-distance) |
| [0076-minimum-window-substring](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0076-minimum-window-substring) |
| [0079-word-search](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0079-word-search) |
| [0091-decode-ways](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0091-decode-ways) |
| [0097-interleaving-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0097-interleaving-string) |
| [0115-distinct-subsequences](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0115-distinct-subsequences) |
| [0125-valid-palindrome](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0125-valid-palindrome) |
| [0126-word-ladder-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0126-word-ladder-ii) |
| [0127-word-ladder](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0127-word-ladder) |
| [0131-palindrome-partitioning](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0131-palindrome-partitioning) |
| [0139-word-break](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0139-word-break) |
| [0151-reverse-words-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0151-reverse-words-in-a-string) |
| [0161-one-edit-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0161-one-edit-distance) |
| [0166-fraction-to-recurring-decimal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0166-fraction-to-recurring-decimal) |
| [0171-excel-sheet-column-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0171-excel-sheet-column-number) |
| [0205-isomorphic-strings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0205-isomorphic-strings) |
| [0208-implement-trie-prefix-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0208-implement-trie-prefix-tree) |
| [0211-design-add-and-search-words-data-structure](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0211-design-add-and-search-words-data-structure) |
| [0212-word-search-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0212-word-search-ii) |
| [0214-shortest-palindrome](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0214-shortest-palindrome) |
| [0224-basic-calculator](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0224-basic-calculator) |
| [0242-valid-anagram](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0242-valid-anagram) |
| [0246-strobogrammatic-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0246-strobogrammatic-number) |
| [0247-strobogrammatic-number-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0247-strobogrammatic-number-ii) |
| [0257-binary-tree-paths](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0257-binary-tree-paths) |
| [0266-palindrome-permutation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0266-palindrome-permutation) |
| [0269-alien-dictionary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0269-alien-dictionary) |
| [0271-encode-and-decode-strings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0271-encode-and-decode-strings) |
| [0273-integer-to-english-words](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0273-integer-to-english-words) |
| [0282-expression-add-operators](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0282-expression-add-operators) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0299-bulls-and-cows](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0299-bulls-and-cows) |
| [0301-remove-invalid-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0301-remove-invalid-parentheses) |
| [0316-remove-duplicate-letters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0316-remove-duplicate-letters) |
| [0340-longest-substring-with-at-most-k-distinct-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0340-longest-substring-with-at-most-k-distinct-characters) |
| [0344-reverse-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0344-reverse-string) |
| [0383-ransom-note](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0387-first-unique-character-in-a-string) |
| [0399-evaluate-division](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0399-evaluate-division) |
| [0402-remove-k-digits](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0402-remove-k-digits) |
| [0408-valid-word-abbreviation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0408-valid-word-abbreviation) |
| [0409-longest-palindrome](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0409-longest-palindrome) |
| [0412-fizz-buzz](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0412-fizz-buzz) |
| [0424-longest-repeating-character-replacement](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0424-longest-repeating-character-replacement) |
| [0433-minimum-genetic-mutation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0433-minimum-genetic-mutation) |
| [0438-find-all-anagrams-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0438-find-all-anagrams-in-a-string) |
| [0443-string-compression](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0443-string-compression) |
| [0449-serialize-and-deserialize-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0449-serialize-and-deserialize-bst) |
| [0468-validate-ip-address](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0468-validate-ip-address) |
| [0516-longest-palindromic-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0516-longest-palindromic-subsequence) |
| [0551-student-attendance-record-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0551-student-attendance-record-i) |
| [0567-permutation-in-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0567-permutation-in-string) |
| [0642-design-search-autocomplete-system](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0642-design-search-autocomplete-system) |
| [0647-palindromic-substrings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0647-palindromic-substrings) |
| [0678-valid-parenthesis-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0678-valid-parenthesis-string) |
| [0680-valid-palindrome-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0680-valid-palindrome-ii) |
| [0721-accounts-merge](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0721-accounts-merge) |
| [0742-to-lower-case](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0742-to-lower-case) |
| [0753-open-the-lock](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0753-open-the-lock) |
| [0765-serialize-and-deserialize-n-ary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0765-serialize-and-deserialize-n-ary-tree) |
| [0768-partition-labels](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0768-partition-labels) |
| [0778-reorganize-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0778-reorganize-string) |
| [0782-jewels-and-stones](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0782-jewels-and-stones) |
| [0793-swap-adjacent-in-lr-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0793-swap-adjacent-in-lr-string) |
| [0807-custom-sort-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0807-custom-sort-string) |
| [0868-push-dominoes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0868-push-dominoes) |
| [0874-backspace-string-compare](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0874-backspace-string-compare) |
| [0962-flip-string-to-monotone-increasing](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0962-flip-string-to-monotone-increasing) |
| [0965-unique-email-addresses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0965-unique-email-addresses) |
| [0990-verifying-an-alien-dictionary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0990-verifying-an-alien-dictionary) |
| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1128-remove-all-adjacent-duplicates-in-string) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1159-smallest-subsequence-of-distinct-characters) |
| [1170-shortest-common-supersequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1170-shortest-common-supersequence) |
| [1178-valid-palindrome-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1178-valid-palindrome-iii) |
| [1250-longest-common-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1250-longest-common-subsequence) |
| [1302-delete-characters-to-make-fancy-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1302-delete-characters-to-make-fancy-string) |
| [1320-remove-all-adjacent-duplicates-in-string-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1320-remove-all-adjacent-duplicates-in-string-ii) |
| [1371-minimum-remove-to-make-valid-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1371-minimum-remove-to-make-valid-parentheses) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1537-maximum-score-after-splitting-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1537-maximum-score-after-splitting-a-string) |
| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |
| [1668-find-longest-awesome-substring](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1668-find-longest-awesome-substring) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [1770-minimum-deletions-to-make-character-frequencies-unique](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1770-minimum-deletions-to-make-character-frequencies-unique) |
| [1818-maximum-score-from-removing-substrings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1818-maximum-score-from-removing-substrings) |
| [1894-merge-strings-alternately](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1894-merge-strings-alternately) |
| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2220-find-all-possible-recipes-from-given-supplies) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2377-check-if-number-has-equal-digit-count-and-digit-value](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2377-check-if-number-has-equal-digit-count-and-digit-value) |
| [2463-minimum-recolors-to-get-k-consecutive-black-blocks](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2463-minimum-recolors-to-get-k-consecutive-black-blocks) |
| [2999-check-if-strings-can-be-made-equal-with-operations-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2999-check-if-strings-can-be-made-equal-with-operations-i) |
| [3142-longest-unequal-adjacent-groups-subsequence-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3142-longest-unequal-adjacent-groups-subsequence-ii) |
| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |
| [3194-find-words-containing-character](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3194-find-words-containing-character) |
| [3243-count-the-number-of-powerful-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3243-count-the-number-of-powerful-integers) |
| [3396-valid-word](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3396-valid-word) |
| [3451-string-compression-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3451-string-compression-iii) |
| [3474-better-compression-of-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3474-better-compression-of-string) |
| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
| [3617-find-the-original-typed-string-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3617-find-the-original-typed-string-i) |
| [3630-total-characters-in-string-after-transformations-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3630-total-characters-in-string-after-transformations-ii) |
| [3637-count-number-of-balanced-permutations](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3637-count-number-of-balanced-permutations) |
## Stack
|  |
| ------- |
| [0020-valid-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0020-valid-parentheses) |
| [0032-longest-valid-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0032-longest-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0042-trapping-rain-water) |
| [0071-simplify-path](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0071-simplify-path) |
| [0084-largest-rectangle-in-histogram](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0085-maximal-rectangle) |
| [0094-binary-tree-inorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0094-binary-tree-inorder-traversal) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0143-reorder-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0143-reorder-list) |
| [0150-evaluate-reverse-polish-notation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0150-evaluate-reverse-polish-notation) |
| [0155-min-stack](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0155-min-stack) |
| [0173-binary-search-tree-iterator](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0173-binary-search-tree-iterator) |
| [0224-basic-calculator](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0224-basic-calculator) |
| [0234-palindrome-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0234-palindrome-linked-list) |
| [0316-remove-duplicate-letters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0316-remove-duplicate-letters) |
| [0402-remove-k-digits](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0402-remove-k-digits) |
| [0445-add-two-numbers-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0445-add-two-numbers-ii) |
| [0456-132-pattern](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0456-132-pattern) |
| [0496-next-greater-element-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0503-next-greater-element-ii) |
| [0636-exclusive-time-of-functions](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0636-exclusive-time-of-functions) |
| [0678-valid-parenthesis-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0678-valid-parenthesis-string) |
| [0735-asteroid-collision](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0735-asteroid-collision) |
| [0739-daily-temperatures](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0739-daily-temperatures) |
| [0758-convert-binary-search-tree-to-sorted-doubly-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0758-convert-binary-search-tree-to-sorted-doubly-linked-list) |
| [0874-backspace-string-compare](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0874-backspace-string-compare) |
| [0937-online-stock-span](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0937-online-stock-span) |
| [0943-sum-of-subarray-minimums](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0943-sum-of-subarray-minimums) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1128-remove-all-adjacent-duplicates-in-string) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1159-smallest-subsequence-of-distinct-characters) |
| [1305-number-of-visible-people-in-a-queue](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1305-number-of-visible-people-in-a-queue) |
| [1320-remove-all-adjacent-duplicates-in-string-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1320-remove-all-adjacent-duplicates-in-string-ii) |
| [1371-minimum-remove-to-make-valid-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1371-minimum-remove-to-make-valid-parentheses) |
| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |
| [1628-count-submatrices-with-all-ones](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1628-count-submatrices-with-all-ones) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [1792-find-the-most-competitive-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1792-find-the-most-competitive-subsequence) |
| [1818-maximum-score-from-removing-substrings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1818-maximum-score-from-removing-substrings) |
| [1909-buildings-with-an-ocean-view](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1909-buildings-with-an-ocean-view) |
| [1985-maximum-subarray-min-product](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1985-maximum-subarray-min-product) |
| [3001-apply-operations-to-maximize-score](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3001-apply-operations-to-maximize-score) |
## Monotonic Stack
|  |
| ------- |
| [0042-trapping-rain-water](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0042-trapping-rain-water) |
| [0084-largest-rectangle-in-histogram](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0085-maximal-rectangle) |
| [0316-remove-duplicate-letters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0316-remove-duplicate-letters) |
| [0402-remove-k-digits](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0402-remove-k-digits) |
| [0456-132-pattern](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0456-132-pattern) |
| [0496-next-greater-element-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0503-next-greater-element-ii) |
| [0739-daily-temperatures](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0739-daily-temperatures) |
| [0937-online-stock-span](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0937-online-stock-span) |
| [0943-sum-of-subarray-minimums](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0943-sum-of-subarray-minimums) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1159-smallest-subsequence-of-distinct-characters) |
| [1305-number-of-visible-people-in-a-queue](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1305-number-of-visible-people-in-a-queue) |
| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |
| [1628-count-submatrices-with-all-ones](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1628-count-submatrices-with-all-ones) |
| [1792-find-the-most-competitive-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1792-find-the-most-competitive-subsequence) |
| [1909-buildings-with-an-ocean-view](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1909-buildings-with-an-ocean-view) |
| [1985-maximum-subarray-min-product](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1985-maximum-subarray-min-product) |
| [3001-apply-operations-to-maximize-score](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3001-apply-operations-to-maximize-score) |
## Two Pointers
|  |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0005-longest-palindromic-substring) |
| [0011-container-with-most-water](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0018-4sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0031-next-permutation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0031-next-permutation) |
| [0042-trapping-rain-water](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0042-trapping-rain-water) |
| [0061-rotate-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0061-rotate-list) |
| [0075-sort-colors](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0142-linked-list-cycle-ii) |
| [0143-reorder-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0143-reorder-list) |
| [0148-sort-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0148-sort-list) |
| [0151-reverse-words-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0151-reverse-words-in-a-string) |
| [0160-intersection-of-two-linked-lists](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0160-intersection-of-two-linked-lists) |
| [0161-one-edit-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0161-one-edit-distance) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0202-happy-number) |
| [0234-palindrome-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0234-palindrome-linked-list) |
| [0246-strobogrammatic-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0246-strobogrammatic-number) |
| [0251-flatten-2d-vector](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0251-flatten-2d-vector) |
| [0253-meeting-rooms-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0253-meeting-rooms-ii) |
| [0277-find-the-celebrity](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0277-find-the-celebrity) |
| [0283-move-zeroes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0287-find-the-duplicate-number) |
| [0295-find-median-from-data-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0295-find-median-from-data-stream) |
| [0344-reverse-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0344-reverse-string) |
| [0349-intersection-of-two-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0350-intersection-of-two-arrays-ii) |
| [0408-valid-word-abbreviation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0408-valid-word-abbreviation) |
| [0443-string-compression](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0443-string-compression) |
| [0567-permutation-in-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0567-permutation-in-string) |
| [0647-palindromic-substrings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0647-palindromic-substrings) |
| [0680-valid-palindrome-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0680-valid-palindrome-ii) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0723-candy-crush](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0723-candy-crush) |
| [0768-partition-labels](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0768-partition-labels) |
| [0793-swap-adjacent-in-lr-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0793-swap-adjacent-in-lr-string) |
| [0868-push-dominoes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0868-push-dominoes) |
| [0874-backspace-string-compare](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0874-backspace-string-compare) |
| [0875-longest-mountain-in-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0875-longest-mountain-in-array) |
| [0908-middle-of-the-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0908-middle-of-the-linked-list) |
| [1028-interval-list-intersections](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1028-interval-list-intersections) |
| [1358-find-positive-integer-solution-for-a-given-equation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1358-find-positive-integer-solution-for-a-given-equation) |
| [1713-dot-product-of-two-sparse-vectors](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1713-dot-product-of-two-sparse-vectors) |
| [1790-lowest-common-ancestor-of-a-binary-tree-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1790-lowest-common-ancestor-of-a-binary-tree-iii) |
| [1881-closest-subsequence-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1881-closest-subsequence-sum) |
| [1894-merge-strings-alternately](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1894-merge-strings-alternately) |
| [2265-partition-array-according-to-given-pivot](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2265-partition-array-according-to-given-pivot) |
| [2551-apply-operations-to-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2551-apply-operations-to-an-array) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2699-count-the-number-of-fair-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2699-count-the-number-of-fair-pairs) |
| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2707-merge-two-2d-arrays-by-summing-values) |
## Sorting
|  |
| ------- |
| [0015-3sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0018-4sum) |
| [0047-permutations-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0047-permutations-ii) |
| [0049-group-anagrams](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0049-group-anagrams) |
| [0056-merge-intervals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0056-merge-intervals) |
| [0075-sort-colors](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0088-merge-sorted-array) |
| [0148-sort-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0148-sort-list) |
| [0169-majority-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0169-majority-element) |
| [0215-kth-largest-element-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0215-kth-largest-element-in-an-array) |
| [0217-contains-duplicate](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0242-valid-anagram) |
| [0252-meeting-rooms](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0252-meeting-rooms) |
| [0253-meeting-rooms-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0253-meeting-rooms-ii) |
| [0268-missing-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0268-missing-number) |
| [0295-find-median-from-data-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0295-find-median-from-data-stream) |
| [0314-binary-tree-vertical-order-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0314-binary-tree-vertical-order-traversal) |
| [0347-top-k-frequent-elements](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0347-top-k-frequent-elements) |
| [0349-intersection-of-two-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0350-intersection-of-two-arrays-ii) |
| [0354-russian-doll-envelopes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0354-russian-doll-envelopes) |
| [0368-largest-divisible-subset](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0368-largest-divisible-subset) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0435-non-overlapping-intervals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0435-non-overlapping-intervals) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0502-ipo](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0502-ipo) |
| [0594-longest-harmonious-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0594-longest-harmonious-subsequence) |
| [0621-task-scheduler](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0621-task-scheduler) |
| [0630-course-schedule-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0630-course-schedule-iii) |
| [0642-design-search-autocomplete-system](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0642-design-search-autocomplete-system) |
| [0646-maximum-length-of-pair-chain](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0646-maximum-length-of-pair-chain) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0721-accounts-merge](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0721-accounts-merge) |
| [0761-employee-free-time](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0761-employee-free-time) |
| [0778-reorganize-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0778-reorganize-string) |
| [0807-custom-sort-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0807-custom-sort-string) |
| [0876-hand-of-straights](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0876-hand-of-straights) |
| [1014-k-closest-points-to-origin](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1014-k-closest-points-to-origin) |
| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |
| [1095-two-city-scheduling](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1095-two-city-scheduling) |
| [1306-minimum-absolute-difference](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1306-minimum-absolute-difference) |
| [1464-reduce-array-size-to-the-half](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1464-reduce-array-size-to-the-half) |
| [1770-minimum-deletions-to-make-character-frequencies-unique](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1770-minimum-deletions-to-make-character-frequencies-unique) |
| [1851-maximum-number-of-events-that-can-be-attended-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1851-maximum-number-of-events-that-can-be-attended-ii) |
| [1881-closest-subsequence-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1881-closest-subsequence-sum) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |
| [2164-two-best-non-overlapping-events](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2164-two-best-non-overlapping-events) |
| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2180-maximum-number-of-tasks-you-can-assign) |
| [2215-finding-3-digit-even-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2215-finding-3-digit-even-numbers) |
| [2479-meeting-rooms-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2479-meeting-rooms-iii) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2681-put-marbles-in-bags](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2681-put-marbles-in-bags) |
| [2699-count-the-number-of-fair-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2699-count-the-number-of-fair-pairs) |
| [2888-minimum-index-of-a-valid-split](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2888-minimum-index-of-a-valid-split) |
| [3001-apply-operations-to-maximize-score](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3001-apply-operations-to-maximize-score) |
| [3430-count-days-without-meetings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3430-count-days-without-meetings) |
| [3474-better-compression-of-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3474-better-compression-of-string) |
| [3647-zero-array-transformation-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3647-zero-array-transformation-iii) |
| [3657-check-if-grid-can-be-cut-into-sections](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3657-check-if-grid-can-be-cut-into-sections) |
## Counting
|  |
| ------- |
| [0169-majority-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0169-majority-element) |
| [0229-majority-element-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0229-majority-element-ii) |
| [0299-bulls-and-cows](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0299-bulls-and-cows) |
| [0347-top-k-frequent-elements](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0347-top-k-frequent-elements) |
| [0383-ransom-note](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0387-first-unique-character-in-a-string) |
| [0594-longest-harmonious-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0594-longest-harmonious-subsequence) |
| [0621-task-scheduler](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0621-task-scheduler) |
| [0778-reorganize-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0778-reorganize-string) |
| [1034-subarrays-with-k-different-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1034-subarrays-with-k-different-integers) |
| [1055-pairs-of-songs-with-total-durations-divisible-by-60](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1055-pairs-of-songs-with-total-durations-divisible-by-60) |
| [1227-number-of-equivalent-domino-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1227-number-of-equivalent-domino-pairs) |
| [1986-largest-color-value-in-a-directed-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1986-largest-color-value-in-a-directed-graph) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2308-divide-array-into-equal-pairs](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2308-divide-array-into-equal-pairs) |
| [2377-check-if-number-has-equal-digit-count-and-digit-value](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2377-check-if-number-has-equal-digit-count-and-digit-value) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [3474-better-compression-of-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3474-better-compression-of-string) |
| [3630-total-characters-in-string-after-transformations-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3630-total-characters-in-string-after-transformations-ii) |
## Sliding Window
|  |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0003-longest-substring-without-repeating-characters) |
| [0076-minimum-window-substring](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0076-minimum-window-substring) |
| [0209-minimum-size-subarray-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0209-minimum-size-subarray-sum) |
| [0219-contains-duplicate-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0219-contains-duplicate-ii) |
| [0239-sliding-window-maximum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0239-sliding-window-maximum) |
| [0340-longest-substring-with-at-most-k-distinct-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0340-longest-substring-with-at-most-k-distinct-characters) |
| [0424-longest-repeating-character-replacement](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0424-longest-repeating-character-replacement) |
| [0438-find-all-anagrams-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0438-find-all-anagrams-in-a-string) |
| [0480-sliding-window-median](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0480-sliding-window-median) |
| [0487-max-consecutive-ones-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0487-max-consecutive-ones-ii) |
| [0567-permutation-in-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0567-permutation-in-string) |
| [0594-longest-harmonious-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0594-longest-harmonious-subsequence) |
| [0713-subarray-product-less-than-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0713-subarray-product-less-than-k) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [0940-fruit-into-baskets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0940-fruit-into-baskets) |
| [1034-subarrays-with-k-different-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1034-subarrays-with-k-different-integers) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1046-max-consecutive-ones-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1046-max-consecutive-ones-iii) |
| [1107-minimum-swaps-to-group-all-1s-together](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1107-minimum-swaps-to-group-all-1s-together) |
| [1370-count-number-of-nice-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1370-count-number-of-nice-subarrays) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1813-maximum-erasure-value](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1813-maximum-erasure-value) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2463-minimum-recolors-to-get-k-consecutive-black-blocks](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2463-minimum-recolors-to-get-k-consecutive-black-blocks) |
| [2478-longest-nice-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2478-longest-nice-subarray) |
| [2498-smallest-subarrays-with-maximum-bitwise-or](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2498-smallest-subarrays-with-maximum-bitwise-or) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2527-count-subarrays-with-fixed-bounds) |
| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |
| [2626-count-the-number-of-good-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2626-count-the-number-of-good-subarrays) |
| [2856-count-complete-subarrays-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2856-count-complete-subarrays-in-an-array) |
| [3213-count-subarrays-where-max-element-appears-at-least-k-times](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3213-count-subarrays-where-max-element-appears-at-least-k-times) |
| [3225-length-of-longest-subarray-with-at-most-k-frequency](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3225-length-of-longest-subarray-with-at-most-k-frequency) |
| [3463-alternating-groups-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3463-alternating-groups-i) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
| [3483-alternating-groups-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3483-alternating-groups-ii) |
| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
## Greedy
|  |
| ------- |
| [0011-container-with-most-water](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0011-container-with-most-water) |
| [0044-wildcard-matching](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0044-wildcard-matching) |
| [0045-jump-game-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0055-jump-game) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0134-gas-station](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0134-gas-station) |
| [0135-candy](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0135-candy) |
| [0253-meeting-rooms-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0253-meeting-rooms-ii) |
| [0316-remove-duplicate-letters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0316-remove-duplicate-letters) |
| [0330-patching-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0330-patching-array) |
| [0334-increasing-triplet-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0334-increasing-triplet-subsequence) |
| [0402-remove-k-digits](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0402-remove-k-digits) |
| [0409-longest-palindrome](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0409-longest-palindrome) |
| [0410-split-array-largest-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0410-split-array-largest-sum) |
| [0435-non-overlapping-intervals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0435-non-overlapping-intervals) |
| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |
| [0502-ipo](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0502-ipo) |
| [0621-task-scheduler](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0621-task-scheduler) |
| [0630-course-schedule-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0630-course-schedule-iii) |
| [0646-maximum-length-of-pair-chain](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0646-maximum-length-of-pair-chain) |
| [0670-maximum-swap](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0670-maximum-swap) |
| [0678-valid-parenthesis-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0678-valid-parenthesis-string) |
| [0680-valid-palindrome-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0680-valid-palindrome-ii) |
| [0768-partition-labels](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0768-partition-labels) |
| [0778-reorganize-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0778-reorganize-string) |
| [0797-rabbits-in-forest](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0797-rabbits-in-forest) |
| [0876-hand-of-straights](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0876-hand-of-straights) |
| [0890-lemonade-change](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0890-lemonade-change) |
| [1049-minimum-domino-rotations-for-equal-row](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1049-minimum-domino-rotations-for-equal-row) |
| [1095-two-city-scheduling](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1095-two-city-scheduling) |
| [1126-minimum-cost-to-connect-sticks](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1126-minimum-cost-to-connect-sticks) |
| [1159-smallest-subsequence-of-distinct-characters](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1159-smallest-subsequence-of-distinct-characters) |
| [1464-reduce-array-size-to-the-half](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1464-reduce-array-size-to-the-half) |
| [1770-minimum-deletions-to-make-character-frequencies-unique](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1770-minimum-deletions-to-make-character-frequencies-unique) |
| [1792-find-the-most-competitive-subsequence](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1792-find-the-most-competitive-subsequence) |
| [1818-maximum-score-from-removing-substrings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1818-maximum-score-from-removing-substrings) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2026-merge-triplets-to-form-target-triplet](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2026-merge-triplets-to-form-target-triplet) |
| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2180-maximum-number-of-tasks-you-can-assign) |
| [2237-longest-palindrome-by-concatenating-two-letter-words](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words) |
| [2681-put-marbles-in-bags](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2681-put-marbles-in-bags) |
| [3001-apply-operations-to-maximize-score](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3001-apply-operations-to-maximize-score) |
| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |
| [3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros) |
| [3647-zero-array-transformation-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3647-zero-array-transformation-iii) |
| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |
## Merge Sort
|  |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0023-merge-k-sorted-lists) |
| [0148-sort-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0148-sort-list) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0315-count-of-smaller-numbers-after-self) |
| [2280-count-good-triplets-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2280-count-good-triplets-in-an-array) |
## Heap (Priority Queue)
|  |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0023-merge-k-sorted-lists) |
| [0215-kth-largest-element-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0215-kth-largest-element-in-an-array) |
| [0218-the-skyline-problem](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0218-the-skyline-problem) |
| [0239-sliding-window-maximum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0239-sliding-window-maximum) |
| [0253-meeting-rooms-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0253-meeting-rooms-ii) |
| [0295-find-median-from-data-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0295-find-median-from-data-stream) |
| [0347-top-k-frequent-elements](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0347-top-k-frequent-elements) |
| [0378-kth-smallest-element-in-a-sorted-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0378-kth-smallest-element-in-a-sorted-matrix) |
| [0480-sliding-window-median](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0480-sliding-window-median) |
| [0502-ipo](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0502-ipo) |
| [0621-task-scheduler](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0621-task-scheduler) |
| [0630-course-schedule-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0630-course-schedule-iii) |
| [0642-design-search-autocomplete-system](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0642-design-search-autocomplete-system) |
| [0744-network-delay-time](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0744-network-delay-time) |
| [0761-employee-free-time](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0761-employee-free-time) |
| [0778-reorganize-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0778-reorganize-string) |
| [0789-kth-largest-element-in-a-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0789-kth-largest-element-in-a-stream) |
| [0803-cheapest-flights-within-k-stops](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0803-cheapest-flights-within-k-stops) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1014-k-closest-points-to-origin](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1014-k-closest-points-to-origin) |
| [1126-minimum-cost-to-connect-sticks](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1126-minimum-cost-to-connect-sticks) |
| [1127-last-stone-weight](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1127-last-stone-weight) |
| [1464-reduce-array-size-to-the-half](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1464-reduce-array-size-to-the-half) |
| [1753-path-with-minimum-effort](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1753-path-with-minimum-effort) |
| [2164-two-best-non-overlapping-events](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2164-two-best-non-overlapping-events) |
| [2479-meeting-rooms-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2479-meeting-rooms-iii) |
| [2588-maximum-number-of-points-from-grid-queries](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2588-maximum-number-of-points-from-grid-queries) |
| [2681-put-marbles-in-bags](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2681-put-marbles-in-bags) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
| [3628-find-minimum-time-to-reach-last-room-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3628-find-minimum-time-to-reach-last-room-ii) |
| [3647-zero-array-transformation-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3647-zero-array-transformation-iii) |
## Prefix Sum
|  |
| ------- |
| [0209-minimum-size-subarray-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0209-minimum-size-subarray-sum) |
| [0238-product-of-array-except-self](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0238-product-of-array-except-self) |
| [0253-meeting-rooms-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0253-meeting-rooms-ii) |
| [0303-range-sum-query-immutable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0303-range-sum-query-immutable) |
| [0304-range-sum-query-2d-immutable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0304-range-sum-query-2d-immutable) |
| [0370-range-addition](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0370-range-addition) |
| [0410-split-array-largest-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0410-split-array-largest-sum) |
| [0523-continuous-subarray-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0523-continuous-subarray-sum) |
| [0525-contiguous-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0525-contiguous-array) |
| [0560-subarray-sum-equals-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0560-subarray-sum-equals-k) |
| [0713-subarray-product-less-than-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0713-subarray-product-less-than-k) |
| [0724-find-pivot-index](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0724-find-pivot-index) |
| [0731-my-calendar-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0731-my-calendar-ii) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1016-subarray-sums-divisible-by-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1016-subarray-sums-divisible-by-k) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1046-max-consecutive-ones-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1046-max-consecutive-ones-iii) |
| [1145-number-of-submatrices-that-sum-to-target](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1145-number-of-submatrices-that-sum-to-target) |
| [1370-count-number-of-nice-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1370-count-number-of-nice-subarrays) |
| [1435-xor-queries-of-a-subarray](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1435-xor-queries-of-a-subarray) |
| [1537-maximum-score-after-splitting-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1537-maximum-score-after-splitting-a-string) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1966-frequency-of-the-most-frequent-element) |
| [1985-maximum-subarray-min-product](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1985-maximum-subarray-min-product) |
| [2249-count-the-hidden-sequences](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2249-count-the-hidden-sequences) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2394-count-subarrays-with-score-less-than-k) |
| [2625-increment-submatrices-by-one](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2625-increment-submatrices-by-one) |
| [2915-count-of-interesting-subarrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2915-count-of-interesting-subarrays) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
| [3643-zero-array-transformation-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3643-zero-array-transformation-ii) |
| [3647-zero-array-transformation-iii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3647-zero-array-transformation-iii) |
## Design
|  |
| ------- |
| [0146-lru-cache](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0146-lru-cache) |
| [0155-min-stack](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0155-min-stack) |
| [0173-binary-search-tree-iterator](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0173-binary-search-tree-iterator) |
| [0208-implement-trie-prefix-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0208-implement-trie-prefix-tree) |
| [0211-design-add-and-search-words-data-structure](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0211-design-add-and-search-words-data-structure) |
| [0251-flatten-2d-vector](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0251-flatten-2d-vector) |
| [0271-encode-and-decode-strings](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0271-encode-and-decode-strings) |
| [0295-find-median-from-data-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0295-find-median-from-data-stream) |
| [0297-serialize-and-deserialize-binary-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0297-serialize-and-deserialize-binary-tree) |
| [0303-range-sum-query-immutable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0303-range-sum-query-immutable) |
| [0304-range-sum-query-2d-immutable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0304-range-sum-query-2d-immutable) |
| [0307-range-sum-query-mutable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0307-range-sum-query-mutable) |
| [0346-moving-average-from-data-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0346-moving-average-from-data-stream) |
| [0348-design-tic-tac-toe](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0348-design-tic-tac-toe) |
| [0353-design-snake-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0353-design-snake-game) |
| [0359-logger-rate-limiter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0359-logger-rate-limiter) |
| [0362-design-hit-counter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0362-design-hit-counter) |
| [0380-insert-delete-getrandom-o1](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0380-insert-delete-getrandom-o1) |
| [0381-insert-delete-getrandom-o1-duplicates-allowed](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0381-insert-delete-getrandom-o1-duplicates-allowed) |
| [0384-shuffle-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0384-shuffle-an-array) |
| [0449-serialize-and-deserialize-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0449-serialize-and-deserialize-bst) |
| [0460-lfu-cache](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0460-lfu-cache) |
| [0642-design-search-autocomplete-system](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0642-design-search-autocomplete-system) |
| [0731-my-calendar-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0731-my-calendar-ii) |
| [0789-kth-largest-element-in-a-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0789-kth-largest-element-in-a-stream) |
| [0937-online-stock-span](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0937-online-stock-span) |
| [1713-dot-product-of-two-sparse-vectors](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1713-dot-product-of-two-sparse-vectors) |
## Doubly-Linked List
|  |
| ------- |
| [0146-lru-cache](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0146-lru-cache) |
| [0460-lfu-cache](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0460-lfu-cache) |
| [0758-convert-binary-search-tree-to-sorted-doubly-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0758-convert-binary-search-tree-to-sorted-doubly-linked-list) |
## Segment Tree
|  |
| ------- |
| [0218-the-skyline-problem](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0218-the-skyline-problem) |
| [0307-range-sum-query-mutable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0307-range-sum-query-mutable) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0731-my-calendar-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0731-my-calendar-ii) |
| [2280-count-good-triplets-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2280-count-good-triplets-in-an-array) |
## Ordered Set
|  |
| ------- |
| [0218-the-skyline-problem](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0218-the-skyline-problem) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0315-count-of-smaller-numbers-after-self) |
| [0456-132-pattern](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0456-132-pattern) |
| [0731-my-calendar-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0731-my-calendar-ii) |
| [2280-count-good-triplets-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2280-count-good-triplets-in-an-array) |
## Backtracking
|  |
| ------- |
| [0017-letter-combinations-of-a-phone-number](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0022-generate-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0022-generate-parentheses) |
| [0037-sudoku-solver](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0037-sudoku-solver) |
| [0039-combination-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0040-combination-sum-ii) |
| [0046-permutations](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0047-permutations-ii) |
| [0051-n-queens](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0051-n-queens) |
| [0078-subsets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0078-subsets) |
| [0079-word-search](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0079-word-search) |
| [0089-gray-code](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0089-gray-code) |
| [0113-path-sum-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0113-path-sum-ii) |
| [0126-word-ladder-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0126-word-ladder-ii) |
| [0131-palindrome-partitioning](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0131-palindrome-partitioning) |
| [0212-word-search-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0212-word-search-ii) |
| [0257-binary-tree-paths](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0257-binary-tree-paths) |
| [0282-expression-add-operators](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0282-expression-add-operators) |
| [0301-remove-invalid-parentheses](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0301-remove-invalid-parentheses) |
| [0494-target-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0494-target-sum) |
| [0679-24-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0679-24-game) |
| [0787-sliding-puzzle](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0787-sliding-puzzle) |
| [0813-all-paths-from-source-to-target](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0813-all-paths-from-source-to-target) |
| [1993-sum-of-all-subset-xor-totals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1993-sum-of-all-subset-xor-totals) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
## Graph
|  |
| ------- |
| [0133-clone-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0133-clone-graph) |
| [0207-course-schedule](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0210-course-schedule-ii) |
| [0261-graph-valid-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0261-graph-valid-tree) |
| [0269-alien-dictionary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0269-alien-dictionary) |
| [0277-find-the-celebrity](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0277-find-the-celebrity) |
| [0323-number-of-connected-components-in-an-undirected-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0323-number-of-connected-components-in-an-undirected-graph) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [0332-reconstruct-itinerary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0332-reconstruct-itinerary) |
| [0399-evaluate-division](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0399-evaluate-division) |
| [0547-number-of-provinces](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0547-number-of-provinces) |
| [0684-redundant-connection](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0684-redundant-connection) |
| [0744-network-delay-time](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0744-network-delay-time) |
| [0801-is-graph-bipartite](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0801-is-graph-bipartite) |
| [0803-cheapest-flights-within-k-stops](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0803-cheapest-flights-within-k-stops) |
| [0813-all-paths-from-source-to-target](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0813-all-paths-from-source-to-target) |
| [0863-sum-of-distances-in-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0863-sum-of-distances-in-tree) |
| [0877-shortest-path-visiting-all-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0877-shortest-path-visiting-all-nodes) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1177-tree-diameter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1177-tree-diameter) |
| [1275-validate-binary-tree-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1275-validate-binary-tree-nodes) |
| [1442-number-of-operations-to-make-network-connected](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1442-number-of-operations-to-make-network-connected) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
| [1661-minimum-number-of-vertices-to-reach-all-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1661-minimum-number-of-vertices-to-reach-all-nodes) |
| [1701-remove-max-number-of-edges-to-keep-graph-fully-traversable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1701-remove-max-number-of-edges-to-keep-graph-fully-traversable) |
| [1706-min-cost-to-connect-all-points](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1706-min-cost-to-connect-all-points) |
| [1986-largest-color-value-in-a-directed-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1986-largest-color-value-in-a-directed-graph) |
| [2090-number-of-ways-to-arrive-at-destination](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2090-number-of-ways-to-arrive-at-destination) |
| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2220-find-all-possible-recipes-from-given-supplies) |
| [2438-find-closest-node-to-given-two-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2438-find-closest-node-to-given-two-nodes) |
| [2793-count-the-number-of-complete-components](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2793-count-the-number-of-complete-components) |
| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3348-minimum-cost-walk-in-weighted-graph) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
| [3628-find-minimum-time-to-reach-last-room-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3628-find-minimum-time-to-reach-last-room-ii) |
## Binary Search Tree
|  |
| ------- |
| [0098-validate-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0099-recover-binary-search-tree) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0173-binary-search-tree-iterator](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0173-binary-search-tree-iterator) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0285-inorder-successor-in-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0285-inorder-successor-in-bst) |
| [0449-serialize-and-deserialize-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0449-serialize-and-deserialize-bst) |
| [0758-convert-binary-search-tree-to-sorted-doubly-linked-list](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0758-convert-binary-search-tree-to-sorted-doubly-linked-list) |
| [0789-kth-largest-element-in-a-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0789-kth-largest-element-in-a-stream) |
| [0799-minimum-distance-between-bst-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0799-minimum-distance-between-bst-nodes) |
| [0975-range-sum-of-bst](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0975-range-sum-of-bst) |
| [1050-construct-binary-search-tree-from-preorder-traversal](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1050-construct-binary-search-tree-from-preorder-traversal) |
## Data Stream
|  |
| ------- |
| [0295-find-median-from-data-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0295-find-median-from-data-stream) |
| [0346-moving-average-from-data-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0346-moving-average-from-data-stream) |
| [0359-logger-rate-limiter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0359-logger-rate-limiter) |
| [0362-design-hit-counter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0362-design-hit-counter) |
| [0642-design-search-autocomplete-system](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0642-design-search-autocomplete-system) |
| [0789-kth-largest-element-in-a-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0789-kth-largest-element-in-a-stream) |
| [0937-online-stock-span](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0937-online-stock-span) |
## Binary Indexed Tree
|  |
| ------- |
| [0218-the-skyline-problem](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0218-the-skyline-problem) |
| [0307-range-sum-query-mutable](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0307-range-sum-query-mutable) |
| [0315-count-of-smaller-numbers-after-self](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0315-count-of-smaller-numbers-after-self) |
| [2280-count-good-triplets-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2280-count-good-triplets-in-an-array) |
## Line Sweep
|  |
| ------- |
| [0218-the-skyline-problem](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0218-the-skyline-problem) |
| [1028-interval-list-intersections](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1028-interval-list-intersections) |
## Queue
|  |
| ------- |
| [0239-sliding-window-maximum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0239-sliding-window-maximum) |
| [0346-moving-average-from-data-stream](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0346-moving-average-from-data-stream) |
| [0353-design-snake-game](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0353-design-snake-game) |
| [0362-design-hit-counter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0362-design-hit-counter) |
| [0387-first-unique-character-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0387-first-unique-character-in-a-string) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2180-maximum-number-of-tasks-you-can-assign) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2527-count-subarrays-with-fixed-bounds) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
## Monotonic Queue
|  |
| ------- |
| [0239-sliding-window-maximum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0239-sliding-window-maximum) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [2180-maximum-number-of-tasks-you-can-assign](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2180-maximum-number-of-tasks-you-can-assign) |
| [2527-count-subarrays-with-fixed-bounds](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2527-count-subarrays-with-fixed-bounds) |
## Trie
|  |
| ------- |
| [0014-longest-common-prefix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0014-longest-common-prefix) |
| [0139-word-break](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0139-word-break) |
| [0208-implement-trie-prefix-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0208-implement-trie-prefix-tree) |
| [0211-design-add-and-search-words-data-structure](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0211-design-add-and-search-words-data-structure) |
| [0212-word-search-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0212-word-search-ii) |
| [0421-maximum-xor-of-two-numbers-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0421-maximum-xor-of-two-numbers-in-an-array) |
| [0642-design-search-autocomplete-system](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0642-design-search-autocomplete-system) |
## Topological Sort
|  |
| ------- |
| [0207-course-schedule](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0207-course-schedule) |
| [0210-course-schedule-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0210-course-schedule-ii) |
| [0269-alien-dictionary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0269-alien-dictionary) |
| [0329-longest-increasing-path-in-a-matrix](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0329-longest-increasing-path-in-a-matrix) |
| [1177-tree-diameter](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1177-tree-diameter) |
| [1986-largest-color-value-in-a-directed-graph](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1986-largest-color-value-in-a-directed-graph) |
| [2090-number-of-ways-to-arrive-at-destination](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2090-number-of-ways-to-arrive-at-destination) |
| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2220-find-all-possible-recipes-from-given-supplies) |
## Shortest Path
|  |
| ------- |
| [0399-evaluate-division](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0399-evaluate-division) |
| [0744-network-delay-time](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0744-network-delay-time) |
| [0803-cheapest-flights-within-k-stops](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0803-cheapest-flights-within-k-stops) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [2090-number-of-ways-to-arrive-at-destination](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2090-number-of-ways-to-arrive-at-destination) |
| [3627-find-minimum-time-to-reach-last-room-i](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3627-find-minimum-time-to-reach-last-room-i) |
| [3628-find-minimum-time-to-reach-last-room-ii](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3628-find-minimum-time-to-reach-last-room-ii) |
## Bucket Sort
|  |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0347-top-k-frequent-elements) |
## Quickselect
|  |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0347-top-k-frequent-elements) |
| [1014-k-closest-points-to-origin](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1014-k-closest-points-to-origin) |
## Eulerian Circuit
|  |
| ------- |
| [0332-reconstruct-itinerary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0332-reconstruct-itinerary) |
## Combinatorics
|  |
| ------- |
| [0062-unique-paths](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0062-unique-paths) |
| [1993-sum-of-all-subset-xor-totals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1993-sum-of-all-subset-xor-totals) |
| [2415-count-the-number-of-ideal-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2415-count-the-number-of-ideal-arrays) |
| [3548-find-the-count-of-good-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3548-find-the-count-of-good-integers) |
| [3637-count-number-of-balanced-permutations](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3637-count-number-of-balanced-permutations) |
## Interactive
|  |
| ------- |
| [0157-read-n-characters-given-read4](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0157-read-n-characters-given-read4) |
| [0158-read-n-characters-given-read4-ii-call-multiple-times](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0158-read-n-characters-given-read4-ii-call-multiple-times) |
| [0277-find-the-celebrity](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0277-find-the-celebrity) |
| [0278-first-bad-version](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0278-first-bad-version) |
| [0374-guess-number-higher-or-lower](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0374-guess-number-higher-or-lower) |
| [1358-find-positive-integer-solution-for-a-given-equation](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1358-find-positive-integer-solution-for-a-given-equation) |
## Geometry
|  |
| ------- |
| [1014-k-closest-points-to-origin](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1014-k-closest-points-to-origin) |
## Iterator
|  |
| ------- |
| [0173-binary-search-tree-iterator](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0173-binary-search-tree-iterator) |
| [0251-flatten-2d-vector](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0251-flatten-2d-vector) |
## Randomized
|  |
| ------- |
| [0380-insert-delete-getrandom-o1](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0380-insert-delete-getrandom-o1) |
| [0381-insert-delete-getrandom-o1-duplicates-allowed](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0381-insert-delete-getrandom-o1-duplicates-allowed) |
| [0384-shuffle-an-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0384-shuffle-an-array) |
## String Matching
|  |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0214-shortest-palindrome](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0214-shortest-palindrome) |
| [0572-subtree-of-another-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0572-subtree-of-another-tree) |
## Number Theory
|  |
| ------- |
| [0204-count-primes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0204-count-primes) |
| [2415-count-the-number-of-ideal-arrays](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2415-count-the-number-of-ideal-arrays) |
| [2610-closest-prime-numbers-in-range](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2610-closest-prime-numbers-in-range) |
| [3001-apply-operations-to-maximize-score](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3001-apply-operations-to-maximize-score) |
## Enumeration
|  |
| ------- |
| [0204-count-primes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0204-count-primes) |
| [0875-longest-mountain-in-array](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0875-longest-mountain-in-array) |
| [1656-count-good-triplets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1656-count-good-triplets) |
| [1993-sum-of-all-subset-xor-totals](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1993-sum-of-all-subset-xor-totals) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2215-finding-3-digit-even-numbers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2215-finding-3-digit-even-numbers) |
| [2998-count-symmetric-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2998-count-symmetric-integers) |
| [3548-find-the-count-of-good-integers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/3548-find-the-count-of-good-integers) |
## Bitmask
|  |
| ------- |
| [0877-shortest-path-visiting-all-nodes](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0877-shortest-path-visiting-all-nodes) |
| [1881-closest-subsequence-sum](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1881-closest-subsequence-sum) |
## Database
|  |
| ------- |
| [0177-nth-highest-salary](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0177-nth-highest-salary) |
## Concurrency
|  |
| ------- |
| [1186-building-h2o](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1186-building-h2o) |
| [1187-print-foobar-alternately](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1187-print-foobar-alternately) |
| [1203-print-in-order](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1203-print-in-order) |
| [1316-fizz-buzz-multithreaded](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1316-fizz-buzz-multithreaded) |
| [1340-the-dining-philosophers](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1340-the-dining-philosophers) |
## Hash Function
|  |
| ------- |
| [0214-shortest-palindrome](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0214-shortest-palindrome) |
| [0572-subtree-of-another-tree](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0572-subtree-of-another-tree) |
## Rolling Hash
|  |
| ------- |
| [0214-shortest-palindrome](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/0214-shortest-palindrome) |
## Minimum Spanning Tree
|  |
| ------- |
| [1706-min-cost-to-connect-all-points](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/1706-min-cost-to-connect-all-points) |
## Brainteaser
|  |
| ------- |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/TechWithRamaa/DataStructures_and_Algorithms/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |

DataStructures_and_Algorithms

DataStructures_and_Algorithms Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

DataStructures_and_Algorithms

DataStructures_and_Algorithms Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README