Minimize max unique characters in strings via index swaps
Filed under Directi
The question
Given two strings A and B of the same length N, where you can swap A[i] and B[i] zero or more times, minimize the maximum number of unique characters between the two resulting strings and output that value.
No write-up yet. Related questions below have one.
Related Directi questions
Collected from public candidate posts and coding forums. Updated Nov 2026.