Back to QuestionsPractice with This Question
Word Ladder (BFS)
131.3K views•Asked at Meta•
Hard
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
Practice answering orally or with text to get instant AI feedback.