Available question text
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.
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 1638. Count Substrings That Differ by One Character
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source