Levenshtein Distance DP | Dataford Interview Questions

Compute the Levenshtein (edit) distance between two strings using dynamic programming.

Asked in the Online technical interview stage. Second DSA question, described as a Levenshtein distance DP problem.

Implement edit_distance(s, t), which returns an integer representing the minimum number of single-character insertions, deletions, or substitutions required to transform s into t.

Constraints

0 <= len(s), len(t) <= 1000
Strings contain lowercase English letters
Each edit has unit cost

Function Signature

def edit_distance(s, t):

Your question is Levenshtein Distance DP. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem