127. Word Ladder

Description

Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that:

1. Only one letter can be changed at a time.

2. Each transformed word must exist in the word list.

Note:

• Return 0 if there is no such transformation sequence.

• All words have the same length.

• All words contain only lowercase alphabetic characters.

• You may assume no duplicates in the word list.

• You may assume beginWord and endWord are non-empty and are not the same.

Constraints

Approach

Links

• GeeksforGeeks

• Leetcode

• ProgramCreek

• YouTube

Examples

Example 1

Input:

beginWord = "hit"

endWord = "cog"

wordList = ["hot","dot","dog","lot","log","cog"]

Output: 5

Explanation: As one shortest transformation is "hit" -> "hot" -> "dot" -> "dog" -> "cog", return its length 5.

Example 2

Solutions

Solution 1

/**
 * Time complexity : 
 * Space complexity : 
 */

class Solution {
    public int ladderLength(String beginWord, 
                            String endWord, 
                            List<String> wordList) {
        Queue<String> queue = new LinkedList();
        Map<String, Integer> wordMap = new HashMap();
        
        Set<String> wordSet = new HashSet(wordList);
        
        queue.add(beginWord);
        wordMap.put(beginWord, 1);

        while(!queue.isEmpty()) {
            String word = queue.remove();
            
            if(endWord.equals(word)) {
                return wordMap.get(word);
            }
            
            char[] wordArr = word.toCharArray();
            for(int i = 0; i < word.length(); i++) {
                for(char ch = 'a'; ch <= 'z'; ch++) {
                    if(ch != wordArr[i]) {
                        char temp = wordArr[i];
                        wordArr[i] = ch;
                        String newWord = new String(wordArr);
                        if(wordSet.contains(newWord)) {
                            queue.add(newWord);
                            wordMap.put(newWord, wordMap.get(word)+1);
                            wordSet.remove(newWord);
                        }
                        wordArr[i] = temp;
                    }
                }
            }
        }
        return 0;
    }
}

Follow up