# Word Ladder II: Walkthrough

Word Ladder II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

BFS to record every parent that reaches a word at the minimum depth, then DFS back from beginWord to collect all shortest paths.

## 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(N L^2 + paths).

## Common mistake

DFS-only search, which finds some ladders but not all of the shortest ones.

## 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 Linkjob AI.