Birthday Cake Candles

Sort by

recency

|

5352 Discussions

|

  • + 0 comments
    def birthdayCakeCandles(candles):
        return candles.count(max(candles))
    
  • + 0 comments

    Python 3 using list comprehension:

    import os
    
    def birthdayCakeCandles(candles):
        tallest_candle = max(candles)
        num_tallest = sum([c == tallest_candle for c in candles])
        return num_tallest
    
    if __name__ == '__main__':
        fptr = open(os.environ['OUTPUT_PATH'], 'w')
    
        candles_count = int(input().strip())
        candles = list(map(int, input().rstrip().split()))
        result = birthdayCakeCandles(candles)
    
        fptr.write(str(result) + '\n')
        fptr.close()
    
  • + 0 comments

    C# solution

    public static int birthdayCakeCandles(List<int> candles)
        {
            candles.Sort();
            int maximum = candles.Last();
            int result = candles.Where(x => x == maximum).Count();
            return result;
        }
    
  • + 0 comments

    M = max(candles) return len([candle for candle in candles if candle == M])

  • + 0 comments
    def birthdayCakeCandles(candles):
        # Write your code here
        maximum = candles[0]
        count = 0;
        for i in candles:
            if i > maximum:
                maximum = i
                count = 1
            elif i == maximum:
                count += 1
        return(count)