this the same hamming distance problem.......this can be done thorugh trie.....pls check archives this has been discussed before......
On Wed, Jul 7, 2010 at 10:12 AM, Ashish Goel <[email protected]> wrote: > use levenstein distance algo > > > http://en.wikipedia.org/wiki/Levenshtein_distance > > Best Regards > Ashish Goel > "Think positive and find fuel in failure" > +919985813081 > +919966006652 > > > On Tue, Jul 6, 2010 at 9:30 PM, sharad kuma > > r <[email protected]> wrote: > >> Given a string A, and a string B, and a dictionary, how would you convert >> A to B in the minimum no of operations, given that: >> >> i) All the intermediate words must be from the dictionary >> >> ii) An ‘operation’ is defined as: >> >> a) Delete any character from a string ex dog → do >> >> b) Insert any character into a string ex cat → cart >> >> c) Replace any character in the string with another ex cat → cot >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]<algogeeks%[email protected]> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- yezhu malai vaasa venkataramana Govinda Govinda -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
