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)

TYPESCRIPT function birthdayCakeCandles(candles: number[]): number { const count = new Map(); candles.sort((a,b) => b-a); for(let can of candles){ let prevCount = count.get(can) || 0; count.set(can,prevCount + 1); } console.log(count.get(candles[0])); return count.get(candles[0])

}

c++

int birthdayCakeCandles(vector<int> candles) {
    vector<int>::iterator maks ;
    maks = max_element(candles.begin(),candles.end());
    int result = 0;
    for (const auto& x : candles) {  
        if (x == *maks) {
            result++;
        }
    }return result;
}

Here is my solution for Java 8.

public static int birthdayCakeCandles(List<Integer> candles) {
        // Write your code here
        long max = 0;
        int count = 0;
        for(int val: candles)
        {
            if(max < val){
                max = val;
                count = 1;
            } else if (max == val){
                count++;
            }  
        }
        return count;
    }

Python solution using simple for loop (a bit verbose but readable).

Algorithms

1. Reverse sort the candles (highest numbers are placed in the starting positions)
2. Loop candles starting from first highest number
3. Compare if first highest number is equal or greater than previous_tallest
4. If #3 evaluates to True, assign the first highest number to previous_tallest and increment tallest_counts by 1
5. Repeat step #2 to #4
6. Return tallest_counts

def birthdayCakeCandles(candles):

# Sort by reverse order
sorted_candles_desc = sorted(candles, reverse=True)
previous_tallest = 0
tallest_counts = 0

# Loop starting from first highest
for candle in sorted_candles_desc:

    # Handle cases where there are more than 
    # one highest candle (multiple highest equal numbers)
    if candle >= previous_tallest:
        previous_tallest = candle
        tallest_counts += 1
    else:
        break 
return tallest_counts