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 |
| 0347-top-k-frequent-elements |
| 0493-reverse-pairs |
| 0169-majority-element |
| 0229-majority-element-ii |
| 0347-top-k-frequent-elements |
| 1365-how-many-numbers-are-smaller-than-the-current-number |
| 3467-transform-array-by-parity |
| 1925-count-square-sum-triples |
| 2094-finding-3-digit-even-numbers |
| 2367-number-of-arithmetic-triplets |
| 3483-unique-3-digit-even-numbers |
| 3827-count-monobit-integers |
| 3833-count-dominant-indices |
| 2396-strictly-palindromic-number |
| 0258-add-digits |
| 2344-minimum-deletions-to-make-array-divisible |
| 0014-longest-common-prefix |
| 2932-maximum-strong-pair-xor-i |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 3525-find-x-value-of-array-ii |
| 0023-merge-k-sorted-lists |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 0239-sliding-window-maximum |
| 3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i |
| 0155-min-stack |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 0130-surrounded-regions |
| 0200-number-of-islands |
| 0547-number-of-provinces |
| 0785-is-graph-bipartite |
| 1020-number-of-enclaves |
| 3600-maximize-spanning-tree-stability-with-upgrades |
| 0042-trapping-rain-water |
| 0739-daily-temperatures |
| 0853-car-fleet |
| 0022-generate-parentheses |
| 0039-combination-sum |
| 0046-permutations |
| 0126-word-ladder-ii |
| 0301-remove-invalid-parentheses |
| 1096-brace-expansion-ii |
| 1980-find-unique-binary-string |
| 1095-find-in-mountain-array |
| 0207-course-schedule |
| 0547-number-of-provinces |
| 0785-is-graph-bipartite |
| 3600-maximize-spanning-tree-stability-with-upgrades |
| 3600-maximize-spanning-tree-stability-with-upgrades |
| 0700-search-in-a-binary-search-tree |
| 0347-top-k-frequent-elements |
| 0347-top-k-frequent-elements |
| 0239-sliding-window-maximum |
| 0207-course-schedule |
| 0070-climbing-stairs |
| 0062-unique-paths |
| 1621-number-of-sets-of-k-non-overlapping-line-segments |
| 0785-is-graph-bipartite |
| 0785-is-graph-bipartite |
| 0207-course-schedule |
| 0416-partition-equal-subset-sum |
| 0416-partition-equal-subset-sum |
| 0796-rotate-string |
| 0124-binary-tree-maximum-path-sum |
| 0836-rectangle-overlap |
| 1401-circle-and-rectangle-overlapping |
| 1071-greatest-common-divisor-of-strings |
| 1071-greatest-common-divisor-of-strings |
| 0334-increasing-triplet-subsequence |
| 0169-majority-element |