Cinnamon's Code Challenge.
Question: Fastest word transform.
Given a list of words. Find the fastest way to tranfom start_word to end_word. Only one character is changed for each turn
Example:
['cat', 'dog', 'nop', 'fat', 'dop', 'dot', 'dat', 'son']
start_start = 'cat'
end_word = 'dog'
Answer: 'cat' -> 'dat' -> 'dot' -> 'dog'