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 |
|---|---|---|---|
| 20 | 5 | 13 | 2 |
| Current Streak | Best Streak | Active Days |
|---|---|---|
| 12 days | 12 days | 14 |
| Date | Problems |
|---|---|
| 2026-10-10 | 4 |
| 2026-10-11 | 2 |
| 2026-10-13 | 2 |
| 2026-10-14 | 2 |
| 2026-10-15 | 1 |
| 2026-10-16 | 1 |
| 2026-10-17 | 1 |
| 2026-10-18 | 1 |
| 2026-10-19 | 1 |
| 2026-10-20 | 1 |
| 2026-10-21 | 1 |
| 2026-10-22 | 1 |
| 2026-10-23 | 1 |
| 2026-10-24 | 1 |
| Tag | Problems | Coverage |
|---|---|---|
| String | 10 | 50% |
| Array | 7 | 35% |
| Two Pointers | 6 | 30% |
| Hash Table | 5 | 25% |
| Math | 5 | 25% |
| Sorting | 3 | 15% |
| Dynamic Programming | 2 | 10% |
| Linked List | 2 | 10% |
| Recursion | 2 | 10% |
| Backtracking | 1 | 5% |
| Topic | Problems |
|---|---|
| Array | 7 |
| Backtracking | 1 |
| Binary Search | 1 |
| Bracket Sequences | 1 |
| Divide and Conquer | 1 |
| Dynamic Programming | 2 |
| Greedy | 1 |
| Hash Table | 5 |
| Linked List | 2 |
| Manacher | 1 |
| Math | 5 |
| Recursion | 2 |
| Sliding Window | 1 |
| Sorting | 3 |
| Stack | 1 |
| String | 10 |
| Trie | 1 |
| Two Pointers | 6 |