LeetCode 127 Word Ladder - Why Naive Fails

Try all possible paths using DFS, tracking the shortest path to endWord.

This explores many long paths before finding the shortest. With branching factor $b$ and depth $d$, DFS explores up to $b^d$ states.

BFS finds the shortest path without exploring deeper levels prematurely.