DSA_IN_CPP

🚀 DSA_IN_CPP

LeetCode Journey by Shivam Kachhadiya

🚀 DSA_IN_CPP - LeetCode Journey by Shivam Kachhadiya

GitHub repo size LeetCode Progress Problems Solved Goal Location Languages Date Of Creation Time GitHub last commit GitHub commit activity GitHub file count GitHub language count Learning Profile Views

📌 About Me

LeetCode Stats

-- 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

Array Divide%20and%20Conquer Tree Binary%20Search%20Tree Binary%20Tree Math Recursion Bit%20Manipulation Backtracking Hash%20Table Matrix Linked%20List Two%20Pointers String Stack Design Monotonic%20Stack Data%20Stream

LeetCode Topics

Array

| | | ——- | | 0001-two-sum | | 0004-median-of-two-sorted-arrays | | 0011-container-with-most-water | | 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 | | 0046-permutations | | 0048-rotate-image | | 0051-n-queens | | 0053-maximum-subarray | | 0055-jump-game | | 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 | | 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 | | 0121-best-time-to-buy-and-sell-stock | | 0128-longest-consecutive-sequence | | 0136-single-number | | 0152-maximum-product-subarray | | 0153-find-minimum-in-rotated-sorted-array | | 0162-find-peak-element | | 0169-majority-element | | 0189-rotate-array | | 0209-minimum-size-subarray-sum | | 0217-contains-duplicate | | 0239-sliding-window-maximum | | 0268-missing-number | | 0283-move-zeroes | | 0287-find-the-duplicate-number | | 0349-intersection-of-two-arrays | | 0410-split-array-largest-sum | | 0455-assign-cookies | | 0485-max-consecutive-ones | | 0496-next-greater-element-i | | 0540-single-element-in-a-sorted-array | | 0560-subarray-sum-equals-k | | 0735-asteroid-collision | | 0792-binary-search | | 0882-peak-index-in-a-mountain-array | | 0890-lemonade-change | | 0907-koko-eating-bananas | | 0966-binary-subarrays-with-sum | | 1046-max-consecutive-ones-iii | | 1050-construct-binary-search-tree-from-preorder-traversal | | 1056-capacity-to-ship-packages-within-d-days | | 1408-find-the-smallest-divisor-given-a-threshold | | 1538-maximum-points-you-can-obtain-from-cards | | 1646-kth-missing-positive-number | | 1993-sum-of-all-subset-xor-totals | | 2058-concatenation-of-array | | 2106-find-greatest-common-divisor-of-array | | 2271-rearrange-array-elements-by-sign | | 2519-find-the-original-array-of-prefix-xor | | 2720-minimize-the-maximum-difference-of-pairs |

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 | | 0098-validate-binary-search-tree | | 0099-recover-binary-search-tree | | 0100-same-tree | | 0102-binary-tree-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 | | 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 | | 0349-intersection-of-two-arrays | | 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 | | 0882-peak-index-in-a-mountain-array | | 0907-koko-eating-bananas | | 1046-max-consecutive-ones-iii | | 1050-construct-binary-search-tree-from-preorder-traversal | | 1056-capacity-to-ship-packages-within-d-days | | 1408-find-the-smallest-divisor-given-a-threshold | | 1646-kth-missing-positive-number | | 2720-minimize-the-maximum-difference-of-pairs |

Binary Tree

| | | ——- | | 0094-binary-tree-inorder-traversal | | 0098-validate-binary-search-tree | | 0099-recover-binary-search-tree | | 0100-same-tree | | 0102-binary-tree-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

| | | ——- | | 0007-reverse-integer | | 0009-palindrome-number | | 0048-rotate-image | | 0050-powx-n | | 0069-sqrtx | | 0189-rotate-array | | 0231-power-of-two | | 0268-missing-number | | 0367-valid-perfect-square | | 0371-sum-of-two-integers | | 1993-sum-of-all-subset-xor-totals | | 2032-largest-odd-number-in-string | | 2106-find-greatest-common-divisor-of-array |

Recursion

| | | ——- | | 0021-merge-two-sorted-lists | | 0024-swap-nodes-in-pairs | | 0050-powx-n | | 0206-reverse-linked-list | | 0231-power-of-two | | 0234-palindrome-linked-list |

Bit Manipulation

| | | ——- | | 0078-subsets | | 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 | | 1993-sum-of-all-subset-xor-totals | | 2519-find-the-original-array-of-prefix-xor |

Backtracking

| | | ——- | | 0037-sudoku-solver | | 0039-combination-sum | | 0046-permutations | | 0051-n-queens | | 0078-subsets | | 0131-palindrome-partitioning | | 1993-sum-of-all-subset-xor-totals |

Hash Table

| | | ——- | | 0001-two-sum | | 0003-longest-substring-without-repeating-characters | | 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 | | 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 | | 0966-binary-subarrays-with-sum | | 1460-number-of-substrings-containing-all-three-characters | | 2461-amount-of-time-for-binary-tree-to-be-infected | | 2520-using-a-robot-to-print-the-lexicographically-smallest-string |

Matrix

| | | ——- | | 0037-sudoku-solver | | 0048-rotate-image | | 0073-set-matrix-zeroes | | 0074-search-a-2d-matrix |

Linked List

| | | ——- | | 0021-merge-two-sorted-lists | | 0024-swap-nodes-in-pairs | | 0061-rotate-list | | 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 | | 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 | | 2216-delete-the-middle-node-of-a-linked-list |

Two Pointers

