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. Practice
  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;

    }

    • vominhhuy008 + 1 comment

      Can you explain it please ? thanks

      • pbpraveen1988 + 0 comments

        They are just asking the count of candles blow off by birthday guy.

        Only heighted candles can be blow off , so we just need to find the count of heighted candles from array.

        a) Sort the array in ascending order , so you will have the sorted array with high values as last

        b) Get the last value in array and find out the count with that value. Thats it.