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

  • matthew_zilkie
     + 1 comment
    Did you try using c++ std::sort(ar.begin(), ar.end()); ? I did and it worked flawlessly.

int birthdayCakeCandles(int n, vector<int> ar) {
// Complete this function
sort(ar.begin(), ar.end());
int max = ar[ar.size() -1];
int count = 0;
for(auto num : ar) {
    if(num == max) ++count;
}
return count;

    }