DSA_IN_CPP
🚀 DSA_IN_CPP
LeetCode Journey by Shivam Kachhadiya
📊 GitHub Stats
🚀 DSA_IN_CPP - LeetCode Journey by Shivam Kachhadiya
📌 About Me
-- Click the above image to view my LeetCode profile --
-- Stats below are updated automatically in real time 🚀 --
Hello! I’m Shivam Kachhadiya, currently pursuing M.Tech from VIT Vellore, Tamil Nadu.
My long-term goal is to work in a top fintech product-based company where I can apply my skills in DSA, Java, Spring Boot, SQL, and more.
This repository automatically syncs my solved LeetCode problems in C++ using a Chrome extension. It’s my way of tracking progress and staying consistent with problem solving.
DSA_IN_CPP
LeetCode Topics
Array
| | | ——- | | 0001-two-sum | | 0004-median-of-two-sorted-arrays | | 0011-container-with-most-water | | 0016-3sum-closest | | 0026-remove-duplicates-from-sorted-array | | 0027-remove-element | | 0031-next-permutation | | 0033-search-in-rotated-sorted-array | | 0034-find-first-and-last-position-of-element-in-sorted-array | | 0035-search-insert-position | | 0037-sudoku-solver | | 0039-combination-sum | | 0042-trapping-rain-water | | 0045-jump-game-ii | | 0046-permutations | | 0048-rotate-image | | 0051-n-queens | | 0053-maximum-subarray | | 0055-jump-game | | 0057-insert-interval | | 0063-unique-paths-ii | | 0064-minimum-path-sum | | 0073-set-matrix-zeroes | | 0074-search-a-2d-matrix | | 0075-sort-colors | | 0078-subsets | | 0081-search-in-rotated-sorted-array-ii | | 0084-largest-rectangle-in-histogram | | 0088-merge-sorted-array | | 0090-subsets-ii | | 0105-construct-binary-tree-from-preorder-and-inorder-traversal | | 0106-construct-binary-tree-from-inorder-and-postorder-traversal | | 0108-convert-sorted-array-to-binary-search-tree | | 0118-pascals-triangle | | 0119-pascals-triangle-ii | | 0120-triangle | | 0121-best-time-to-buy-and-sell-stock | | 0122-best-time-to-buy-and-sell-stock-ii | | 0123-best-time-to-buy-and-sell-stock-iii | | 0128-longest-consecutive-sequence | | 0130-surrounded-regions | | 0136-single-number | | 0152-maximum-product-subarray | | 0153-find-minimum-in-rotated-sorted-array | | 0162-find-peak-element | | 0169-majority-element | | 0188-best-time-to-buy-and-sell-stock-iv | | 0189-rotate-array | | 0198-house-robber | | 0200-number-of-islands | | 0204-count-primes | | 0209-minimum-size-subarray-sum | | 0213-house-robber-ii | | 0217-contains-duplicate | | 0221-maximal-square | | 0239-sliding-window-maximum | | 0268-missing-number | | 0283-move-zeroes | | 0287-find-the-duplicate-number | | 0300-longest-increasing-subsequence | | 0309-best-time-to-buy-and-sell-stock-with-cooldown | | 0322-coin-change | | 0349-intersection-of-two-arrays | | 0354-russian-doll-envelopes | | 0368-largest-divisible-subset | | 0377-combination-sum-iv | | 0407-trapping-rain-water-ii | | 0410-split-array-largest-sum | | 0416-partition-equal-subset-sum | | 0417-pacific-atlantic-water-flow | | 0435-non-overlapping-intervals | | 0455-assign-cookies | | 0474-ones-and-zeroes | | 0485-max-consecutive-ones | | 0494-target-sum | | 0496-next-greater-element-i | | 0518-coin-change-ii | | 0540-single-element-in-a-sorted-array | | 0542-01-matrix | | 0560-subarray-sum-equals-k | | 0673-number-of-longest-increasing-subsequence | | 0714-best-time-to-buy-and-sell-stock-with-transaction-fee | | 0717-1-bit-and-2-bit-characters | | 0733-flood-fill | | 0735-asteroid-collision | | 0746-min-cost-climbing-stairs | | 0747-min-cost-climbing-stairs | | 0759-set-intersection-size-at-least-two | | 0792-binary-search | | 0801-minimum-swaps-to-make-sequences-increasing | | 0819-minimum-swaps-to-make-sequences-increasing | | 0852-peak-index-in-a-mountain-array | | 0882-peak-index-in-a-mountain-array | | 0890-lemonade-change | | 0907-koko-eating-bananas | | 0930-binary-subarrays-with-sum | | 0966-binary-subarrays-with-sum | | 0994-rotting-oranges | | 1004-max-consecutive-ones-iii | | 1025-minimum-cost-for-tickets | | 1036-rotting-oranges | | 1046-max-consecutive-ones-iii | | 1050-construct-binary-search-tree-from-preorder-traversal | | 1056-capacity-to-ship-packages-within-d-days | | 1087-longest-arithmetic-subsequence | | 1111-minimum-score-triangulation-of-polygon | | 1121-partition-array-for-maximum-sum | | 1129-longest-string-chain | | 1200-minimum-absolute-difference | | 1262-greatest-sum-divisible-by-three | | 1330-longest-arithmetic-subsequence-of-given-difference | | 1408-find-the-smallest-divisor-given-a-threshold | | 1489-pizza-with-3n-slices | | 1503-reducing-dishes | | 1538-maximum-points-you-can-obtain-from-cards | | 1548-check-if-all-1s-are-at-least-length-k-places-away | | 1552-build-an-array-with-stack-operations | | 1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array | | 1636-sort-array-by-increasing-frequency | | 1646-kth-missing-positive-number | | 1669-minimum-cost-to-cut-a-stick | | 1700-minimum-time-to-make-rope-colorful | | 1798-max-number-of-k-sum-pairs | | 1952-minimum-sideway-jumps | | 1984-minimum-difference-between-highest-and-lowest-of-k-scores | | 1993-sum-of-all-subset-xor-totals | | 2058-concatenation-of-array | | 2106-find-greatest-common-divisor-of-array | | 2141-maximum-running-time-of-n-computers | | 2169-simple-bank-system | | 2181-smallest-index-with-equal-value | | 2244-number-of-laser-beams-in-a-bank | | 2271-rearrange-array-elements-by-sign | | 2274-keep-multiplying-found-values-by-two | | 2343-count-unguarded-cells-in-the-grid | | 2392-successful-pairs-of-spells-and-potions | | 2435-paths-in-matrix-whose-sum-is-divisible-by-k | | 2519-find-the-original-array-of-prefix-xor | | 2618-maximize-the-minimum-powered-city | | 2625-increment-submatrices-by-one | | 2661-smallest-missing-non-negative-integer-after-operations | | 2720-minimize-the-maximum-difference-of-pairs | | 2753-minimum-number-of-operations-to-make-all-array-elements-equal-to-1 | | 2976-minimum-cost-to-convert-string-i | | 3005-count-elements-with-maximum-frequency | | 3190-find-minimum-operations-to-make-all-elements-divisible-by-three | | 3315-construct-the-minimum-bitwise-array-ii | | 3383-taking-maximum-energy-from-the-mystic-dungeon | | 3437-maximum-total-damage-with-spell-casting | | 3501-delete-nodes-from-linked-list-present-in-array | | 3592-find-x-sum-of-all-k-long-subarrays-ii | | 3610-find-x-sum-of-all-k-long-subarrays-i | | 3612-adjacent-increasing-subarrays-detection-i | | 3616-make-array-elements-equal-to-zero | | 3619-adjacent-increasing-subarrays-detection-ii | | 3620-maximum-number-of-distinct-elements-after-operations | | 3622-maximum-frequency-of-an-element-after-performing-operations-i | | 3640-maximum-frequency-of-an-element-after-performing-operations-ii | | 3794-find-the-minimum-amount-of-time-to-brew-potions | | 3834-minimum-operations-to-convert-all-elements-to-zero | | 3851-find-sum-of-array-product-of-magical-sequences | | 3863-power-grid-maintenance |
Divide and Conquer
| | | ——- | | 0004-median-of-two-sorted-arrays | | 0053-maximum-subarray | | 0105-construct-binary-tree-from-preorder-and-inorder-traversal | | 0106-construct-binary-tree-from-inorder-and-postorder-traversal | | 0108-convert-sorted-array-to-binary-search-tree | | 0169-majority-element | | 0191-number-of-1-bits |
Tree
| | | ——- | | 0094-binary-tree-inorder-traversal | | 0095-unique-binary-search-trees-ii | | 0096-unique-binary-search-trees | | 0098-validate-binary-search-tree | | 0099-recover-binary-search-tree | | 0100-same-tree | | 0102-binary-tree-level-order-traversal | | 0103-binary-tree-zigzag-level-order-traversal | | 0104-maximum-depth-of-binary-tree | | 0105-construct-binary-tree-from-preorder-and-inorder-traversal | | 0106-construct-binary-tree-from-inorder-and-postorder-traversal | | 0108-convert-sorted-array-to-binary-search-tree | | 0110-balanced-binary-tree | | 0114-flatten-binary-tree-to-linked-list | | 0144-binary-tree-preorder-traversal | | 0145-binary-tree-postorder-traversal | | 0199-binary-tree-right-side-view | | 0222-count-complete-tree-nodes | | 0230-kth-smallest-element-in-a-bst | | 0235-lowest-common-ancestor-of-a-binary-search-tree | | 0236-lowest-common-ancestor-of-a-binary-tree | | 0437-path-sum-iii | | 0450-delete-node-in-a-bst | | 0543-diameter-of-binary-tree | | 0653-two-sum-iv-input-is-a-bst | | 0783-search-in-a-binary-search-tree | | 0784-insert-into-a-binary-search-tree | | 1050-construct-binary-search-tree-from-preorder-traversal | | 2461-amount-of-time-for-binary-tree-to-be-infected |
Binary Search Tree
| | | ——- | | 0004-median-of-two-sorted-arrays | | 0033-search-in-rotated-sorted-array | | 0034-find-first-and-last-position-of-element-in-sorted-array | | 0035-search-insert-position | | 0069-sqrtx | | 0074-search-a-2d-matrix | | 0081-search-in-rotated-sorted-array-ii | | 0095-unique-binary-search-trees-ii | | 0096-unique-binary-search-trees | | 0098-validate-binary-search-tree | | 0099-recover-binary-search-tree | | 0108-convert-sorted-array-to-binary-search-tree | | 0153-find-minimum-in-rotated-sorted-array | | 0162-find-peak-element | | 0209-minimum-size-subarray-sum | | 0222-count-complete-tree-nodes | | 0230-kth-smallest-element-in-a-bst | | 0235-lowest-common-ancestor-of-a-binary-search-tree | | 0268-missing-number | | 0287-find-the-duplicate-number | | 0300-longest-increasing-subsequence | | 0349-intersection-of-two-arrays | | 0354-russian-doll-envelopes | | 0367-valid-perfect-square | | 0410-split-array-largest-sum | | 0450-delete-node-in-a-bst | | 0540-single-element-in-a-sorted-array | | 0653-two-sum-iv-input-is-a-bst | | 0783-search-in-a-binary-search-tree | | 0784-insert-into-a-binary-search-tree | | 0792-binary-search | | 0852-peak-index-in-a-mountain-array | | 0882-peak-index-in-a-mountain-array | | 0907-koko-eating-bananas | | 1004-max-consecutive-ones-iii | | 1046-max-consecutive-ones-iii | | 1050-construct-binary-search-tree-from-preorder-traversal | | 1056-capacity-to-ship-packages-within-d-days | | 1087-longest-arithmetic-subsequence | | 1408-find-the-smallest-divisor-given-a-threshold | | 1646-kth-missing-positive-number | | 2141-maximum-running-time-of-n-computers | | 2392-successful-pairs-of-spells-and-potions | | 2618-maximize-the-minimum-powered-city | | 2720-minimize-the-maximum-difference-of-pairs | | 3437-maximum-total-damage-with-spell-casting | | 3619-adjacent-increasing-subarrays-detection-ii | | 3622-maximum-frequency-of-an-element-after-performing-operations-i | | 3640-maximum-frequency-of-an-element-after-performing-operations-ii |
Binary Tree
| | | ——- | | 0094-binary-tree-inorder-traversal | | 0095-unique-binary-search-trees-ii | | 0096-unique-binary-search-trees | | 0098-validate-binary-search-tree | | 0099-recover-binary-search-tree | | 0100-same-tree | | 0102-binary-tree-level-order-traversal | | 0103-binary-tree-zigzag-level-order-traversal | | 0104-maximum-depth-of-binary-tree | | 0105-construct-binary-tree-from-preorder-and-inorder-traversal | | 0106-construct-binary-tree-from-inorder-and-postorder-traversal | | 0108-convert-sorted-array-to-binary-search-tree | | 0110-balanced-binary-tree | | 0114-flatten-binary-tree-to-linked-list | | 0144-binary-tree-preorder-traversal | | 0145-binary-tree-postorder-traversal | | 0199-binary-tree-right-side-view | | 0222-count-complete-tree-nodes | | 0230-kth-smallest-element-in-a-bst | | 0235-lowest-common-ancestor-of-a-binary-search-tree | | 0236-lowest-common-ancestor-of-a-binary-tree | | 0437-path-sum-iii | | 0450-delete-node-in-a-bst | | 0543-diameter-of-binary-tree | | 0653-two-sum-iv-input-is-a-bst | | 0783-search-in-a-binary-search-tree | | 0784-insert-into-a-binary-search-tree | | 1050-construct-binary-search-tree-from-preorder-traversal | | 2461-amount-of-time-for-binary-tree-to-be-infected |
Math
| | | ——- | | 0002-add-two-numbers | | 0007-reverse-integer | | 0009-palindrome-number | | 0013-roman-to-integer | | 0048-rotate-image | | 0050-powx-n | | 0062-unique-paths | | 0069-sqrtx | | 0070-climbing-stairs | | 0096-unique-binary-search-trees | | 0189-rotate-array | | 0204-count-primes | | 0231-power-of-two | | 0241-different-ways-to-add-parentheses | | 0268-missing-number | | 0279-perfect-squares | | 0357-count-numbers-with-unique-digits | | 0367-valid-perfect-square | | 0368-largest-divisible-subset | | 0371-sum-of-two-integers | | 0375-guess-number-higher-or-lower-ii | | 1636-number-of-substrings-with-only-1s | | 1642-water-bottles | | 1922-count-good-numbers | | 1993-sum-of-all-subset-xor-totals | | 2032-largest-odd-number-in-string | | 2106-find-greatest-common-divisor-of-array | | 2174-next-greater-numerically-balanced-number | | 2244-number-of-laser-beams-in-a-bank | | 2288-count-operations-to-obtain-zero | | 2481-strictly-palindromic-number | | 2661-smallest-missing-non-negative-integer-after-operations | | 2753-minimum-number-of-operations-to-make-all-array-elements-equal-to-1 | | 2903-insert-greatest-common-divisors-in-linked-list | | 3190-find-minimum-operations-to-make-all-elements-divisible-by-three | | 3676-smallest-number-with-all-set-bits | | 3768-check-if-digits-are-equal-in-string-after-operations-i | | 3851-find-sum-of-array-product-of-magical-sequences |
Recursion
| | | ——- | | 0002-add-two-numbers | | 0021-merge-two-sorted-lists | | 0024-swap-nodes-in-pairs | | 0025-reverse-nodes-in-k-group | | 0044-wildcard-matching | | 0050-powx-n | | 0143-reorder-list | | 0206-reverse-linked-list | | 0231-power-of-two | | 0234-palindrome-linked-list | | 0241-different-ways-to-add-parentheses | | 1922-count-good-numbers |
Bit Manipulation
| | | ——- | | 0078-subsets | | 0090-subsets-ii | | 0136-single-number | | 0191-number-of-1-bits | | 0222-count-complete-tree-nodes | | 0231-power-of-two | | 0268-missing-number | | 0287-find-the-duplicate-number | | 0371-sum-of-two-integers | | 1732-minimum-one-bit-operations-to-make-integers-zero | | 1930-unique-length-3-palindromic-subsequences | | 1993-sum-of-all-subset-xor-totals | | 2519-find-the-original-array-of-prefix-xor | | 3233-maximize-the-number-of-partitions-after-operations | | 3315-construct-the-minimum-bitwise-array-ii | | 3676-smallest-number-with-all-set-bits | | 3851-find-sum-of-array-product-of-magical-sequences |
Backtracking
| | | ——- | | 0022-generate-parentheses | | 0037-sudoku-solver | | 0039-combination-sum | | 0046-permutations | | 0051-n-queens | | 0078-subsets | | 0090-subsets-ii | | 0095-unique-binary-search-trees-ii | | 0131-palindrome-partitioning | | 0357-count-numbers-with-unique-digits | | 0494-target-sum | | 1993-sum-of-all-subset-xor-totals | | 2174-next-greater-numerically-balanced-number |
Hash Table
| | | ——- | | 0001-two-sum | | 0003-longest-substring-without-repeating-characters | | 0013-roman-to-integer | | 0037-sudoku-solver | | 0073-set-matrix-zeroes | | 0105-construct-binary-tree-from-preorder-and-inorder-traversal | | 0106-construct-binary-tree-from-inorder-and-postorder-traversal | | 0128-longest-consecutive-sequence | | 0141-linked-list-cycle | | 0142-linked-list-cycle-ii | | 0160-intersection-of-two-linked-lists | | 0169-majority-element | | 0205-isomorphic-strings | | 0217-contains-duplicate | | 0242-valid-anagram | | 0268-missing-number | | 0349-intersection-of-two-arrays | | 0387-first-unique-character-in-a-string | | 0424-longest-repeating-character-replacement | | 0496-next-greater-element-i | | 0560-subarray-sum-equals-k | | 0567-permutation-in-string | | 0653-two-sum-iv-input-is-a-bst | | 0930-binary-subarrays-with-sum | | 0966-binary-subarrays-with-sum | | 1087-longest-arithmetic-subsequence | | 1129-longest-string-chain | | 1330-longest-arithmetic-subsequence-of-given-difference | | 1460-number-of-substrings-containing-all-three-characters | | 1636-sort-array-by-increasing-frequency | | 1798-max-number-of-k-sum-pairs | | 1930-unique-length-3-palindromic-subsequences | | 2169-simple-bank-system | | 2174-next-greater-numerically-balanced-number | | 2274-keep-multiplying-found-values-by-two | | 2461-amount-of-time-for-binary-tree-to-be-infected | | 2520-using-a-robot-to-print-the-lexicographically-smallest-string | | 2661-smallest-missing-non-negative-integer-after-operations | | 3005-count-elements-with-maximum-frequency | | 3437-maximum-total-damage-with-spell-casting | | 3501-delete-nodes-from-linked-list-present-in-array | | 3592-find-x-sum-of-all-k-long-subarrays-ii | | 3610-find-x-sum-of-all-k-long-subarrays-i | | 3834-minimum-operations-to-convert-all-elements-to-zero | | 3863-power-grid-maintenance |
Matrix
| | | ——- | | 0037-sudoku-solver | | 0048-rotate-image | | 0063-unique-paths-ii | | 0064-minimum-path-sum | | 0073-set-matrix-zeroes | | 0074-search-a-2d-matrix | | 0130-surrounded-regions | | 0200-number-of-islands | | 0221-maximal-square | | 0407-trapping-rain-water-ii | | 0417-pacific-atlantic-water-flow | | 0542-01-matrix | | 0733-flood-fill | | 0994-rotting-oranges | | 1036-rotting-oranges | | 2244-number-of-laser-beams-in-a-bank | | 2343-count-unguarded-cells-in-the-grid | | 2435-paths-in-matrix-whose-sum-is-divisible-by-k | | 2625-increment-submatrices-by-one |
Linked List
| | | ——- | | 0002-add-two-numbers | | 0019-remove-nth-node-from-end-of-list | | 0021-merge-two-sorted-lists | | 0024-swap-nodes-in-pairs | | 0025-reverse-nodes-in-k-group | | 0061-rotate-list | | 0082-remove-duplicates-from-sorted-list-ii | | 0083-remove-duplicates-from-sorted-list | | 0086-partition-list | | 0114-flatten-binary-tree-to-linked-list | | 0141-linked-list-cycle | | 0142-linked-list-cycle-ii | | 0143-reorder-list | | 0160-intersection-of-two-linked-lists | | 0206-reverse-linked-list | | 0234-palindrome-linked-list | | 0528-swapping-nodes-in-a-linked-list | | 0908-middle-of-the-linked-list | | 1765-merge-in-between-linked-lists | | 2095-delete-the-middle-node-of-a-linked-list | | 2216-delete-the-middle-node-of-a-linked-list | | 2903-insert-greatest-common-divisors-in-linked-list | | 3501-delete-nodes-from-linked-list-present-in-array |
Two Pointers
| | | ——- | | 0011-container-with-most-water | | 0016-3sum-closest | | 0019-remove-nth-node-from-end-of-list | | 0026-remove-duplicates-from-sorted-array | | 0027-remove-element | | 0031-next-permutation | | 0042-trapping-rain-water | | 0061-rotate-list | | 0075-sort-colors | | 0082-remove-duplicates-from-sorted-list-ii | | 0086-partition-list | | 0088-merge-sorted-array | | 0125-valid-palindrome | | 0141-linked-list-cycle | | 0142-linked-list-cycle-ii | | 0143-reorder-list | | 0151-reverse-words-in-a-string | | 0160-intersection-of-two-linked-lists | | 0189-rotate-array | | 0234-palindrome-linked-list | | 0283-move-zeroes | | 0287-find-the-duplicate-number | | 0344-reverse-string | | 0349-intersection-of-two-arrays | | 0443-string-compression | | 0455-assign-cookies | | 0528-swapping-nodes-in-a-linked-list | | 0567-permutation-in-string | | 0653-two-sum-iv-input-is-a-bst | | 0908-middle-of-the-linked-list | | 1129-longest-string-chain | | 1798-max-number-of-k-sum-pairs | | 2095-delete-the-middle-node-of-a-linked-list | | 2216-delete-the-middle-node-of-a-linked-list | | 2271-rearrange-array-elements-by-sign | | 2392-successful-pairs-of-spells-and-potions | | 2481-strictly-palindromic-number | | 3437-maximum-total-damage-with-spell-casting |
String
| | | ——- | | 0003-longest-substring-without-repeating-characters | | 0008-string-to-integer-atoi | | 0013-roman-to-integer | | 0020-valid-parentheses | | 0022-generate-parentheses | | 0032-longest-valid-parentheses | | 0044-wildcard-matching | | 0072-edit-distance | | 0091-decode-ways | | 0097-interleaving-string | | 0115-distinct-subsequences | | 0125-valid-palindrome | | 0131-palindrome-partitioning | | 0132-palindrome-partitioning-ii | | 0151-reverse-words-in-a-string | | 0205-isomorphic-strings | | 0241-different-ways-to-add-parentheses | | 0242-valid-anagram | | 0344-reverse-string | | 0387-first-unique-character-in-a-string | | 0402-remove-k-digits | | 0424-longest-repeating-character-replacement | | 0443-string-compression | | 0474-ones-and-zeroes | | 0516-longest-palindromic-subsequence | | 0567-permutation-in-string | | 0583-delete-operation-for-two-strings | | 0678-valid-parenthesis-string | | 0812-rotate-string | | 1129-longest-string-chain | | 1250-longest-common-subsequence | | 1437-minimum-insertion-steps-to-make-a-string-palindrome | | 1460-number-of-substrings-containing-all-three-characters | | 1636-number-of-substrings-with-only-1s | | 1700-minimum-time-to-make-rope-colorful | | 1930-unique-length-3-palindromic-subsequences | | 2021-remove-all-occurrences-of-a-substring | | 2032-largest-odd-number-in-string | | 2244-number-of-laser-beams-in-a-bank | | 2520-using-a-robot-to-print-the-lexicographically-smallest-string | | 2976-minimum-cost-to-convert-string-i | | 3233-maximize-the-number-of-partitions-after-operations | | 3479-count-the-number-of-substrings-with-dominant-ones | | 3493-maximum-number-of-operations-to-move-ones-to-the-end | | 3768-check-if-digits-are-equal-in-string-after-operations-i |
Stack
| | | ——- | | 0020-valid-parentheses | | 0032-longest-valid-parentheses | | 0042-trapping-rain-water | | 0084-largest-rectangle-in-histogram | | 0094-binary-tree-inorder-traversal | | 0114-flatten-binary-tree-to-linked-list | | 0143-reorder-list | | 0144-binary-tree-preorder-traversal | | 0145-binary-tree-postorder-traversal | | 0155-min-stack | | 0225-implement-stack-using-queues | | 0232-implement-queue-using-stacks | | 0234-palindrome-linked-list | | 0402-remove-k-digits | | 0496-next-greater-element-i | | 0678-valid-parenthesis-string | | 0735-asteroid-collision | | 0937-online-stock-span | | 1050-construct-binary-search-tree-from-preorder-traversal | | 1552-build-an-array-with-stack-operations | | 1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array | | 2021-remove-all-occurrences-of-a-substring | | 2520-using-a-robot-to-print-the-lexicographically-smallest-string | | 3834-minimum-operations-to-convert-all-elements-to-zero |
Design
| | | ——- | | 0155-min-stack | | 0225-implement-stack-using-queues | | 0232-implement-queue-using-stacks | | 0937-online-stock-span | | 2169-simple-bank-system |
Monotonic Stack
| | | ——- | | 0042-trapping-rain-water | | 0084-largest-rectangle-in-histogram | | 0402-remove-k-digits | | 0496-next-greater-element-i | | 0937-online-stock-span | | 1050-construct-binary-search-tree-from-preorder-traversal | | 1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array | | 3834-minimum-operations-to-convert-all-elements-to-zero |
Data Stream
| | | ——- | | 0937-online-stock-span |
Greedy
| | | ——- | | 0011-container-with-most-water | | 0044-wildcard-matching | | 0045-jump-game-ii | | 0055-jump-game | | 0122-best-time-to-buy-and-sell-stock-ii | | 0402-remove-k-digits | | 0410-split-array-largest-sum | | 0435-non-overlapping-intervals | | 0455-assign-cookies | | 0678-valid-parenthesis-string | | 0714-best-time-to-buy-and-sell-stock-with-transaction-fee | | 0759-set-intersection-size-at-least-two | | 0890-lemonade-change | | 1262-greatest-sum-divisible-by-three | | 1489-pizza-with-3n-slices | | 1503-reducing-dishes | | 1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array | | 1700-minimum-time-to-make-rope-colorful | | 1952-minimum-sideway-jumps | | 2032-largest-odd-number-in-string | | 2141-maximum-running-time-of-n-computers | | 2520-using-a-robot-to-print-the-lexicographically-smallest-string | | 2618-maximize-the-minimum-powered-city | | 2661-smallest-missing-non-negative-integer-after-operations | | 2720-minimize-the-maximum-difference-of-pairs | | 3493-maximum-number-of-operations-to-move-ones-to-the-end | | 3620-maximum-number-of-distinct-elements-after-operations | | 3834-minimum-operations-to-convert-all-elements-to-zero |
Queue
| | | ——- | | 0225-implement-stack-using-queues | | 0232-implement-queue-using-stacks | | 0239-sliding-window-maximum | | 0387-first-unique-character-in-a-string | | 2618-maximize-the-minimum-powered-city |
Sliding Window
| | | ——- | | 0003-longest-substring-without-repeating-characters | | 0209-minimum-size-subarray-sum | | 0239-sliding-window-maximum | | 0424-longest-repeating-character-replacement | | 0567-permutation-in-string | | 0930-binary-subarrays-with-sum | | 0966-binary-subarrays-with-sum | | 1004-max-consecutive-ones-iii | | 1046-max-consecutive-ones-iii | | 1460-number-of-substrings-containing-all-three-characters | | 1538-maximum-points-you-can-obtain-from-cards | | 1984-minimum-difference-between-highest-and-lowest-of-k-scores | | 2618-maximize-the-minimum-powered-city | | 3479-count-the-number-of-substrings-with-dominant-ones | | 3592-find-x-sum-of-all-k-long-subarrays-ii | | 3610-find-x-sum-of-all-k-long-subarrays-i | | 3622-maximum-frequency-of-an-element-after-performing-operations-i | | 3640-maximum-frequency-of-an-element-after-performing-operations-ii |
Heap (Priority Queue)
| | | ——- | | 0239-sliding-window-maximum | | 0407-trapping-rain-water-ii | | 1489-pizza-with-3n-slices | | 3592-find-x-sum-of-all-k-long-subarrays-ii | | 3610-find-x-sum-of-all-k-long-subarrays-i | | 3863-power-grid-maintenance |
Monotonic Queue
| | | ——- | | 0239-sliding-window-maximum |
Sorting
| | | ——- | | 0016-3sum-closest | | 0075-sort-colors | | 0088-merge-sorted-array | | 0169-majority-element | | 0217-contains-duplicate | | 0242-valid-anagram | | 0268-missing-number | | 0349-intersection-of-two-arrays | | 0354-russian-doll-envelopes | | 0368-largest-divisible-subset | | 0435-non-overlapping-intervals | | 0455-assign-cookies | | 0759-set-intersection-size-at-least-two | | 1129-longest-string-chain | | 1200-minimum-absolute-difference | | 1262-greatest-sum-divisible-by-three | | 1503-reducing-dishes | | 1636-sort-array-by-increasing-frequency | | 1669-minimum-cost-to-cut-a-stick | | 1798-max-number-of-k-sum-pairs | | 1984-minimum-difference-between-highest-and-lowest-of-k-scores | | 2141-maximum-running-time-of-n-computers | | 2274-keep-multiplying-found-values-by-two | | 2392-successful-pairs-of-spells-and-potions | | 2720-minimize-the-maximum-difference-of-pairs | | 3437-maximum-total-damage-with-spell-casting | | 3620-maximum-number-of-distinct-elements-after-operations | | 3622-maximum-frequency-of-an-element-after-performing-operations-i | | 3640-maximum-frequency-of-an-element-after-performing-operations-ii |
Dynamic Programming
| | | ——- | | 0022-generate-parentheses | | 0032-longest-valid-parentheses | | 0042-trapping-rain-water | | 0044-wildcard-matching | | 0045-jump-game-ii | | 0053-maximum-subarray | | 0055-jump-game | | 0062-unique-paths | | 0063-unique-paths-ii | | 0064-minimum-path-sum | | 0070-climbing-stairs | | 0072-edit-distance | | 0091-decode-ways | | 0095-unique-binary-search-trees-ii | | 0096-unique-binary-search-trees | | 0097-interleaving-string | | 0115-distinct-subsequences | | 0118-pascals-triangle | | 0119-pascals-triangle-ii | | 0120-triangle | | 0121-best-time-to-buy-and-sell-stock | | 0122-best-time-to-buy-and-sell-stock-ii | | 0123-best-time-to-buy-and-sell-stock-iii | | 0131-palindrome-partitioning | | 0132-palindrome-partitioning-ii | | 0152-maximum-product-subarray | | 0188-best-time-to-buy-and-sell-stock-iv | | 0198-house-robber | | 0213-house-robber-ii | | 0221-maximal-square | | 0241-different-ways-to-add-parentheses | | 0279-perfect-squares | | 0300-longest-increasing-subsequence | | 0309-best-time-to-buy-and-sell-stock-with-cooldown | | 0322-coin-change | | 0354-russian-doll-envelopes | | 0357-count-numbers-with-unique-digits | | 0368-largest-divisible-subset | | 0375-guess-number-higher-or-lower-ii | | 0377-combination-sum-iv | | 0410-split-array-largest-sum | | 0416-partition-equal-subset-sum | | 0435-non-overlapping-intervals | | 0474-ones-and-zeroes | | 0494-target-sum | | 0516-longest-palindromic-subsequence | | 0518-coin-change-ii | | 0542-01-matrix | | 0583-delete-operation-for-two-strings | | 0673-number-of-longest-increasing-subsequence | | 0678-valid-parenthesis-string | | 0714-best-time-to-buy-and-sell-stock-with-transaction-fee | | 0746-min-cost-climbing-stairs | | 0747-min-cost-climbing-stairs | | 0801-minimum-swaps-to-make-sequences-increasing | | 0819-minimum-swaps-to-make-sequences-increasing | | 1025-minimum-cost-for-tickets | | 1087-longest-arithmetic-subsequence | | 1111-minimum-score-triangulation-of-polygon | | 1121-partition-array-for-maximum-sum | | 1129-longest-string-chain | | 1155-number-of-dice-rolls-with-target-sum | | 1250-longest-common-subsequence | | 1262-greatest-sum-divisible-by-three | | 1263-number-of-dice-rolls-with-target-sum | | 1330-longest-arithmetic-subsequence-of-given-difference | | 1437-minimum-insertion-steps-to-make-a-string-palindrome | | 1489-pizza-with-3n-slices | | 1503-reducing-dishes | | 1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array | | 1669-minimum-cost-to-cut-a-stick | | 1700-minimum-time-to-make-rope-colorful | | 1732-minimum-one-bit-operations-to-make-integers-zero | | 1952-minimum-sideway-jumps | | 2435-paths-in-matrix-whose-sum-is-divisible-by-k | | 2720-minimize-the-maximum-difference-of-pairs | | 3233-maximize-the-number-of-partitions-after-operations | | 3437-maximum-total-damage-with-spell-casting | | 3851-find-sum-of-array-product-of-magical-sequences |
Union Find
| | | ——- | | 0128-longest-consecutive-sequence | | 0130-surrounded-regions | | 0200-number-of-islands | | 0547-number-of-provinces | | 3863-power-grid-maintenance |
Simulation
| | | ——- | | 0735-asteroid-collision | | 1552-build-an-array-with-stack-operations | | 1642-water-bottles | | 2021-remove-all-occurrences-of-a-substring | | 2058-concatenation-of-array | | 2169-simple-bank-system | | 2271-rearrange-array-elements-by-sign | | 2274-keep-multiplying-found-values-by-two | | 2288-count-operations-to-obtain-zero | | 2343-count-unguarded-cells-in-the-grid | | 3616-make-array-elements-equal-to-zero | | 3768-check-if-digits-are-equal-in-string-after-operations-i | | 3794-find-the-minimum-amount-of-time-to-brew-potions |
Prefix Sum
| | | ——- | | 0209-minimum-size-subarray-sum | | 0410-split-array-largest-sum | | 0560-subarray-sum-equals-k | | 0930-binary-subarrays-with-sum | | 0966-binary-subarrays-with-sum | | 1004-max-consecutive-ones-iii | | 1046-max-consecutive-ones-iii | | 1538-maximum-points-you-can-obtain-from-cards | | 1930-unique-length-3-palindromic-subsequences | | 2618-maximize-the-minimum-powered-city | | 2625-increment-submatrices-by-one | | 3383-taking-maximum-energy-from-the-mystic-dungeon | | 3616-make-array-elements-equal-to-zero | | 3622-maximum-frequency-of-an-element-after-performing-operations-i | | 3640-maximum-frequency-of-an-element-after-performing-operations-ii | | 3794-find-the-minimum-amount-of-time-to-brew-potions |
Counting
| | | ——- | | 0169-majority-element | | 0387-first-unique-character-in-a-string | | 2174-next-greater-numerically-balanced-number | | 3005-count-elements-with-maximum-frequency | | 3437-maximum-total-damage-with-spell-casting | | 3493-maximum-number-of-operations-to-move-ones-to-the-end |
Combinatorics
| | | ——- | | 0062-unique-paths | | 1993-sum-of-all-subset-xor-totals | | 3768-check-if-digits-are-equal-in-string-after-operations-i | | 3851-find-sum-of-array-product-of-magical-sequences |
Enumeration
| | | ——- | | 0204-count-primes | | 1993-sum-of-all-subset-xor-totals | | 2174-next-greater-numerically-balanced-number | | 3479-count-the-number-of-substrings-with-dominant-ones |
Depth-First Search
| | | ——- | | 0094-binary-tree-inorder-traversal | | 0098-validate-binary-search-tree | | 0099-recover-binary-search-tree | | 0100-same-tree | | 0104-maximum-depth-of-binary-tree | | 0110-balanced-binary-tree | | 0114-flatten-binary-tree-to-linked-list | | 0130-surrounded-regions | | 0144-binary-tree-preorder-traversal | | 0145-binary-tree-postorder-traversal | | 0199-binary-tree-right-side-view | | 0200-number-of-islands | | 0207-course-schedule | | 0230-kth-smallest-element-in-a-bst | | 0235-lowest-common-ancestor-of-a-binary-search-tree | | 0236-lowest-common-ancestor-of-a-binary-tree | | 0417-pacific-atlantic-water-flow | | 0437-path-sum-iii | | 0543-diameter-of-binary-tree | | 0547-number-of-provinces | | 0653-two-sum-iv-input-is-a-bst | | 0733-flood-fill | | 2461-amount-of-time-for-binary-tree-to-be-infected | | 3863-power-grid-maintenance |
Breadth-First Search
| | | ——- | | 0100-same-tree | | 0102-binary-tree-level-order-traversal | | 0103-binary-tree-zigzag-level-order-traversal | | 0104-maximum-depth-of-binary-tree | | 0130-surrounded-regions | | 0199-binary-tree-right-side-view | | 0200-number-of-islands | | 0207-course-schedule | | 0279-perfect-squares | | 0322-coin-change | | 0407-trapping-rain-water-ii | | 0417-pacific-atlantic-water-flow | | 0542-01-matrix | | 0547-number-of-provinces | | 0653-two-sum-iv-input-is-a-bst | | 0733-flood-fill | | 0994-rotting-oranges | | 1036-rotting-oranges | | 2461-amount-of-time-for-binary-tree-to-be-infected | | 3863-power-grid-maintenance |
String Matching
| | | ——- | | 0812-rotate-string |
Number Theory
| | | ——- | | 0204-count-primes | | 2106-find-greatest-common-divisor-of-array | | 2753-minimum-number-of-operations-to-make-all-array-elements-equal-to-1 | | 2903-insert-greatest-common-divisors-in-linked-list | | 3768-check-if-digits-are-equal-in-string-after-operations-i |
Memoization
| | | ——- | | 0070-climbing-stairs | | 0241-different-ways-to-add-parentheses | | 1732-minimum-one-bit-operations-to-make-integers-zero |
Brainteaser
| | | ——- | | 2481-strictly-palindromic-number |
Binary Indexed Tree
| | | ——- | | 0673-number-of-longest-increasing-subsequence |
Segment Tree
| | | ——- | | 0673-number-of-longest-increasing-subsequence |
Game Theory
| | | ——- | | 0375-guess-number-higher-or-lower-ii |
Graph
| | | ——- | | 0207-course-schedule | | 0547-number-of-provinces | | 3863-power-grid-maintenance |
Bitmask
| | | ——- | | 3233-maximize-the-number-of-partitions-after-operations | | 3851-find-sum-of-array-product-of-magical-sequences |
Ordered Set
| | | ——- | | 3863-power-grid-maintenance |
Topological Sort
| | | ——- | | 0207-course-schedule |
Union-Find
| | | ——- | | 0200-number-of-islands |
Graph Theory
| | | ——- | | 2976-minimum-cost-to-convert-string-i |
Shortest Path
| | | ——- | | 2976-minimum-cost-to-convert-string-i |
💡 Repository Highlights
- ✅ Clean directory structure: Each problem has its own folder.
- 📂 Synced via LeetHub extension.
- 🧠 Problems range from Easy to Hard covering real interview topics.
- 🚀 Aimed to build solid fundamentals in:
- Bit Manipulation
- Recursion and Backtracking
- Linked Lists, Trees, Graphs
- Dynamic Programming
- System Design (future update)
🧠 My Tech Stack
| Language | Tools/Frameworks |
|---|---|
| C++, Java | Spring Boot, Hibernate |
| SQL | MySQL Workbench, PostgreSQL |
| Web Dev | HTML, CSS, JavaScript, PHP |
| Version Control | Git, GitHub |
| Others | Data Structures & Algorithms |
🎯 Current Focus
- 💼 Preparing for Product-Based Company placements
- 🧮 Solving 1-2 LeetCode problems daily
- 🌱 Learning Spring Boot for backend development
- 🏦 Target: Fintech Sector
Each folder contains:
.cppsolution file- Auto-generated comments for time & space complexity
📊 GitHub Stats
Stay tuned! I’m working on integrating:
- LeetCode stats badge
- Heatmap activity
- Weekly progress updates
📬 Connect With Me
- 📧 Email: kshivay@gmail.com
- 💼 LinkedIn: linkedin.com/in/shivamkachhadiya
- 🧠 LeetCode: leetcode.com/shivamkachhadiya
⭐ Final Note
If you’re on a similar journey, feel free to fork or follow!
Consistency beats intensity. Keep solving!