One edit distance
Given two strings s and t, return True if and only if they are EXACTLY one edit distance apart. One edit means inserting, deleting, or replacing a single character. Strings equal to each other (zero edits) are NOT one edit apart. 0 <= len(s), len(t) <= 10^4.
Implement
one_edit_distance(s: str, t: str) → boolExamples
in
["ab","acb"]outtrueWhat 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 20 min
solution.py
InputExpectedGot
["ab","acb"]truenot run yetsample