Back to Question
Word Ladder (BFS)
Question Explain
Given two words, `beginWord` and `endWord`, and a dictionary, find the length of the shortest transformation sequence from `beginWord` to `endWord` (one letter change per step). Model the dictionary as a graph and use BFS.
Start Trying This Question Simulation
Click "Start Speaking" and answer the question naturally.