Algorithm for finding a word ladder • create a Stack containing just the first word in the ladder ⚫ enqueue this Stack on to a Queue of Stacks ⚫ while this Queue of Stacks is not empty 。 get the word on top of the front Stack of this Queue ⚫ for each word in the dictionary ■if the word is off by just one letter from the top word ■ create a new Stack that is a copy of the front Stack and push on this off-by-one word found ■if this off-by-one word is the end word of the ladder, this new Stack contains the entire word ladder. You are done! ■ otherwise, enqueue this new Stack and remove this word from the dictionary ⚫ dequeue this front stack • if the Queue is empty and you didn't find the word ladder, a word ladder does not exist for these 2 words