- Word Ladder II 

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

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