Problema
Models need numbers, not words. One-hot encoding turns each category into a vector with one position per category: 1 at the category's position and 0 everywhere else.
Order the categories alphabetically. For each label, output its one-hot vector.
Implement one_hot(labels).
Input
labels: A list of category names.
Output
Return a matrix with one row per label and one column per distinct category (alphabetical order).
Restricciones
1 ≤ length ≤ 1,000
Each label is 1 to 20 characters
Ejemplos
Entrada:
labels = ["red", "green", "blue", "green"]
Salida esperada:
expected = [
[0, 0, 1],
[0, 1, 0],
[1, 0, 0],
[0, 1, 0]
]
Entrada:
std::vector<std::string> labels = {"red", "green", "blue", "green"};
Salida esperada:
std::vector<std::vector<long long>> expected = {
{0, 0, 1},
{0, 1, 0},
{1, 0, 0},
{0, 1, 0}
};
Entrada:
string[] labels = new string[] {"red", "green", "blue", "green"};
Salida esperada:
long[][] expected = new long[][] {
new long[] {0, 0, 1},
new long[] {0, 1, 0},
new long[] {1, 0, 0},
new long[] {0, 1, 0}
};
Explicación
The categories in alphabetical order are blue, green, red. So red → [0, 0, 1], green → [0, 1, 0] and blue → [1, 0, 0].
Entrada:
labels = ["yes"]
Salida esperada:
expected = [
[1]
]
Entrada:
std::vector<std::string> labels = {"yes"};
Salida esperada:
std::vector<std::vector<long long>> expected = {
{1}
};
Entrada:
string[] labels = new string[] {"yes"};
Salida esperada:
long[][] expected = new long[][] {
new long[] {1}
};
Explicación
There is only one category, so every vector is [1].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Find the distinct categories first, then sort them alphabetically to define the column order.
Pista 2
For each label, place a 1 only in the column matching that label and 0 everywhere else.
Pista 3
Make sure duplicate labels produce identical rows, since the output has one row per input label.
Complejidad esperada
O(n log k) time, O(nk) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.