All challenges
Algorithm challenge · DSA
Edit Distance
Difficulty
hard
Time
~40m
Format
Single
Grading
Auto-graded
#python#javascript#typescript#go#java#cpp#rust#dsa#dynamic-programming#strings
Mission file // read carefullyhard
Given two strings a and b, return the minimum number of single-character operations (insert, delete, replace) to convert a into b (Levenshtein distance).
Example
a = "horse", b = "ros" => 3
Build with
minDistance(a: string, b: string) → intPythonJavaScriptTypeScriptGoJavaC++Rust
5 tests · 2 hidden
Auto-graded on submit
Start challenge
Sign in to save your progress.