Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 10
What does the edit distance (Levenshtein) DP compute and in what time?
A
The longest common prefix in O(n)
B
Minimum inserts, deletes and substitutions to turn one string into another, in O(nm)
C
Exact matches in O(n + m)
D
Hamming distance in O(n log n)