Equalize_the_Array.java

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;

class Result {

    /*
     * Complete the 'equalizeArray' function below.
     *
     * The function is expected to return an INTEGER.
     * The function accepts INTEGER_ARRAY arr as parameter.
     */

    public static int equalizeArray(List<Integer> arr) 
    {
      // Write your code here
      Map<Integer,Integer> M = new HashMap<>();  //creating a map..
      int i;
      for(i=0;i<arr.size();i++)
      {
          if(M.containsKey(arr.get(i)))
          {
              M.put(arr.get(i),M.get(arr.get(i))+1);
          }
          else
          {
              M.put(arr.get(i),1);
          }
      }
      //just simply find the length of the max common numbers..
      //and subtract with the size of the list..
      int max = Integer.MIN_VALUE;
      for(Map.Entry<Integer,Integer> entry:M.entrySet())
      {
          if(entry.getValue()>max)
          {
              max = entry.getValue();
          }
      }
      return arr.size()-max;
    }

}

public class Solution {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

        int n = Integer.parseInt(bufferedReader.readLine().trim());

        List<Integer> arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
            .map(Integer::parseInt)
            .collect(toList());

        int result = Result.equalizeArray(arr);

        bufferedWriter.write(String.valueOf(result));
        bufferedWriter.newLine();

        bufferedReader.close();
        bufferedWriter.close();
    }
}