Progressing through NeetCode 150 to practice problem solving and DSA.
Each topic has a journal (README.md) for tracking adversities and concepts learned.
In addition to this, the root Implementations folder contains algorithms/data structures that were studied and built before approaching problems.
021 / 150
| Topic | Completed | Total | ✅ |
|---|---|---|---|
| Arrays & Hashing | 9 | 9 | ✅ |
| Two Pointers | 5 | 5 | ✅ |
| Sliding Window | 5 | 6 | 🔄 |
| Stack | 2 | 7 | 🔄 |
| Binary Search | 0 | 7 | 🔄 |
| Linked List | 0 | 11 | 🔄 |
| Trees | 0 | 15 | 🔄 |
| Heap / Priority Queue | 0 | 7 | 🔄 |
| Backtracking | 0 | 9 | 🔄 |
| Tries | 0 | 3 | 🔄 |
| Graphs | 0 | 13 | 🔄 |
| Advanced Graphs | 0 | 6 | 🔄 |
| 1-D Dynamic Programming | 0 | 12 | 🔄 |
| 2-D Dynamic Programming | 0 | 11 | 🔄 |
| Greedy | 0 | 8 | 🔄 |
| Intervals | 0 | 6 | 🔄 |
| Maths & Geometry | 0 | 8 | 🔄 |
| Bit Manipulation | 0 | 7 | 🔄 |
Solution structure:
- LeetCode problem link
- Time/space complexity
- Python solution