Edit Distance
Print the minimum number of single-character insertions, deletions and substitutions turning A into B (Levenshtein distance).
Input: two lines: string A, then string B.
Output: the edit distance.
Constraints:
- 1 ≤ |A|, |B| ≤ 1000
- lowercase letters
Sample Tests
Input 1
kitten sitting
Output 1
3
Input 2
abc abc
Output 2
0
Discussion (opens after you solve — no spoilers before)
No comments yet.