Edit Distance

Minimum number of operations (insert, delete, replace) to transform one string into another. Also known as the Levenshtein distance.

Time: O(m * n) | Space: O(m * n)

Controls

Source String

Target String

Speed: Medium

FastSlow

Legend

Active cell

Delete (top)

Insert (left)

Replace/Match (diag)

Computed

Optimal path

✏️

Configure the strings and press Start to visualize