Edit Distance (DP)
← Back to Classic Problems (DP)
The minimum number of single-character operations (insert, delete, substitute) to transform one string into another. Solved with DP in O(mn) time and space. Also known as Levenshtein distance. Used in spell checking, DNA alignment, and fuzzy matching.