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
no need of an array of length 3000...the constraints in the problem are correct
WA :) Can someone provide me some test cases please !!
Harish Reddy Kolanu:
try using WagnerâFischer algorithm
Can somebody help. Its showing SIGSEGV error. Please help out.
2d array accepted with global + static int
should use dp or else tle :)
Sigsev for 2D array and non-global variables. Works with 1D and global.
I am frustated
@shankar should be 4
what should be the answer for