DIY: Word Ladder I
Solve the interview question "Word Ladder I" in this lesson.
We'll cover the following...
Problem statement
You are given an array of words, a startingWord
, and an endingWord
. This problem requires you to find the minimum number of transitions required to convert the startingWord
into the endingWord
under the following constraints:
-
All the words should be of the same ...