Leetcode 1338. Reduce Array Size to The Half

Find the minimum number of distinct values to remove (deleting all their occurrences) so that at least half the array's elements are gone — equivalently, count element frequencies and greedily pick the largest frequencies until their sum is ≥ n/2.