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
\"cat\"
\"dog\"
This is a typical dynamic programming problem. Check for the Edit Distance problem.