NeetCode #27LC-161MediumArrays & HashingNC Algo100
← Back to All Problems#27 · #161 · One Edit Distance(相隔为 1 的编辑距离)
📌 Problem Statement & Constraints
Given two strings
s and t, determine whether they are exactly one edit distance apart. A valid edit is inserting one character, deleting one character, or replacing one character. Constraints: 0 <= s.length, t.length <= 10^4.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!