fn birthdayCakeCandles(candles: &[i32]) -> i32 {
    if candles.is_empty() {
        return 0; 
    }

    let mut counter = 0;
    let mut high_number = candles[0];

    for &i in candles {
        if i > high_number {
            counter = 1;
            high_number = i;
        } else if i == high_number {
            counter += 1;
        }
    }

    counter
}

return candles.count(max(candles))

    public static int birthdayCakeCandles(List<Integer> candles) {
    // Write your code here
		// Optimized code
		// Time Complexity O(n) (Linear time)
		// Space Complexity O(1) (Constant space) Only two integer variables are used, regardless of input size.
        int tallestCandle = 0;
        int tallestCount = 0;
    
        for (Integer i : candles) {
            if(i > tallestCandle) {
                tallestCandle = i;
                tallestCount = 0;
            }
            
            if(i == tallestCandle) {
                tallestCount++;
            }
        }
    
        return tallestCount;
    }

}