Implement `minDistance(a, b)` returning the minimum number of single-character insertions, deletions, or replacements to turn `a` into `b`.
+ 1 hidden test run on Submit.
Levenshtein DP over prefixes computes edit distance in O(m * n) time.
Run your code to see results.