Word Ladder
Turn one word into another by changing a single letter at a time, using only words from a list. Why breadth-first search gives the shortest ladder, and why each word must be marked visited the moment it is queued.
Spotted a mistake in this lesson?Report an issue →