DIY: Word Ladder I
Problem statement
You are given a list of words, a starting_word
, and an ending_word
. This problem requires you to find the minimum number of transitions required to convert the starting_word
into the ending_word
under the following constraints:
-
All the words should be of the same length.
-
There should be no duplicates in ...
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy