SeniorSenior (6–10 yrs)CodingPythonAmazonMetaLinkedIn
Word Ladder Length
Given beginWord, endWord, and a word list, return the length of the shortest transformation sequence from begin to end changing one letter at a time, each intermediate in the word list. Return 0 if impossible.
Answers use simple, clear English.
Time: O(n * L * 26)Space: O(n * L)
Confidence
#bfs#string