🚀 LEETCODE-DSA

A structured collection of my LeetCode problem solutions in C++.
This repository is automatically synced using LeetSync and maintained to improve Data Structures & Algorithms skills.

📌 About

💻 Language: C++
🔁 Auto Synced via: LeetSync
🎯 Goal: Strengthen problem-solving & crack technical interviews
📂 Organized by: LeetCode question titles (auto-generated)

🧠 Topics Covered

Arrays
Strings
Linked List
Stack
Queue
Binary Search
Binary Tree
BST
Heap / Priority Queue
Graph
Dynamic Programming
Greedy
Backtracking
Bit Manipulation
Math
Design

📈 Progress

I consistently solve LeetCode problems and push them here to maintain my coding streak and track progress.

“Consistency beats intensity.”

🔗 LeetCode Profile

https://leetcode.com/u/karannayal13/

⭐ Why this Repository?

Track daily DSA practice
Structured revision before interviews
Public coding portfolio
Maintain GitHub contribution streak

📢 Note

All solutions are written in clean and optimized C++ code, directly compatible with LeetCode submissions.

🔥 Keep coding. Keep growing.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

🚀 LEETCODE-DSA

📌 About

🧠 Topics Covered

📈 Progress

🔗 LeetCode Profile

⭐ Why this Repository?

