Tackle graph problems — DFS, BFS, Dijkstra, topological sort, union-find, and island counting. Essential for senior engineering interviews.
| # | Status | Topic | Est. Time | ||
|---|---|---|---|---|---|
| 1 | ○ | 🕸️Graph | Hard | ~40 min | |
| 2 | ○ | 🕸️Graph | Hard | ~40 min | |
| 3 | ○ | 🕸️Graph | Hard | ~40 min | |
| 4 | ○ | 🕸️Graph | Easy | ~15 min | |
| 5 | ○ | 🕸️Graph | Medium | ~25 min | |
| 6 | ○ | 🕸️Graph | Easy | ~15 min | |
| 7 | ○ | 🕸️Graph | Medium | ~25 min | |
| 8 | ○ | 🕸️Graph | Easy | ~15 min |