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.
My solution on Python:
def birthdayCakeCandles(candles):
candles.sort()
c = sum(1 for i in candles if candles[-1] == i)
return c
it sum +1 if the element i has the same value has the last element on the sorted list (highest value) so it returns the count of the elements with the highest value (tallest candle)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Birthday Cake Candles
You are viewing a single comment's thread. Return to all comments →
My solution on Python: def birthdayCakeCandles(candles): candles.sort() c = sum(1 for i in candles if candles[-1] == i) return c
it sum +1 if the element i has the same value has the last element on the sorted list (highest value) so it returns the count of the elements with the highest value (tallest candle)