Karl has an array of integers. He wants to reduce the array until all remaining elements are equal. Determine the minimum number of elements to delete to reach his goal.
For example, if his array is , we see that he can delete the elements and leaving . He could also delete both twos and either the or the , but that would take deletions. The minimum number of deletions is .
Complete the equalizeArray function in the editor below. It must return an integer that denotes the minimum number of deletions required.
equalizeArray has the following parameter(s):
- arr: an array of integers
The first line contains an integer , the number of elements in .
The next line contains space-separated integers .
Print a single integer that denotes the minimum number of elements Karl must delete for all elements in the array to be equal.
5 3 3 2 1 3
Array . If we delete and , all of the elements in the resulting array, , will be equal. Deleting these elements is minimal. Our only other options would be to delete elements to get an array of either or .
Solution in Python
from collections import Counter def equalizeArray(arr): return len(arr) - max(Counter(arr).values()) input() arr = list(map(int,input().split())) print(equalizeArray(arr))