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
imkiller:
20180325 16:37:47
Just a simple editDistance problem .


erfanesm:
20180220 07:31:38
this problem can't be solve in this way :


bradyawn:
20180124 22:23:33
AC in one go!!! = Why I hate SPOJ community


nveenjain:
20180116 10:59:53
Pass strings through reference, costed TLE :( 

asifk1997:
20180114 05:25:55
standard dp problem


imshreyas:
20171226 11:44:54
For reference


ayushgupta1997:
20171219 11:13:00
Note :


kmkhan_014:
20171127 20:20:24
Last edit: 20171127 20:20:54 

aaman007:
20170916 19:12:14
I tried to solve it by finding LCS....the


satyabrat35:
20170829 10:34:47
Levenshtein distance ... :) 
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 