Python Solution for HackerRank Problem: Birthday Cake Candles
This is another simple problem from hackerrank called "Birthday Cake Candles" Here is how I solved it in python.. Let me know if you got a better one.
You are in charge of the cake for your niece's birthday and have decided the cake will have one candle for each year of her total age. When she blows out the candles, she’ll only be able to blow out the tallest ones. Your task is to find out how many candles she can successfully blow out.
For example, if your niece is turning years old, and the cake will have candles of height , , , , she will be able to blow out candles successfully, since the tallest candles are of height and there are such candles.
Complete the function
birthdayCakeCandles in the editor below. It must return an integer representing the number of candles she can blow out.
birthdayCakeCandles has the following parameter(s):
- ar: an array of integers representing candle heights
The first line contains a single integer, , denoting the number of candles on the cake.
The second line contains space-separated integers, where each integer describes the height of candle .
- 1<= n <= 105
- 1<= arr[i] < 107
Return the number of candles that can be blown out on a new line.
4 3 2 1 3
We have one candle of height 1, one candle of height 2 , and two candles of height 3 . Your niece only blows out the tallest candles, meaning the candles where height = 3 . Because there are such candles, we print on a new line.