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?
- 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
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.
For each test case, one line, minimum number of operations.
Input: 1 FOOD MONEY Output: 4
I am frustated
@shankar should be 4
what should be the answer for
Can someone provide me some sample test cases? The judge is giving me WA but I have been correct in all the examples I have tried.
Even 2D array solution is accepted. :D
my time 1.21
Made a mistake in calculating min!!
There is no need for 1D array, in C++ at least. :)