# Floyd-Warshall All Pairs Distances: Study Guide

Floyd-Warshall All Pairs Distances shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For each intermediate k, try dist[i][k] + dist[k][j]; k must be the outermost loop.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(V^3) time, O(V^2) space.

## Common mistake

Putting k in the inner loop, which gives wrong answers silently.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI job interview answers in real time.