Leetcode 3002. Maximum Size of a Set After Removals

Choose n/2 elements to keep from each of two equal-length arrays so that the union of the remaining elements has maximum distinct values. The task reduces to counting frequencies, unique values and their intersection, then greedily selecting which distinct values to preserve under the fixed-size-per-array constraint.