First round: there is a dictionary of m words and some string start is given. Transform start string by changing one character at a time such that the intermediate word formed is available inside the dictionary. Now after performing some least number of transformations task is to change start inti some end string. Print all such possible transformations ie. write each step of transformation in a single complete way of transforming.
Sigiloso
I used hashing for making a string map and used recursion to solve the problem.