Levenshtein distance
Given two strings, return the minimum number of single-character insertions, deletions, or substitutions to turn the first into the second.
Implement
min_distance(word1: str, word2: str) → intExamples
in
["horse","ros"]out3What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 35 min
solution.py
InputExpectedGot
["horse","ros"]3not run yetsample