Leetcode 1638. Count Substrings That Differ by One Character
Count the number of pairs of non-empty substrings—one from s and one from t—of the same length whose Hamming distance is exactly one (they differ in exactly one character); 1 ≤ |s|,|t| ≤ 100.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.