Shortest path to transform one word into another

Question

For a Data Structures project, I must find the shortest path between two words (like \"cat\" and \"dog\"), changing only one letter at a time. We a

Answer 1

You could find the longest common subsequence, and therefore finding the letters that must be changed.