← Back to All Algorithms

✏️ Edit Distance (Levenshtein)

Problem

Find minimum edits (insert, delete, replace) to transform string A into string B.

Recurrence:

If A[i] = B[j]: dp[i][j] = dp[i-1][j-1]

Else: dp[i][j] = 1 + min(dp[i-1][j], dp[i][j-1], dp[i-1][j-1])

A = HORSE
B = ROS
Insert ↓
Delete →
Replace ↘
Click "Start" to compute edit distance