Problema
Count every character in text except spaces. Report each distinct character once as "character:count", sorted by character code (so uppercase letters come before lowercase).
Implement character_frequency(text).
Input
text: The text to count (ASCII characters).
Output
Return the list of "character:count" entries.
Restricciones
0 ≤ length ≤ 10,000
Ejemplos
Entrada:
text = "hello"
Salida esperada:
expected = ["e:1", "h:1", "l:2", "o:1"]Entrada:
std::string text = "hello";
Salida esperada:
std::vector<std::string> expected = {"e:1", "h:1", "l:2", "o:1"};Entrada:
string text = "hello";
Salida esperada:
string[] expected = new string[] {"e:1", "h:1", "l:2", "o:1"};Explicación
e:1, h:1, l:2, o:1 sorted by character: ["e:1", "h:1", "l:2", "o:1"].
Entrada:
text = "a a A"
Salida esperada:
expected = ["A:1", "a:2"]Entrada:
std::string text = "a a A";
Salida esperada:
std::vector<std::string> expected = {"A:1", "a:2"};Entrada:
string text = "a a A";
Salida esperada:
string[] expected = new string[] {"A:1", "a:2"};Explicación
Spaces are skipped; "A" sorts before "a": ["A:1", "a:2"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Skip spaces, but count every other ASCII character exactly as it appears.
Pista 2
Accumulate counts in a frequency table, then output distinct characters once.
Pista 3
Sort by character code so uppercase and lowercase order naturally follows ASCII.
Complejidad esperada
O(n + m log m) time, O(m) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.