📢 Note

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 357 Commits
100-same-tree		100-same-tree
101-symmetric-tree		101-symmetric-tree
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
1054-complement-of-base-10-integer		1054-complement-of-base-10-integer
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
1079-sum-of-root-to-leaf-binary-numbers		1079-sum-of-root-to-leaf-binary-numbers
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
112-path-sum		112-path-sum
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
120-triangle		120-triangle
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
133-clone-graph		133-clone-graph
136-single-number		136-single-number
137-single-number-ii		137-single-number-ii
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
139-word-break		139-word-break
141-linked-list-cycle		141-linked-list-cycle
1443-minimum-distance-to-type-a-word-using-two-fingers		1443-minimum-distance-to-type-a-word-using-two-fingers
1458-sort-integers-by-the-number-of-1-bits		1458-sort-integers-by-the-number-of-1-bits
146-lru-cache		146-lru-cache
148-sort-list		148-sort-list
149-max-points-on-a-line		149-max-points-on-a-line
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
1507-check-if-there-is-a-valid-path-in-a-grid		1507-check-if-there-is-a-valid-path-in-a-grid
1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one		1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
154-find-minimum-in-rotated-sorted-array-ii		154-find-minimum-in-rotated-sorted-array-ii
155-min-stack		155-min-stack
1557-check-if-a-string-contains-all-binary-codes-of-size-k		1557-check-if-a-string-contains-all-binary-codes-of-size-k
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1658-minimum-swaps-to-arrange-a-binary-grid		1658-minimum-swaps-to-arrange-a-binary-grid
1663-detect-cycles-in-2d-grid		1663-detect-cycles-in-2d-grid
1667-find-kth-bit-in-nth-binary-string		1667-find-kth-bit-in-nth-binary-string
17-letter-combinations-of-a-phone-number		17-letter-combinations-of-a-phone-number
1704-special-positions-in-a-binary-matrix		1704-special-positions-in-a-binary-matrix
1716-maximum-non-negative-product-in-a-matrix		1716-maximum-non-negative-product-in-a-matrix
172-factorial-trailing-zeroes		172-factorial-trailing-zeroes
1728-fancy-sequence		1728-fancy-sequence
173-binary-search-tree-iterator		173-binary-search-tree-iterator
1784-minimum-initial-energy-to-finish-tasks		1784-minimum-initial-energy-to-finish-tasks
1793-minimum-moves-to-make-array-complementary		1793-minimum-moves-to-make-array-complementary
1800-concatenation-of-consecutive-binary-numbers		1800-concatenation-of-consecutive-binary-numbers
1807-partitioning-into-minimum-number-of-deci-binary-numbers		1807-partitioning-into-minimum-number-of-deci-binary-numbers
1840-minimize-hamming-distance-after-swap-operations		1840-minimize-hamming-distance-after-swap-operations
188-best-time-to-buy-and-sell-stock-iv		188-best-time-to-buy-and-sell-stock-iv
1884-minimum-changes-to-make-alternating-binary-string		1884-minimum-changes-to-make-alternating-binary-string
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
191-number-of-1-bits		191-number-of-1-bits
1972-rotating-the-box		1972-rotating-the-box
1975-minimum-distance-to-the-target-element		1975-minimum-distance-to-the-target-element
198-house-robber		198-house-robber
1984-maximum-distance-between-a-pair-of-values		1984-maximum-distance-between-a-pair-of-values
199-binary-tree-right-side-view		199-binary-tree-right-side-view
1990-get-biggest-three-rhombus-sums-in-a-grid		1990-get-biggest-three-rhombus-sums-in-a-grid
200-number-of-islands		200-number-of-islands
201-bitwise-and-of-numbers-range		201-bitwise-and-of-numbers-range
2015-determine-whether-matrix-can-be-obtained-by-rotation		2015-determine-whether-matrix-can-be-obtained-by-rotation
202-happy-number		202-happy-number
2043-cyclically-rotating-a-grid		2043-cyclically-rotating-a-grid
208-implement-trie-prefix-tree		208-implement-trie-prefix-tree
211-design-add-and-search-words-data-structure		211-design-add-and-search-words-data-structure
212-word-search-ii		212-word-search-ii
215-kth-largest-element-in-an-array		215-kth-largest-element-in-an-array
2160-minimum-operations-to-make-a-uni-value-grid		2160-minimum-operations-to-make-a-uni-value-grid
2178-walking-robot-simulation-ii		2178-walking-robot-simulation-ii
219-contains-duplicate-ii		219-contains-duplicate-ii
2197-decode-the-slanted-ciphertext		2197-decode-the-slanted-ciphertext
2199-two-furthest-houses-with-different-colors		2199-two-furthest-houses-with-different-colors
22-generate-parentheses		22-generate-parentheses
221-maximal-square		221-maximal-square
222-count-complete-tree-nodes		222-count-complete-tree-nodes
224-basic-calculator		224-basic-calculator
226-invert-binary-tree		226-invert-binary-tree
228-summary-ranges		228-summary-ranges
23-merge-k-sorted-lists		23-merge-k-sorted-lists
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
236-lowest-common-ancestor-of-a-binary-tree		236-lowest-common-ancestor-of-a-binary-tree
25-reverse-nodes-in-k-group		25-reverse-nodes-in-k-group
2550-words-within-two-edits-of-dictionary		2550-words-within-two-edits-of-dictionary
2554-minimum-total-distance-traveled		2554-minimum-total-distance-traveled
2598-shortest-distance-to-target-string-in-a-circular-array		2598-shortest-distance-to-target-string-in-a-circular-array
2639-separate-the-digits-in-an-array		2639-separate-the-digits-in-an-array
2708-find-the-string-with-lcp		2708-find-the-string-with-lcp
2721-sum-of-distances		2721-sum-of-distances
2846-robot-collisions		2846-robot-collisions
2855-maximum-number-of-jumps-to-reach-the-last-index		2855-maximum-number-of-jumps-to-reach-the-last-index
289-game-of-life		289-game-of-life
2892-check-if-array-is-good		2892-check-if-array-is-good
295-find-median-from-data-stream		295-find-median-from-data-stream
2978-check-if-strings-can-be-made-equal-with-operations-ii		2978-check-if-strings-can-be-made-equal-with-operations-ii
2999-check-if-strings-can-be-made-equal-with-operations-i		2999-check-if-strings-can-be-made-equal-with-operations-i
30-substring-with-concatenation-of-all-words		30-substring-with-concatenation-of-all-words
300-longest-increasing-subsequence		300-longest-increasing-subsequence

Folders and files

Latest commit

History

Repository files navigation

🚀 LEETCODE-DSA

📌 About

🧠 Topics Covered

📈 Progress

🔗 LeetCode Profile

⭐ Why this Repository?

📢 Note

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages