Solution: Word Ladder

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 could be formed, return $0$.

A transformation sequence is a sequence of words $($src $\to$ $word_1$ $\to$ $word_2$ ...