Minimum number of single‑character insertions, deletions, or replacements required to transform one string into another.
m,n lengths
or O(min)
String DP
dist prefix
Damerau, weighted, similarity
Fill the dynamic programming table row by row and watch distance values evolve.
Derive the recurrence, optimizations, and explore classical variants of edit distance.