Set 12
Graphs — BFS/DFS Introduction
Seven problems, ramping from Very Easy to Extreme.
Progress · 0/7 solved
- VERY EASYQ1Count Connected Components
- EASYQ2Shortest Path in an Unweighted Graph
- MEDIUMQ3Detect a Cycle in an Undirected Graph
- MEDIUM-HARDQ4Bipartite Check
- HARDQ5Reachability on a Jump Graph (SHA75-style)
- VERY HARDQ6Number of Islands (Connected Components in a Grid)
- EXTREMEQ7Strongly Connected Components (Kosaraju's or Tarjan's)