One problem at a time. One step closer to becoming better.
This repository is my growing archive of LeetCode solutions and a record of my problem-solving journey.
- 🧩 Practising data structures and algorithms through coding challenges.
- 🧠 Learning patterns such as arrays, hashing, two pointers, sliding windows, and dynamic programming.
- ⚡ Improving code clarity, efficiency, and complexity analysis.
- 📚 Keeping solutions organised so I can revisit concepts and learn from mistakes.
The goal isn't just to solve more problems — it's to understand them better.
| 01 · UNDERSTAND | 02 · IDENTIFY | 03 · SOLVE | 04 · TEST | 05 · OPTIMIZE |
|---|---|---|---|---|
| 🔍 Read the problem and constraints | 🧠 Find a useful pattern | 💻 Write a clear solution | 🧪 Check edge cases | 🚀 Analyse complexity |
I aim to keep solutions readable and, where useful, document the approach and time/space complexity.
# Problem: Two Sum
# Approach: Hash map
# Time: O(n) | Space: O(n)
def twoSum(nums, target):
seen = {}
for index, number in enumerate(nums):
complement = target - number
if complement in seen:
return [seen[complement], index]
seen[number] = index
return []
⭐ Learn every day. Improve with every problem.
| Total Solved | Easy | Medium | Hard |
|---|---|---|---|
| 36 | 10 | 20 | 6 |
| Current Streak | Best Streak | Active Days |
|---|---|---|
| 28 days | 28 days | 30 |
| Date | Problems |
|---|---|
| 2026-10-27 | 1 |
| 2026-10-28 | 1 |
| 2026-10-29 | 1 |
| 2026-10-30 | 1 |
| 2026-10-31 | 1 |
| 2026-11-01 | 1 |
| 2026-11-02 | 1 |
| 2026-11-03 | 1 |
| 2026-11-04 | 1 |
| 2026-11-05 | 1 |
| 2026-11-06 | 1 |
| 2026-11-07 | 1 |
| 2026-11-08 | 1 |
| 2026-11-09 | 1 |
| Tag | Problems | Coverage |
|---|---|---|
| Array | 14 | 39% |
| String | 14 | 39% |
| Two Pointers | 10 | 28% |
| Hash Table | 7 | 19% |
| Linked List | 6 | 17% |
| Math | 6 | 17% |
| Recursion | 5 | 14% |
| Binary Search | 4 | 11% |
| Dynamic Programming | 4 | 11% |
| Bracket Sequences | 3 | 8% |
| Topic | Problems |
|---|---|
| Array | 14 |
| Backtracking | 2 |
| Binary Search | 4 |
| Bit Manipulation | 1 |
| Boyer–Moore String-Search Algorithm | 1 |
| Bracket Sequences | 3 |
| Divide and Conquer | 2 |
| Dynamic Programming | 4 |
| Greedy | 1 |
| Hash Table | 7 |
| Heap (Priority Queue) | 1 |
| Knuth–Morris–Pratt Algorithm | 1 |
| Linked List | 6 |
| Manacher | 1 |
| Math | 6 |
| Matrix | 1 |
| Merge Sort | 1 |
| Recursion | 5 |
| Sliding Window | 2 |
| Sorting | 3 |
| Stack | 2 |
| String | 14 |
| String Matching | 1 |
| Tournament Sort | 1 |
| Trie | 1 |
| Two Pointers | 10 |
| Z Algorithm | 1 |