Edit distance
Given two strings word1 and word2 (0 <= len <= 500, lowercase letters), return the minimum number of single-character operations (insert, delete, or replace) required to convert word1 into word2 (Levenshtein distance).
Implement
min_edit_distance_ops(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 25 min
solution.py
InputExpectedGot
["horse","ros"]3not run yetsample