Topic: Dynamic Programming Problem / Level: beginner

Problem: Calculate the minimum number of edits (insertions, deletions, substitutions) to transform one string into another (Levenshtein distance).

Run the code to see the output here...