🚀 My Python implementations of Striver's A2Z DSA Sheet — with in-code explanations, topic-wise structure, and a step-by-step progress tracker.
Welcome to my journey through the Striver's A2Z DSA Sheet, implemented entirely in Python. This repository contains well-documented solutions with explanations, written as part of my structured learning path for mastering Data Structures and Algorithms.
This is a curated collection of my solutions to the Striver A2Z DSA Sheet, a step-by-step roadmap to mastering DSA concepts.
Each problem is solved in Python, with:
- 💡 In-code docstring notes explaining the logic, edge cases, and reasoning.
- 📁 Organized folder-wise according to topic/step.
- ✅ Regular updates as I progress through the sheet.
- Solve each problem on LeetCode.
- Write Python solutions from scratch.
- Include docstrings that:
- Explain the approach
- Mention time/space complexity
- Discuss edge cases (when needed)
- Push after completing each step/topic.
| Step | Topic | Status |
|---|---|---|
| 1 | Learn Basics | ✅ Done |
| 2 | Sorting | ✅ Done |
| 3 | Recursion | ✅ Done |
| 4 | Arrays | ✅ Done |
| 5 | Hashing | ✅ Done |
| 6 | Linked Lists | ✅ Done |
| 7 | Recursion | ✅ Done |
| 8 | Bit Manipulation | ✅ Done |
| 9 | Stack & Queues | ✅ Done |
| 10 | Sliding Window & Two Pointer | ✅ Done |
| 11 | Heaps | ✅ Done |
| 12 | Greedy Algo | ✅ Done |
| 13 | Binary Trees | 🔄 In Progress |
| ... | More Coming Soon | ⏳ Stay tuned |
Each folder contains:
- Python files for each problem
- Inline notes in the form of docstrings
- Occasionally short folder-level summaries
I'll also be sharing regular updates on LinkedIn to track my progress and connect with other learners. Feel free to follow or reach out!
🔗 GitHub: NDDimension
🔗 LinkedIn: DHANRAJ SHARMA
Consider giving it a ⭐️ and feel free to fork it or use it for your own learning!