function equalizeArray(arr)
    local max
    local elements = {}
    
    for _, value in ipairs(arr) do
        elements[value] = (elements[value] or 0) + 1
        max = math.max(max or 0, elements[value])
    end
    
    return #arr - max;
end

func equalizeArray(arr: [Int]) -> Int {
    var memberAmount = [Int: Int]()
    let distinct = Array(Set(arr))
    for i in 0..<distinct.count {
        let count = arr.filter { $0 == distinct[i] }.count
        memberAmount[distinct[i]] = count
    }
    return arr.count - (memberAmount.values.max() ?? 0)
}

public static int equalizeArray(List<int> arr)
    {
            Dictionary<int, int> memberAmount = new Dictionary<int, int>();
            List<int> distinct = arr.Distinct().ToList();
            for(int i = 0; i< distinct.Count(); i++)
            {
                int count = arr.Count(p => p == distinct[i]);
                memberAmount.Add(distinct[i], count);
            }
            return arr.Count() - memberAmount.Values.Max();
    }

function equalizeArray(arr) {
  if (arr.length === 1) return 0;
  const obj = {};
  for (let i = 0; i < arr.length; i++) {
    obj[arr[i]] = ++obj[arr[i]] || 1;
  }
  let max = 0;
  let sum = 0;
  for (const key in obj) {
    max = Math.max(max, obj[key]);
    sum = sum + obj[key];
  }

  return sum - max;
}