3 subtopics · 13 problems
Shortest Paths
Dijkstra, Bellman-Ford, Floyd-Warshall — weighted shortest path algorithms.
01Dijkstra's Algorithm
Shortest paths from a single source in non-negative weighted graphs.
2 medium3 hard
| Problem | Difficulty | Link |
|---|---|---|
| 20CDijkstra? | medium | Solve |
| 1904BCollecting Game | medium | Solve |
| 1862EKolya and Movie Theatre | hard | Solve |
| 1837EPlayoff Fixing | hard | Solve |
| 545EPaths and Trees | hard | Solve |
02Bellman-Ford & SPFA
Handles negative weights; detects negative cycles.
1 medium3 hard
| Problem | Difficulty | Link |
|---|---|---|
| 1843ETracking Segments | medium | Solve |
| 1881EBlock Sequence | hard | Solve |
| 1904DSet To Max | hard | Solve |
| 894ERalph and Mushrooms | hard | Solve |
03Floyd-Warshall Algorithm
All-pairs shortest paths in O(n³).
2 medium2 hard
| Problem | Difficulty | Link |
|---|---|---|
| 295BGreg and Graph | medium | Solve |
| 1881DDivide and Equalize | medium | Solve |
| 1900DSmall GCD | hard | Solve |
| 1886CIs It Flower? | hard | Solve |
Was this helpful?