Practice Problems

Build your Floyd-Warshall skills with these problems:

$1.$ Shortest Routes II (CSES): all-pairs queries, direct Floyd-Warshall application.

$2.$ Find the City (LeetCode $1334$): threshold-based counting, post-processing the distance matrix.

$3.$ Course Schedule IV (LeetCode $1462$): transitive closure variant using boolean Floyd-Warshall.

Each problem reinforces a different aspect. CSES tests basic usage, LeetCode $1334$ tests filtering results, and LeetCode $1462$ tests the reachability variant.