Leetcode 127. Word Ladder

Find the length of the shortest transformation sequence from beginWord to endWord where each step changes exactly one letter and every intermediate word must be in wordList — treat words as nodes in an implicit graph with edges between one-letter-different words. Return the number of words in that shortest path (or 0 if endWord isn't reachable).