Word Ladder · Coding Interview Practice

Word LadderGiven two words and a dictionary, find the shortest path from the first word to the second, where each step changes only one letter. Return the length of the path.Constraints

1 <= beginWord.length <= 10

endWord.length == beginWord.length

1 <= wordList.length <= 5000

Each word has unique characters

Examples

Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log","cog"] Output: 5

Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log"] Output: 0

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…