public static int equalizeArray(List<Integer> arr) {
    HashMap<Integer, Integer> ele = new HashMap<>();
    for(int n : arr)
       ele.put(n, Collections.frequency(arr, n));
    return arr.size() - Collections.max(ele.values());  
    }

function equalizeArray(arr) {
    let freq = {}; 
    
    for(let n of arr) {
        freq[n] = (freq[n] || 0 ) + 1; 
    }
    
    let maxFreq = Math.max(...Object.values(freq)); 
    
    return arr.length - maxFreq; 
}
// Be Happy and Code every day !!

int equalizeArray(vector<int> arr) {
    map<int, int>mp;
    int mx = 0;
    for(int el: arr) {
        mp[el]++;
        if(mp[el]>mx) mx = mp[el];
    }
    return arr.size() - mx;
}

def equalize_array(arr):
    count = {}
    for el in arr:
        if el in count:
            count[el] += 1
        else:
            count[el] = 1
    # Find the maximum frequency
    max_count = 0
    for value in count.values():
        if value > max_count:
            max_count = value
    # Calculate the number of elements to remove
    return len(arr) - max_count

def equalizeArray(arr):
    d=dict(Counter(arr))
    return len(arr) - max(d.values())