0127-word-ladder

Try it on leetcode

Description

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 a single letter.
  • Every si for 1 <= i <= k is in wordList. Note that beginWord does not need to be in wordList.
  • sk == endWord

Given two words, beginWord and endWord, and a dictionary wordList, return the number of words in the shortest transformation sequence from beginWord to endWord, or 0 if no such sequence exists.

 

Example 1:

Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log","cog"]
Output: 5
Explanation: One shortest transformation sequence is "hit" -> "hot" -> "dot" -> "dog" -> cog", which is 5 words long.

Example 2:

Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log"]
Output: 0
Explanation: The endWord "cog" is not in wordList, therefore there is no valid transformation sequence.

 

Constraints:

  • 1 <= beginWord.length <= 10
  • endWord.length == beginWord.length
  • 1 <= wordList.length <= 5000
  • wordList[i].length == beginWord.length
  • beginWord, endWord, and wordList[i] consist of lowercase English letters.
  • beginWord != endWord
  • All the words in wordList are unique.

Solution(Python)

from collections import deque
import string

class Solution:
    def ladderLength(self, beginWord: str, endWord: str, wordList: list[str]) -> int:
        word_set = set(wordList)
        if endWord not in word_set:
            return 0
        
        # Initialize queues and visited sets with word and its step distance
        forward_q = deque([(beginWord, 1)])
        backward_q = deque([(endWord, 1)])
        
        forward_visited = {beginWord: 1}
        backward_visited = {endWord: 1}
        
        alphabet = string.ascii_lowercase
        
        while forward_q and backward_q:
            # Always expand the smaller queue to minimize search space
            if len(forward_q) <= len(backward_q):
                q, current_visited, opposite_visited = forward_q, forward_visited, backward_visited
            else:
                q, current_visited, opposite_visited = backward_q, backward_visited, forward_visited
            
            # Process the ENTIRE current level of the selected queue
            for _ in range(len(q)):
                word, transform = q.popleft()
                
                for i in range(len(word)):
                    for c in alphabet:
                        if c == word[i]:
                            continue
                        
                        transformed = word[:i] + c + word[i+1:]
                        
                        # Connection found! The two search fronts met.
                        if transformed in opposite_visited:
                            return transform + opposite_visited[transformed]
                        
                        if transformed in word_set and transformed not in current_visited:
                            current_visited[transformed] = transform + 1
                            q.append((transformed, transform + 1))
                            
        return 0

Dry Run