# Shortest Bridge: Walkthrough
Shortest Bridge shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Flood-fill one island to collect its cells, then multi-source BFS outward until the second island is hit; the distance is the paint needed.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(mn).
## Common mistake
BFS from a single cell of the first island, which is not the closest shore.
## 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 the Linkjob AI app.