Solution.java

//Problem: https://www.hackerrank.com/challenges/equality-in-a-array
//Java 8
import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        
        int itemsToDelete = 0;
        int highestFrequency = 1;
        HashMap<Integer, Integer> numberFrequency = new HashMap<>();
        
        for(int i = 0; i < n; i++)
        {
            int curr = input.nextInt();
            
            if(numberFrequency.get(curr) == null)
            {
                numberFrequency.put(curr, 1);
            }
            else
            {
                int newFrequency = numberFrequency.get(curr) + 1;
                
                numberFrequency.put(curr, newFrequency);
                highestFrequency = (newFrequency > highestFrequency) ? newFrequency : highestFrequency;
            }
        }
        
        itemsToDelete = n - highestFrequency;
        
        System.out.println(itemsToDelete);
    }
}