hard Dynamic Programming
Edit Distance
Return the minimum number of single-character insertions, deletions, or substitutions needed to turn `word1` into `word2` (the Levenshtein distance). Example: ("horse", "ros") → 3.
runs in your browser
Return the minimum number of single-character insertions, deletions, or substitutions needed to turn `word1` into `word2` (the Levenshtein distance). Example: ("horse", "ros") → 3.