Meta SWE Interview Question | On-campus | 2021-January | BFS

Question 1: Word Ladder II Problem Statement A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that: Every adjacent pair of words differs by exactly one single character. Every s_i is strictly in the wordList. sk == endWord Given two words, beginWord and endWord, and a dictionary wordList, return ALL the shortest transformation sequences from beginWord to endWord. Each sequence should ...