Here is Birthday cake candles solution in Python, java, c++, c and javascript - https://programmingoneonone.com/hackerrank-birthday-cake-candles-problem-solution.html

Resolucion en java:

int mayor = candles.get(0); int contador = 1;

for(int i=1;  i < candles.size(); i++){
    int actual = candles.get(i);

    if(actual > mayor){
        mayor = actual;
        contador = 1;
    }else if(actual == mayor){
        contador++;
    }

}
    return contador;

Resolucion en java:

int mayor = candles.get(0); int contador = 1;

for(int i=1;  i < candles.size(); i++){
    int actual = candles.get(i);

    if(actual > mayor){
        mayor = actual;
        contador = 1;
    }else if(actual == mayor){
        contador++;
    }

}
    return contador;

GO // Write your code here max := int32(0) count := int32(0)

for _, number := range candles {
    if number > max {
        max = number
        count = 1
    } else if number == max {
        count++
    }
}
return count

Rust

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
}