Word ladder
Given a start word, an end word and a word list, find the length of the shortest sequence from start to end in which each step changes exactly one letter and every word after the start is in the list. Return 0 if there is none. Explain how you find neighbours quickly.
No answer yet. Write the first one; the best answer gets endorsed.
