Birthday Cake Candles

Sort by

recency

|

5410 Discussions

|

  • + 0 comments

    return candles.GroupBy(it => it).OrderBy(it => it.Key).Last().Count();

  • + 0 comments
    int birthdayCakeCandles(vector<int> candles) {
        int n = candles.size();
        int max_can = 0;
        int count = 0;
        
        for(int i=0; i<n; i++){
            if(candles[i] > max_can){
                max_can = candles[i];
                count=1;
            }
            else if(candles[i] == max_can){
                count++;
            }
        } 
        return count;
    }
    
  • + 0 comments
    public static int birthdayCakeCandles(List<Integer> candles) {
            if (candles.isEmpty())
                return 0;
            int tallestCandle = -1;
            int count = 0;
            for (Integer candle : candles) {
                if (tallestCandle < candle) {
                    tallestCandle = candle;
                    count = 1;
                } else if (tallestCandle == candle) {
                    count++;
                }
            }
            return count;
        }
    
  • + 0 comments

    This was my solution (python3)

    def birthdayCakeCandles(candles): # Write your code here return candles.count(max(candles))

  • + 0 comments

    lol, gotta lovel linq:

    public static int birthdayCakeCandles(List<int> candles)
    {
        var max = candles.Max();
        var tallCandleCount = candles.Where(x => x == max).Count();
    
        return tallCandleCount;
    }