This repository contains my structured solutions to LeetCode problems. I use this space to strengthen my understanding of Data Structures and Algorithms, improve problem-solving skills, and write optimized, clean implementations.
My focus is on correctness, efficiency, and maintaining clear logic rather than just reaching the final answer.
| 0004-median-of-two-sorted-arrays |
| 0023-merge-k-sorted-lists |
| 0053-maximum-subarray |
| 0169-majority-element |
| 0493-reverse-pairs |
| 0048-rotate-image |
| 0054-spiral-matrix |
| 0073-set-matrix-zeroes |
| 0200-number-of-islands |
| 1351-count-negative-numbers-in-a-sorted-matrix |
| 1582-special-positions-in-a-binary-matrix |
| 0169-majority-element |
| 0229-majority-element-ii |
| 1365-how-many-numbers-are-smaller-than-the-current-number |
| 3467-transform-array-by-parity |
| 0680-valid-palindrome-ii |
| 1689-partitioning-into-minimum-number-of-deci-binary-numbers |
| 2160-minimum-sum-of-four-digit-number-after-splitting-digits |
| 1925-count-square-sum-triples |
| 0023-merge-k-sorted-lists |
| 3264-final-array-state-after-k-multiplication-operations-i |
| 2396-strictly-palindromic-number |
| 0560-subarray-sum-equals-k |
| 1769-minimum-number-of-operations-to-move-all-balls-to-each-box |
| 3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i |
| 0002-add-two-numbers |
| 0021-merge-two-sorted-lists |
| 0224-basic-calculator |
| 0234-palindrome-linked-list |
| 0326-power-of-three |
| 1545-find-kth-bit-in-nth-binary-string |
| 0258-add-digits |
| 2932-maximum-strong-pair-xor-i |
| 0032-longest-valid-parentheses |
| 0042-trapping-rain-water |
| 0053-maximum-subarray |
| 0118-pascals-triangle |
| 0152-maximum-product-subarray |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0023-merge-k-sorted-lists |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0002-add-two-numbers |
| 0021-merge-two-sorted-lists |
| 0023-merge-k-sorted-lists |
| 0114-flatten-binary-tree-to-linked-list |
| 0234-palindrome-linked-list |
| 0103-binary-tree-zigzag-level-order-traversal |
| 0114-flatten-binary-tree-to-linked-list |
| 0129-sum-root-to-leaf-numbers |
| 0199-binary-tree-right-side-view |
| 0543-diameter-of-binary-tree |
| 0114-flatten-binary-tree-to-linked-list |
| 0129-sum-root-to-leaf-numbers |
| 0199-binary-tree-right-side-view |
| 0200-number-of-islands |
| 0543-diameter-of-binary-tree |
| 0103-binary-tree-zigzag-level-order-traversal |
| 0114-flatten-binary-tree-to-linked-list |
| 0129-sum-root-to-leaf-numbers |
| 0199-binary-tree-right-side-view |
| 0543-diameter-of-binary-tree |
| 0103-binary-tree-zigzag-level-order-traversal |
| 0199-binary-tree-right-side-view |
| 0200-number-of-islands |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 0200-number-of-islands |
| 0042-trapping-rain-water |
| 0039-combination-sum |
| 0046-permutations |