| | | ——- | | 0011-container-with-most-water | | 0026-remove-duplicates-from-sorted-array | | 0027-remove-element | | 0031-next-permutation | | 0042-trapping-rain-water | | 0061-rotate-list | | 0075-sort-colors | | 0086-partition-list | | 0088-merge-sorted-array | | 0125-valid-palindrome | | 0141-linked-list-cycle | | 0142-linked-list-cycle-ii | | 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 | | 2216-delete-the-middle-node-of-a-linked-list | | 2271-rearrange-array-elements-by-sign |

String

| | | ——- | | 0003-longest-substring-without-repeating-characters | | 0020-valid-parentheses | | 0125-valid-palindrome | | 0131-palindrome-partitioning | | 0151-reverse-words-in-a-string | | 0205-isomorphic-strings | | 0344-reverse-string | | 0387-first-unique-character-in-a-string | | 0402-remove-k-digits | | 0424-longest-repeating-character-replacement | | 0443-string-compression | | 0567-permutation-in-string | | 0678-valid-parenthesis-string | | 0812-rotate-string | | 1460-number-of-substrings-containing-all-three-characters | | 2021-remove-all-occurrences-of-a-substring | | 2032-largest-odd-number-in-string | | 2520-using-a-robot-to-print-the-lexicographically-smallest-string |

Stack

| | | ——- | | 0020-valid-parentheses | | 0042-trapping-rain-water | | 0084-largest-rectangle-in-histogram | | 0094-binary-tree-inorder-traversal | | 0114-flatten-binary-tree-to-linked-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 | | 2021-remove-all-occurrences-of-a-substring | | 2520-using-a-robot-to-print-the-lexicographically-smallest-string |

Design

| | | ——- | | 0155-min-stack | | 0225-implement-stack-using-queues | | 0232-implement-queue-using-stacks | | 0937-online-stock-span |

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 |

Data Stream

| | | ——- | | 0937-online-stock-span |

Greedy

| | | ——- | | 0011-container-with-most-water | | 0055-jump-game | | 0402-remove-k-digits | | 0410-split-array-largest-sum | | 0455-assign-cookies | | 0678-valid-parenthesis-string | | 0890-lemonade-change | | 2032-largest-odd-number-in-string | | 2520-using-a-robot-to-print-the-lexicographically-smallest-string | | 2720-minimize-the-maximum-difference-of-pairs |

Queue

| | | ——- | | 0225-implement-stack-using-queues | | 0232-implement-queue-using-stacks | | 0239-sliding-window-maximum | | 0387-first-unique-character-in-a-string |

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 | | 0966-binary-subarrays-with-sum | | 1046-max-consecutive-ones-iii | | 1460-number-of-substrings-containing-all-three-characters | | 1538-maximum-points-you-can-obtain-from-cards |

Heap (Priority Queue)

| | | ——- | | 0239-sliding-window-maximum |

Monotonic Queue

| | | ——- | | 0239-sliding-window-maximum |

Sorting

| | | ——- | | 0075-sort-colors | | 0088-merge-sorted-array | | 0169-majority-element | | 0217-contains-duplicate | | 0268-missing-number | | 0349-intersection-of-two-arrays | | 0455-assign-cookies | | 2720-minimize-the-maximum-difference-of-pairs |

Dynamic Programming

| | | ——- | | 0042-trapping-rain-water | | 0053-maximum-subarray | | 0055-jump-game | | 0121-best-time-to-buy-and-sell-stock | | 0131-palindrome-partitioning | | 0152-maximum-product-subarray | | 0410-split-array-largest-sum | | 0678-valid-parenthesis-string | | 2720-minimize-the-maximum-difference-of-pairs |

Union Find

| | | ——- | | 0128-longest-consecutive-sequence |

Simulation

| | | ——- | | 0735-asteroid-collision | | 2021-remove-all-occurrences-of-a-substring | | 2058-concatenation-of-array | | 2271-rearrange-array-elements-by-sign |

Prefix Sum

| | | ——- | | 0209-minimum-size-subarray-sum | | 0410-split-array-largest-sum | | 0560-subarray-sum-equals-k | | 0966-binary-subarrays-with-sum | | 1046-max-consecutive-ones-iii | | 1538-maximum-points-you-can-obtain-from-cards |

Counting

| | | ——- | | 0169-majority-element | | 0387-first-unique-character-in-a-string |

Combinatorics

| | | ——- | | 1993-sum-of-all-subset-xor-totals |

Enumeration

| | | ——- | | 1993-sum-of-all-subset-xor-totals |

| | | ——- | | 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 | | 0144-binary-tree-preorder-traversal | | 0145-binary-tree-postorder-traversal | | 0199-binary-tree-right-side-view | | 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 | | 0543-diameter-of-binary-tree | | 0653-two-sum-iv-input-is-a-bst | | 2461-amount-of-time-for-binary-tree-to-be-infected |

| | | ——- | | 0100-same-tree | | 0102-binary-tree-level-order-traversal | | 0104-maximum-depth-of-binary-tree | | 0199-binary-tree-right-side-view | | 0653-two-sum-iv-input-is-a-bst | | 2461-amount-of-time-for-binary-tree-to-be-infected |

String Matching

| | | ——- | | 0812-rotate-string |

Number Theory

| | | ——- | | 2106-find-greatest-common-divisor-of-array |

💡 Repository Highlights

🧠 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

Each folder contains:

📊 GitHub Stats

Stay tuned! I’m working on integrating:

📬 Connect With Me

⭐ Final Note

If you’re on a similar journey, feel free to fork or follow!
Consistency beats intensity. Keep solving!