* Word Ladder

Given two words (start and end), and a dictionary, find the length of
shortest transformation sequence from start to end, such that:

Only one letter can be changed at a time
Each intermediate word must exist in the dictionary