We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Warmup
  4. Birthday Cake Candles
  5. Discussions

Birthday Cake Candles

  • KhalifaYakub
     + 17 comments

    use c++ and you'll be fine

    int birthdayCakeCandles(int n, vector <int> ar) {
    // Complete this function
    int max = ar[0];
    int count = 0;
    for(int i=0; i<n; i++)
        if(ar[i] > max)
            max = ar[i];
    for(int i = 0; i < n; i++)
        if (ar[i] == max)
            count++;
    return count;
}