EDIST - Edit distance
You are given two strings, A and B. Answer, what is the smallest number of operations you need to
transform A to B?
Operations are:
- Delete one letter from one of strings
- Insert one letter into one of strings
- Replace one of letters from one of strings with another letter
Input
T - number of test cases
For each test case:
- String A
- String B
Both strings will contain only uppercase characters and they won't be longer than 2000 characters.
There will be 10 test cases in data set.
Output
For each test case, one line, minimum number of operations.
Example
Input: 1 FOOD MONEY Output: 4
hide comments
ayushgupta1997:
2017-12-19 11:13:00
Note :
|
|
aaman007:
2017-09-16 19:12:14
I tried to solve it by finding LCS....the
|
|
satyabrat35:
2017-08-29 10:34:47
Levenshtein distance ... :) |
|
softxide:
2017-08-29 05:02:13
stop reading comments |
|
monukumar:
2017-06-22 17:55:15
same code accepted in c++ , WA in Java. |
|
arvind002:
2017-05-27 13:16:55
Great problem!! Declare a global array , it will save you a wrong answer :)
|
|
sagnik_66:
2017-05-22 17:53:23
Learnt something new :D |
|
bmay:
2017-05-20 16:25:46
For Python, use PyPy 2.6.0 |
|
ssunitk:
2017-05-18 17:08:23
Please make sure that ur array for both a and b should be of size 2001 , in case of 2000 it will show wrong answer .
|
|
sandeep_4141:
2017-05-16 05:04:19
After lot's of effort, finally AC !! |
Added by: | Mislav Balunović |
Date: | 2010-02-28 |
Time limit: | 15s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: NODEJS OBJC PERL6 SQLITE VB.NET |
Resource: | Internet |