Leetcode 1722. Minimize Hamming Distance After Swap Operations

Interpret allowedSwaps as edges of an undirected graph: any indices in the same connected component can be arbitrarily permuted, so to minimize Hamming distance you should, per component, match as many source values to target values as possible using multiset counts. The answer is the sum over components of (component size − number of matched values).