Word Ladder
Try to solve the Word Ladder problem.
We'll cover the following...
Statement
Given two words, src
and dest
, and a list, words
, return the number of words in the shortest transformation sequence from src
to dest
. If no such sequence can be formed, return .
A ...
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy