# Word Ladder: Walkthrough

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

## Key idea

BFS from beginWord where each step changes one letter to another word in the wordList; the first time you reach endWord is the shortest ladder length.

## 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).

## Common mistake

DFS, which may find a ladder but not a shortest one, or allowing a change to a word not in the list.

## 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 real-time AI interview assistant for live interviews.