This problem is simply the edit distance problem with edit costs of insertion as well as deletion 1, and with a slight modification that the 1st string can't be modified. There is a O(n^2) DP solution for this problem.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.