🚀 Notebook-based LeetCode interview prep in Python with DSA notes, explanations, tests, mistakes, and problem-solving patterns.
If you are preparing for coding interviews and want more than just accepted code, this repository is for you.
This repo is my public learning journal for mastering data structures and algorithms. I use Jupyter notebooks to keep the full learning process in one place: concepts, solutions, experiments, edge cases, tests, mistakes, and interview-style explanations.
Most LeetCode repositories only store final solutions.
This one focuses on the full thinking process:
- 🧩 Why the brute-force approach works
- 🐢 Why it may be too slow
- ⚡ How constraints guide the algorithm choice
- 🔍 Which pattern unlocks the optimized solution
- 🧪 What edge cases are easy to miss
- 🐞 What mistakes I made while solving
- 🎤 How to explain the solution out loud in an interview
The goal is simple:
🎯 Build real interview intuition, not just memorize answers.
Each notebook may include:
- 🧠 Concept notes
- 🧩 Problem-solving patterns
- ✅ Clean accepted Python solutions
- 🐢 Brute-force approaches
- ⚡ Optimized approaches
- ⏱️ Time and space complexity
- 📏 Constraint analysis
- 🧪 Test cases
- 🐞 Common mistakes
- 🎤 Interview-style explanations
- 📝 Personal learning notes
This repository follows a structured data structures and algorithms progression.
| Topic | Status |
|---|---|
| 🧵 Arrays and Strings | 🚧 In progress |
| 🗂️ Hashing | 📌 Planned |
| 🔗 Linked Lists | 📌 Planned |
| 📚 Stacks and Queues | 📌 Planned |
| 🌳 Trees and Graphs | 📌 Planned |
| ⛰️ Heaps | 📌 Planned |
| 💰 Greedy | 📌 Planned |
| 🎯 Binary Search | 📌 Planned |
| 🧭 Backtracking | 📌 Planned |
| 🧠 Dynamic Programming | 📌 Planned |
| 📏 Big O | 🚧 In progress |
This repository is organized by data structures and algorithms topics.
Most explanations, code, examples, tests, mistakes, and notes are written directly inside Jupyter notebooks.
.
├── arrays-and-strings/
│ ├── ArraysAndString.ipynb
│ └── ArraysAndStringWithChecker.ipynb
├── hashing/
├── linked-lists/
├── stacks-and-queues/
├── trees-and-graphs/
├── heaps/
├── greedy/
├── binary-search/
├── backtracking/
├── dynamic-programming/
├── big-o/
└── README.md