Available question text
Determine whether a single swap of one character from each of two lowercase strings can make their counts of distinct characters equal. The core challenge is to reason about how swapping a letter can introduce or remove unique letters from each string (over a fixed 26-letter alphabet) so the distinct-character totals match.
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 2531. Make Number of Distinct Characters Equal
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source