Season 1 — Striver A2Z tracker
Track at the step level here; track individual problems on the takeUforward sheet (it has built-in per-problem checkboxes) and log each day in
../../daily-log.md.
Progress
Solved: 0 / 474 · current step: 1 — Learn the basics · current week: 1
[ ] 0%
(Update the bar as you go: each # ≈ 16 problems. Or just trust the daily log — the streak is the real metric.)
Steps
| ✓ | Step | Topic | Problems | Difficulty | Week(s) | Solved |
|---|---|---|---|---|---|---|
| ☐ | 1 | Learn the basics | 54 | easy | 1–2 | 0/54 |
| ☐ | 2 | Sorting | 7 | easy | 2 | 0/7 |
| ☐ | 3 | Arrays | 40 | mixed | 2–3 | 0/40 |
| ☐ | 4 | Binary Search | 32 | mixed | 4 | 0/32 |
| ☐ | 5 | Strings (basic) | 15 | easy | 4 | 0/15 |
| ☐ | 6 | Linked List | 31 | mixed | 5 | 0/31 |
| ☐ | 7 | Recursion | 25 | mixed | 6 | 0/25 |
| ☐ | 8 | Bit Manipulation | 18 | medium | 6–7 | 0/18 |
| ☐ | 9 | Stack & Queue | 30 | mixed | 7–8 | 0/30 |
| ☐ | 10 | Sliding Window + 2-Pointer | 12 | medium | 8 | 0/12 |
| ☐ | 11 | Heaps | 17 | medium | 9 | 0/17 |
| ☐ | 12 | Greedy | 15 | mixed | 9 | 0/15 |
| ☐ | 13 | Binary Trees | 38 | mixed | 10–11 | 0/38 |
| ☐ | 14 | Binary Search Trees | 16 | medium | 11 | 0/16 |
| ☐ | 15 | Graphs | 53 | hard | 12–14 | 0/53 |
| ☐ | 16 | Dynamic Programming | 55 | hard | 14–16 | 0/55 |
| ☐ | 17 | Tries | 7 | medium | 17 | 0/7 |
| ☐ | 18 | Strings (hard) | 9 | hard | 17 | 0/9 |
Total: 474 (committed schedule covers 450; the rest is slack — see plan.md).
How to mark progress
- Tick
☐ → ☑when a step is fully done. - Update the
Solvedcolumn as you clear problems in a step. - The honest metric is the daily log streak, not this table. This table is for seeing the mountain shrink.