Accepted solution

Birthday Cake Candles(Hacker Rank)

Open original problem
Source code

// Complete the birthdayCakeCandles function below.

int birthdayCakeCandles(vector<int> ar)

 {

    long long int  max=ar[0];

    int count=0;

    for(int i=0;i<ar.size();i++)

    {

        if(max<ar[i])

        {

            max =ar[i];

            count=1;

        }

        else if(max==ar[i])

        {

            count++;

        }

    }

    return count;

 

}
Join the discussion

Add your comment