DIY: Word Ladder I

Problem statement

You are given a array 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_wordunder the following constraints:

• All the words should be of the same ...