🚀 A curated collection of my LeetCode DSA solutions in Java/C++/Python. Covers all major topics with clean, optimized code and complexity analysis with clear explanation. Ideal for coding interviews, competitive programming, and mastering core DSA concepts. ⭐ Stay consistent, code smarter!
| 0001-two-sum |
| 0141-linked-list-cycle |
| 0004-median-of-two-sorted-arrays |
| 0033-search-in-rotated-sorted-array |
| 0074-search-a-2d-matrix |
| 0209-minimum-size-subarray-sum |
| 0004-median-of-two-sorted-arrays |
| 0053-maximum-subarray |
| 0215-kth-largest-element-in-an-array |
| 0007-reverse-integer |
| 0009-palindrome-number |
| 0050-powx-n |
| 0070-climbing-stairs |
| 0089-gray-code |
| 0189-rotate-array |
| 0204-count-primes |
| 3234-double-modular-exponentiation |
| 0011-container-with-most-water |
| 0026-remove-duplicates-from-sorted-array |
| 0027-remove-element |
| 0141-linked-list-cycle |
| 0189-rotate-array |
| 0011-container-with-most-water |
| 0020-valid-parentheses |
| 1250-longest-common-subsequence |
| 0020-valid-parentheses |
| 0094-binary-tree-inorder-traversal |
| 0021-merge-two-sorted-lists |
| 0024-swap-nodes-in-pairs |
| 0141-linked-list-cycle |
| 0021-merge-two-sorted-lists |
| 0024-swap-nodes-in-pairs |
| 0050-powx-n |
| 0039-combination-sum |
| 0089-gray-code |
| 0053-maximum-subarray |
| 0070-climbing-stairs |
| 1250-longest-common-subsequence |
| 0070-climbing-stairs |
| 0089-gray-code |
| 0136-single-number |
| 0215-kth-largest-element-in-an-array |
| 0215-kth-largest-element-in-an-array |
| 0215-kth-largest-element-in-an-array |
| 0094-binary-tree-inorder-traversal |
| 0098-validate-binary-search-tree |
| 0094-binary-tree-inorder-traversal |
| 0098-validate-binary-search-tree |
| 0094-binary-tree-inorder-traversal |
| 0098-validate-binary-search-tree |
| 0098-validate-binary-search-tree |
| 0209-minimum-size-subarray-sum |
| 0209-minimum-size-subarray-sum |
| 0204-count-primes |
| 0204-count-primes |
| 3234-double-modular-exponentiation |
| 0074-search-a-2d-matrix |