We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Equalize the Array
  5. Discussions

Equalize the Array

Sort by

recency

|

1938 Discussions

|

  • vishwaschourasi1
     + 0 comments

    Write your code here

    `ef equalizeArray(arr): counts={} for char in arr: counts[char] = arr.count(char) maxim= max(counts.values()) return len(arr)-maxim

    `

  • akash_prajapati6
     + 0 comments
    def equalizeArray(arr):
    seta=set(arr)
    c=0
    for i in seta:
        x=arr.count(i)
        if(c<x):
            c=x
    return len(arr)-c

  • alban_tyrex
     + 0 comments

    Here is my O(N) c++ solution, you can watch the explanation here : https://youtu.be/8p9yuqSv4ek

    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;
}

  • highsoft_soi
     + 0 comments

    Perl:

    sub equalizeArray {
    my $arr = shift;
    
    my %h;
    my $cnt = 0;
    foreach (@$arr) {
        $h{$_} += 1;
    }
    my ($max) = sort { $h{$b} <=> $h{$a} } keys %h;
    for (my $i = 0; $i < scalar(@$arr); $i++) {
        if ($arr->[$i] != $max) {
            $cnt++;
        }
    }
    return $cnt;
}

  • jjr20060326
     + 0 comments

    Python

    from collections import Counter

def equalizeArray(arr):
   return len(arr) - max(Counter(arr).values(), default=0)