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
sunny:
20170319 08:25:52
Nice problem :). Learned an algorithm. 

rishab05:
20170316 03:57:49
It's giving successful results in my IDE and even in ideone. But giving Segmentation fault while submitting.


vijayrit:
20170314 16:22:42
got correct output on ideone but getting segmentation erroe on spoj........


da_201501181:
20170304 11:05:09
Nice Question..!! Learned a lot..!! 

programminator:
20170215 12:34:48
I don't understand. Does insertion and deletion take place only at the end or wherever in between? 

Fodor Gabor:
20170130 21:09:50
Python (both 2.7 and 3.4) seems to bump into TLE, both for the O(N*2) and O(N) memory versions. There's no point in even trying it. There seems to be 6 successful Python 2.7 submissions from 2015, but maybe they tightened the running time restriction since then.


aronzx:
20170123 08:16:08
Top down solution gets TLE??


abbi_18:
20170120 20:21:09
Awesome qs, done it in O(n*n) space complexity, can anybody please suggest a place where i can learn it solve it in O(n) space complexity? 

scorpion_ajay:
20170106 09:18:05
beautiful question :) 

Wumbolo:
20161202 15:17:31
Resource is Internet? Really? 
Added by:  Mislav Balunović 
Date:  20100228 
Time limit:  15s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS OBJC PERL6 SQLITE VB.NET 
Resource:  Internet 