Opening page…
Modelling problems as nodes and edges: BFS/DFS, topological sort, union-find, shortest paths, and spanning trees.
Solved
| Solved | # | Problem | Pattern | Level | Preview |
|---|---|---|---|---|---|
| 1 | Flood Fill | DFS · Grid | Easy | ||
| 2 | Find if Path Exists in Graph | BFS · Union-Find | Easy | ||
| 3 | Find the Town Judge | Degree Counting | Easy | ||
| 4 | Number of Islands | DFS · BFS · Grid | Medium | ||
| 5 | Rotting Oranges | Multi-source BFS · Grid | Medium | ||
| 6 | Course Schedule | Topological Sort · Cycle Detection | Medium | ||
| 7 | Course Schedule II | Topological Sort | Medium | ||
| 8 | Number of Provinces | Union-Find · DFS | Medium | ||
| 9 | Redundant Connection | Union-Find | Medium | ||
| 10 | Network Delay Time | Dijkstra · Shortest Path | Medium |
Showing 1–10 of 14 problems