Birthday Cake Candles


Problem Statement :


You are in charge of the cake for a child's birthday. You have decided the cake will have one candle for each year of their total age. They will only be able to blow out the tallest of the candles. Count how many candles are tallest.

Example

candles = [4,4,1,3]

The maximum height candles are 4 units high. There are of 2 them, so return 2.

Function Description

Complete the function birthdayCakeCandles in the editor below.

birthdayCakeCandles has the following parameter(s):

    int candles[n]: the candle heights

Returns

    int: the number of candles that are tallest

Input Format 

The first line contains a single integer, n , the size of candles[i].
The second line contains  n space-separated integers, where each integer i describes the height of candles[i] .

Constraints

1 <= n <= 10^5
1 <= candles[i] <= 10^7



Solution :


                        In C :

int birthdayCakeCandles(int ar_count, int* ar) {
    int  max = ar[0], count = 0;
    for(int i=0;i<ar_count;i++)
    {
        if(ar[i] > max)
            {
                max  = ar[i];
            }
    }


    for(int i=0;i<ar_count;i++)
    {
        if(ar[i] == max)
        count++;
    }

    return count;
}






In C ++:

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int N; cin>>N;
    int a[N];
    for(int i=0;i<N;i++) cin>>a[i];
    int biggest = 0;
    for(int i=0;i<N;i++) biggest = max(biggest, a[i]);
    int count = 0;
    for(int i=0;i<N;i++) if (a[i] == biggest) count++;
        cout<<count<<endl;
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}




In Python3 :


N=int(input())
V=list(map(int,input().split()))
print(V.count(max(V)))




In Java :


import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        
        int n = in.nextInt();
        int max = 0;
        int sum = 0;
        int num;
        for(int i =0; i < n; i++){
            num = in.nextInt();
            if(num > max){
                sum = 1;
                max = num;
            }else if(num == max){
                sum++;
            }
        }
        System.out.println(sum);
    }
}