Cody

Problem 45463. Word Ladder

Given a set of words, and two other words - start and destination,

Find the smallest chain from start to the destination such that adjacent words in the chain only differ by one character and each word in the chain exists in the set.

All the words are of the same length. The starting word is not in the set but destination word would be.

For example,

 Start = 'COLD'
 Destination = 'WARM'
 set ={ CORD CARD DART FORT WARM FARM WARD}
 COLD → CORD → CARD → WARD → WARM

Solution Stats

13.79% Correct | 86.21% Incorrect
Last Solution submitted on May 16, 2020

Problem Recent Solvers4

Suggested Problems

More from this Author145

Problem Tags