Welcome to my personal log for cracking the NeetCode 150 challenge — one problem at a time, one optimized solution at a time.
This repo is my way of mastering Data Structures & Algorithms for FAANG-level interviews and beyond.
- Solve all 150 curated problems from NeetCode.
- Cover all essential DSA patterns: sliding window, two pointers, trees, graphs, dynamic programming, and more.
- Maintain clean, readable, and optimized code.
- Document approach, edge cases, and time/space complexity for each problem.
- Language:
C++ / Python / Java(Update this to your preferred one) - IDE:
VS Code - Tools:
LeetCode,NeetCode,Git,GitHub
Because DSA isn't just about brute-forcing problems — it's about building intuition, writing clean code, and thinking like a problem solver. This log keeps me accountable and lets others learn along the way.
- Each file contains:
- Problem link
- My approach
- Code with comments
- Time and space complexity
- NeetCode
- LeetCode Patterns by Sean Prashad
- Fellow coders in the grind 💪
If you're grinding DSA too, feel free to fork, star, or share ideas!
Reach me on Twitter / LinkedIn
🧠 “Consistency beats talent when talent doesn’t show up.” — Keep grinding!
| 0001-two-sum |
| 0066-plus-one |
| 0001-two-sum |
| 0141-linked-list-cycle |
| 0020-valid-parentheses |
| 0020-valid-parentheses |
| 0021-merge-two-sorted-lists |
| 0141-linked-list-cycle |
| 0021-merge-two-sorted-lists |
| 0141-linked-list-cycle |
| 0066-plus-one |
| 0070-climbing-stairs |
| 0100-same-tree |
| 0100-same-tree |
| 0100-same-tree |
| 0100-same-tree |
| 0070-climbing-stairs |
| 0070-climbing-stairs |