127. Word Ladder - LeetCode Solution


BFS

Python Code:

class Solution:
    def ladderLength(self, beginWord: str, endWord: str, wordList: List[str]) -> int:
        level = 1
        frontier = [beginWord]
        wle = set(wordList)
        al = "abcdefghijklmnopqrstuvwxyz"
        while frontier:
            next = []
            for cur in frontier:
                if cur==endWord:
                    return level
                for i in range(len(cur)):
                    for ch in al:
                        next_word = cur[:i]+ch+cur[i+1:]
                        if next_word in wle:
                            wle.remove(next_word)
                            next.append(next_word)
            frontier = next
            level+=1
        return 0
            


Comments

Submit
0 Comments
More Questions

698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation
1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate
1352E - Special Elements
1520E - Arranging The Sheep
1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling