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
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? 

jmax315:
20161116 22:12:22
Well. That was an exercise in humility. 

aditya9125:
20161015 12:04:19
Find optimal substructure .Rest of the things are easy. 

Robin Chawla:
20161008 21:52:16
ac in one go :) try MBLAST after that.. 

shivam_64321:
20161006 21:05:14
getting TLE with python and AC with c++ ;f**k cost 2 WA 

Gaurav Dahima:
20160917 19:10:31
top down TLE, bottom up AC !! 

rayhan50001:
20160830 06:32:32
edit distance first problem solved.... Yesssss. 
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 