Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I was asked this question during phone interview.
Given two strings find the minimal number of edits required in order to transform one string to another. The solution needs to be implemented in java and run in O(n*m), assuming that n and m are the lengths of the input strings.
Example:
strings: milk -> beer
min edits: 4
For strings of the different length, use the Levenshtein Distance:
http://en.wikipedia.org/wiki/Levenshtein_distance
If you have strings of equal length and you do not want to consider insertions or deletions, the Hamming Distance is more efficient:
http://en.wikipedia.org/wiki/Hamming_distance
Example implementations of Levenshtein distance:
http://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Levenshtein_distance