Decode the Coding Interview in JavaScript: Real-World Examples/

...

/

DIY: Word Ladder II

DIY: Word Ladder II

Solve the interview question "Word Ladder II" yourself in this lesson.

We'll cover the following...

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 ...