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
|
Fodor Gabor:
2017-01-30 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:
2017-01-23 08:16:08
Top down solution gets TLE??
|
|
abbi_18:
2017-01-20 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:
2017-01-06 09:18:05
beautiful question :) |
|
Wumbolo:
2016-12-02 15:17:31
Resource is Internet? Really? |
|
jmax315:
2016-11-16 22:12:22
Well. That was an exercise in humility. |
|
aditya9125:
2016-10-15 12:04:19
Find optimal substructure .Rest of the things are easy. |
|
Robin Chawla:
2016-10-08 21:52:16
ac in one go :-) try MBLAST after that.. |
|
shivam_64321:
2016-10-06 21:05:14
getting TLE with python and AC with c++ ;f**k cost 2 WA |
|
Gaurav Dahima:
2016-09-17 19:10:31
top down TLE, bottom up AC !! |
| Added by: | Mislav Balunović |
| Date: | 2010-02-28 |
| Time limit: | 15s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: NODEJS OBJC PERL6 SQLITE VB.NET |
| Resource: | Internet |
RSS