Skip to content

Learning

Skills I am practising alongside my projects, and how far along I am.

DSA: NeetCode 150

150 coding problems covering the common patterns in technical interviews. This section reads from the spreadsheet I track them in, so it is always up to date. Each solved problem has a one-line note on its key idea, in my own words.

– of 150 solved

Easy
– / 28
Medium
– / 101
Hard
– / 21
Revisited
–

Started

All problems

In study order
Arrays & Hashing9
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
  8. Not started:
  9. Not started:
Two Pointers5
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
Sliding Window6
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
Stack7
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
Binary Search7
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
Linked List11
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
  8. Not started:
  9. Not started:
  10. Not started:
  11. Not started:
Trees15
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
  8. Not started:
  9. Not started:
  10. Not started:
  11. Not started:
  12. Not started:
  13. Not started:
  14. Not started:
  15. Not started:
Tries3
  1. Not started:
  2. Not started:
  3. Not started:
Heap / Priority Queue7
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
Backtracking9
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
  8. Not started:
  9. Not started:
Graphs13
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
  8. Not started:
  9. Not started:
  10. Not started:
  11. Not started:
  12. Not started:
  13. Not started:
Advanced Graphs6
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
1-D Dynamic Programming12
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
  8. Not started:
  9. Not started:
  10. Not started:
  11. Not started:
  12. Not started:
2-D Dynamic Programming11
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
  8. Not started:
  9. Not started:
  10. Not started:
  11. Not started:
Greedy8
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
  8. Not started:
Intervals6
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
Math & Geometry8
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started:
  8. Not started:
Bit Manipulation7
  1. Not started:
  2. Not started:
  3. Not started:
  4. Not started:
  5. Not started:
  6. Not started:
  7. Not started: