Leetcode 72. Edit Distance

Compute the minimum number of single-character insertions, deletions, or replacements needed to transform word1 into word2 (the classic Levenshtein edit distance), typically solved with dynamic programming over the two string lengths (both ≤ 500).