| Difficulty | Solved |
|---|---|
| Easy | 12 |
| Medium | 10 |
| Hard | 03 |
| <<<<<<< HEAD | |
| Total | 17 |
| ======= | |
| Total | 25 |
5b611f0 (updating)
My journey of mastering Data Structures & Algorithms through consistent problem solving.
| Difficulty | Solved | Target | Progress |
|---|---|---|---|
| 🟢 Easy | 12 | 150 | ░░░░░░░░░░ 0% |
| 🟡 Medium | 10 | 200 | ░░░░░░░░░░ 0% |
| 🔴 Hard | 03 | 100 | ░░░░░░░░░░ 0% |
| Total | 25 | 450 | 0% |
Update the numbers regularly as you solve more problems.
| Topic | Status | Problems |
|---|---|---|
| Arrays | 🔄 Learning | 0 |
| Strings | 🔄 Learning | 0 |
| Hashing | ⏳ Pending | 0 |
| Two Pointers | ⏳ Pending | 0 |
| Sliding Window | ⏳ Pending | 0 |
| Stack | ⏳ Pending | 0 |
| Queue | ⏳ Pending | 0 |
| Linked List | ⏳ Pending | 0 |
| Binary Search | ⏳ Pending | 0 |
| Trees | ⏳ Pending | 0 |
| Binary Search Tree | ⏳ Pending | 0 |
| Heap / Priority Queue | ⏳ Pending | 0 |
| Backtracking | ⏳ Pending | 0 |
| Greedy | ⏳ Pending | 0 |
| Graphs | ⏳ Pending | 0 |
| Dynamic Programming | ⏳ Pending | 0 |
| Bit Manipulation | ⏳ Pending | 0 |
| Trie | ⏳ Pending | 0 |
- ✅ Completed
- 🔄 Currently Learning
- ⏳ Not Started
- ⭐ Need More Practice
| Month | Problems Solved | Main Topics |
|---|---|---|
| January | 0 | — |
| February | 0 | — |
| March | 0 | — |
| April | 0 | — |
| May | 0 | — |
| June | 0 | — |
| July | 0 | — |
| August | 0 | Arrays, Strings |
| September | 0 | — |
| October | 0 | — |
| November | 0 | — |
| December | 0 | — |
- Solve first 10 problems
- Solve 25 problems
- Solve 50 problems
- Solve 100 problems
- Solve 150 problems
- Solve 200 problems
- Solve 300 problems
- Solve 400 problems
- Solve 500 problems
- Solve 100+ Medium problems
- Solve 50+ Hard problems
- Maintain a 30-day streak
- Maintain a 60-day streak
- Maintain a 100-day streak
| Language | Usage |
|---|---|
| 🐍 Python | 🔄 Learning |
| ⚡ C++ | 🔄 Learning |
| ☕ Java | ⏳ Pending |
- Master Arrays & Strings
- Master Hashing
- Master Two Pointers
- Master Sliding Window
- Master Linked Lists
- Master Binary Search
- Solve 100+ problems
- Complete all major DSA topics
- Solve 300+ LeetCode problems
- Solve 100+ Medium problems
- Solve 50+ Hard problems
- Become consistent with daily problem solving
- Prepare for top product-based companies
- Crack technical interviews
For every problem, I follow this process:
Understand the Problem
↓
Identify the Pattern
↓
Think of Brute Force
↓
Optimize the Approach
↓
Write Code
↓
Test Edge Cases
↓
Analyze Time & Space Complexity
↓
Review & Learn
| Week | Problems | Easy | Medium | Hard | Revision |
|---|---|---|---|---|---|
| Week 1 | 0 | 0 | 0 | 0 | ⬜ |
| Week 2 | 0 | 0 | 0 | 0 | ⬜ |
| Week 3 | 0 | 0 | 0 | 0 | ⬜ |
| Week 4 | 0 | 0 | 0 | 0 | ⬜ |
My target is to solve problems consistently rather than simply chasing numbers.
🎯 Daily Target: 2–3 Problems
📚 Daily Learning: 1 DSA Concept
🔄 Daily Revision: Previous Problems
💻 Daily Coding: 1+ Hour
I maintain notes about:
- 💡 New algorithms
- 🧠 DSA patterns
- ⚡ Optimization techniques
- 🐛 Common mistakes
- ⏱️ Time complexity
- 💾 Space complexity
- 🎯 Interview tricks
Consistency > Speed
Understand the pattern, don't memorize the solution.
Every wrong answer is another step toward a better solution.
DSA JOURNEY
Beginner
│
▼
Learn Concepts
│
▼
Solve Easy Problems
│
▼
Master DSA Patterns
│
▼
Solve Medium Problems
│
▼
Solve Hard Problems
│
▼
Interview Preparation
│
▼
🚀 DREAM COMPANY
One problem at a time. One concept at a time. One step closer to the goal.