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).
Restrições
1 ≤ length ≤ 1,000
Each label is 1 to 20 characters
Exemplos
Entrada:
labels = ["red", "green", "blue", "green"]
Saída esperada:
expected = [
[0, 0, 1],
[0, 1, 0],
[1, 0, 0],
[0, 1, 0]
]
Entrada:
std::vector<std::string> labels = {"red", "green", "blue", "green"};
Saída 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"};
Saída 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}
};
Explicação
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"]
Saída esperada:
expected = [
[1]
]
Entrada:
std::vector<std::string> labels = {"yes"};
Saída esperada:
std::vector<std::vector<long long>> expected = {
{1}
};
Entrada:
string[] labels = new string[] {"yes"};
Saída esperada:
long[][] expected = new long[][] {
new long[] {1}
};
Explicação
There is only one category, so every vector is [1].
Como abordar
Tente sozinho primeiro e depois abra uma dica de cada vez.
Dica 1
Find the distinct categories first, then sort them alphabetically to define the column order.
Dica 2
For each label, place a 1 only in the column matching that label and 0 everywhere else.
Dica 3
Make sure duplicate labels produce identical rows, since the output has one row per input label.
Complexidade esperada
O(n log k) time, O(nk) extra space
Referências
Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.