Edit Distance (Levenshtein)
Dynamic ProgrammingMediumCalculate the minimum character operations to transform string A to string B, drawing the complete DP table.
Alt+Shift+D
Configuration Panel
Complexity Indices
Time ComplexityO(N * M)
Auxiliary SpaceO(N * M)
Conceptual Overview
Edit Distance calculates the minimum number of character operations (inserts, deletes, or substitutions) needed to transform string A into string B.
Source: CP-Algorithms reference guide