Problema
At the end of the term a teacher wants a quick summary of the class: how many students earned each letter grade. The scale is 90 and above for A, 80 to 89 for B, 70 to 79 for C, 60 to 69 for D and below 60 for F.
Implement grade_letter_counts(scores).
Input
scores: Every student's final score.
Output
Return five counts in the order A, B, C, D, F. An empty class gives [0, 0, 0, 0, 0].
Restricciones
0 ≤ number of scores ≤ 10,000
0 ≤ score ≤ 100
Ejemplos
Entrada:
scores = [95, 82, 67, 88, 45, 90]
Salida esperada:
expected = [2, 2, 0, 1, 1]
Entrada:
std::vector<long long> scores = {95, 82, 67, 88, 45, 90};
Salida esperada:
std::vector<long long> expected = {2, 2, 0, 1, 1};
Entrada:
long[] scores = new long[] {95, 82, 67, 88, 45, 90};
Salida esperada:
long[] expected = new long[] {2, 2, 0, 1, 1};
Explicación
95 and 90 are A, 82 and 88 are B, 67 is D and 45 is F: [2, 2, 0, 1, 1].
Entrada:
scores = [79, 80, 59, 60]
Salida esperada:
expected = [0, 1, 1, 1, 1]
Entrada:
std::vector<long long> scores = {79, 80, 59, 60};
Salida esperada:
std::vector<long long> expected = {0, 1, 1, 1, 1};
Entrada:
long[] scores = new long[] {79, 80, 59, 60};
Salida esperada:
long[] expected = new long[] {0, 1, 1, 1, 1};
Explicación
Each score sits on a cutoff: 79 is C, 80 is B, 59 is F and 60 is D: [0, 1, 1, 1, 1].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Check the highest cutoff first so each score falls into exactly one branch.
Pista 2
Use an array of five counters, one per letter.
Pista 3
An empty class just returns the counters untouched.
Complejidad esperada
O(n) time, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.