A curated collection of my LeetCode solutions, auto-synced using LeetHub v2. Each solution is written during real practice sessions — focused on understanding patterns, not memorising answers. Goal is to build the problem-solving intuition needed for technical interviews.
Target: 150+ problems across all major DSA topics.
| 0001-two-sum |
| 0003-longest-substring-without-repeating-characters |
| 0012-integer-to-roman |
| 0013-roman-to-integer |
| 0017-letter-combinations-of-a-phone-number |
| 0036-valid-sudoku |
| 0002-add-two-numbers |
| 0019-remove-nth-node-from-end-of-list |
| 0021-merge-two-sorted-lists |
| 0023-merge-k-sorted-lists |
| 0024-swap-nodes-in-pairs |
| 0025-reverse-nodes-in-k-group |
| 0002-add-two-numbers |
| 0007-reverse-integer |
| 0009-palindrome-number |
| 0012-integer-to-roman |
| 0013-roman-to-integer |
| 0029-divide-two-integers |
| 0002-add-two-numbers |
| 0010-regular-expression-matching |
| 0021-merge-two-sorted-lists |
| 0024-swap-nodes-in-pairs |
| 0025-reverse-nodes-in-k-group |
| 0003-longest-substring-without-repeating-characters |
| 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 |
| 0004-median-of-two-sorted-arrays |
| 0023-merge-k-sorted-lists |
| 0005-longest-palindromic-substring |
| 0010-regular-expression-matching |
| 0022-generate-parentheses |
| 0032-longest-valid-parentheses |
| 0011-container-with-most-water |
| 0014-longest-common-prefix |
| 0015-3sum |
| 0016-3sum-closest |
| 0018-4sum |
| 0017-letter-combinations-of-a-phone-number |
| 0022-generate-parentheses |
| 0020-valid-parentheses |
| 0032-longest-valid-parentheses |
| 0023-merge-k-sorted-lists |
| 0023-merge-k-sorted-lists |
| 0028-find-the-index-of-the-first-occurrence-in-a-string |
| 0029-divide-two-integers |
| 0036-valid-sudoku |