DIY: Word Ladder II
Problem statement
In this scenario, you are given a list of words, a starting_word
, and an ending_word
. The problem requires you to find all shortest transformation sequences’ from starting_word
to ending_word
. There are a few conditions for this problem:
-
All the words should be the same length.
-
There should be no duplicates in the given ...
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy