Leetcode 2531. Make Number of Distinct Characters Equal

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.