Data Structures and Algorithms implemented in Python following the NeetCode roadmap.
This repository documents my Python learning journey while preparing for senior software engineering interviews. Solutions are written to production quality standard with clean code, type hints and pytest coverage.
| # | Topic | Status |
|---|---|---|
| 01 | Arrays & Hashing | 🟡 In Progress |
| 02 | Two Pointers | ⬜ Pending |
| 03 | Stack | ⬜ Pending |
| 04 | Binary Search | ⬜ Pending |
| 05 | Sliding Window | ⬜ Pending |
| 06 | Linked List | ⬜ Pending |
| 07 | Trees | ⬜ Pending |
| 08 | Heap / Priority Queue | ⬜ Pending |
| 09 | Tries | ⬜ Pending |
| 10 | Intervals | ⬜ Pending |
| 11 | Greedy | ⬜ Pending |
| 12 | Backtracking | ⬜ Pending |
| 13 | Graphs | ⬜ Pending |
| 14 | Advanced Graphs | ⬜ Pending |
| 15 | 1-D Dynamic Programming | ⬜ Pending |
| 16 | 2-D Dynamic Programming | ⬜ Pending |
| 17 | Bit Manipulation | ⬜ Pending |
| 18 | Math & Geometry | ⬜ Pending |
Each solution file includes:
- Problem statement in comments
- Pattern identification
- Brute force approach with complexity
- Optimised solution with complexity
- pytest unit tests
14 years of backend engineering experience in C# and .NET. Expanding into Python for distributed systems and algorithm work.