Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 161. One Edit Distance
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source