Implement prototype(left: str, right: str) -> int and solve with the same signature. Return unit-cost Levenshtein distance over exact Python string code points. Allowed edits are insertion, deletion, and substitution. Do not casefold or normalize Unicode; transposition is not a single edit.
Examples: ('kitten', 'sitting') returns 3; ('ab', 'ba') returns 2; ('', 'abc') returns 3.
Prototype: recursive prefix comparisons without caching. Final: use dynamic programming with O(nm) time and O(min(n,m)) auxiliary space for a distance-only result. Strings remain unchanged; no additional validation errors are required.
Drag or use the arrow keys to resize. Home collapses the question; End collapses the editor. Enter or double-click resets the split.
Loading editor…
Loading editor…
No results yet.
Complete the starter code, then run the checks.
Results and errors will appear here.