Word Ladder LeetCode Solution

Difficulty Level Hard
Frequently asked in Adobe Amazon Apple Bloomberg ByteDance Citadel Expedia Facebook Goldman Sachs Google LinkedIn lyft Microsoft Oracle Qualtrics Salesforce Snapchat Zillow
Breadth First Search Hashing StringsViews 36

Problem Statement

The Word Ladder LeetCode Solution – “Word Ladder” states that you are given a string beginWord, string endWord, and a wordList.

We need to find the shortest transformation sequence length (if no path exists, print 0) from beginWord to endWord following the given conditions:


Word Ladder LeetCode SolutionPin

Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log","cog"]
Output: 5


  • Starts with the beginWord = “hit” (level=1).
  • Words adjacent to “hit” and are not yet visited are “hot” since it differs only in 1 character. The level of “hot” is 2.
  • Words adjacent to “hot” and are not yet visited are “dot” and “lot”. The level is 3.
  • Words adjacent to “dot” and “lot” are “dog” and “log” respectively with level = 4.
  • Words adjacent to dog and log is a cog, which is endWord, present at level = 5 which is our answer.
Input: beginWord = "hat", endWord = "lob", wordList = ["hot","dot","dog","lot","log"]
Output: 0


  • Since endWord “lob” doesn’t exist in the wordList, hence the output is 0[all intermediate words must exist in wordList].



  1. Since we need to find the shortest path length from source to target, the key idea is to use Breadth-First Search (BFS) for a Graph.
  2. First, store all words from wordList to a set, to remove duplicate words.
  3. Perform BFS from beginWord and each time, pop out the front element string from the queue and visit all adjacent strings of current string(strings differing by one character and are present in wordList) push them into the queue, and, mark them as visited by removing its entry from words set.
  4. For finding adjacent strings, replace every character at every index of a current string with a new character and check its entry in the words set(intermediate words).
  5. Whenever we’ll find endWord, return the level of the endWord since BFS always yields the shortest path.


Word Ladder Leetcode Solution C++:

class Solution {
    int ladderLength(string beginWord, string endWord, vector<string>& wordList) {
        queue<pair<string,int>> q;
        unordered_set<string> words(wordList.begin(),wordList.end());
            string curr = q.front().first;
            int level = q.front().second;
                return level;
            for(int i=0;i<(int)curr.length();i++){
                string str = curr;
                for(char ch='a';ch<='z';ch++){
                    str[i] = ch;
        return 0;

Word Ladder Leetcode Solution Java:

class Solution {
    public int ladderLength(String beginWord, String endWord, List<String> wordList) {
        Queue<String> q = new LinkedList<>();
        int level = 1;
        Set<String> words = new HashSet<String>();
        for(String word:wordList){
            int sz = q.size();
            for(int k=0;k<sz;k++){
                String curr = q.poll();
                    return level;
                for(int i=0;i<curr.length();i++){
                    for(char ch='a';ch<='z';ch++){
                        String str = curr.substring(0,i) + ch + curr.substring(i+1);
        return 0;


Complexity Analysis for Word Ladder Leetcode Solution

Time Complexity

The time complexity of the above code is O(n*m^2) since the queue operates each word in the worst case(there are n-words), and for each word has max length as m, so a total number of iterations is n*m. Also, for each character of the string, we are making a copy of the current string which takes O(m) time again. Hence, the overall complexity of the solution is O(n*m^2) [Considering a good hash performs the search/deletion operation in O(1)].

Space Complexity

The space complexity of the above code is O(n*m^2) since we have total n-words and for each is of max length as m. Also, for each word, we’re forming the intermediate word which takes O(m) space.

Leave a Comment

Translate »