birthday-cake-candles.java

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {

    // Complete the birthdayCakeCandles function below.
    static int birthdayCakeCandles(int[] ar) {
        int len = ar.length;

        // edge test case
        if (len == 0){
            return 0;
        }

        // find max element
        int max = ar[0];

        // count of max element
        int count = 0;

        for(int i=0; i<len; i++){

            if(ar[i] > max){
                max = ar[i];
                count = 0;
            }

            if(max == ar[i]){
                count++;
            }
        }

        // now we get max element, find how many times the max element occurs in ar
        
        /*for(int i=0; i<len; i++){
            if(max == ar[i]){
                count++;
            }
        }*/

        return count;
    }

    private static final Scanner scanner = new Scanner(System.in);

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

        int arCount = scanner.nextInt();
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

        int[] ar = new int[arCount];

        String[] arItems = scanner.nextLine().split(" ");
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

        for (int i = 0; i < arCount; i++) {
            int arItem = Integer.parseInt(arItems[i]);
            ar[i] = arItem;
        }

        int result = birthdayCakeCandles(ar);

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

        bufferedWriter.close();

        scanner.close();
    }
}