Write a code which will find whether two strings are at a distance of 1. Distance of 1 meaning that they differ by the insertion/deletion or replacement of 1 char. For e.g. s1 -> abcd s2->acd
s1-> abcd s2-> ascd s1->abcd s2->abcde -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
