Leetcode 161. One Edit Distance

Determine whether two strings are exactly one edit apart — i.e., one insertion, deletion, or replacement turns one into the other. Solve in linear time by handling the three length-based cases (equal, +1, -1) and scanning with at most one allowed mismatch.