आसान 0 हल किए गए 0% स्वीकृति

One-Hot Encoding

Turn categories into vectors with a single 1, the input format for classifiers and embeddings.

आप क्या सीखेंगे

  • Map categories to vector positions
  • Build one-hot rows for each label
  • Prepare categorical data for models

समस्या

अनुवाद दिखाएँ

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).

सीमाएँ

1 ≤ length ≤ 1,000

Each label is 1 to 20 characters

उदाहरण

उदाहरण 1
इनपुट:
labels = ["red", "green", "blue", "green"]

अपेक्षित आउटपुट:
expected = [
    [0, 0, 1],
    [0, 1, 0],
    [1, 0, 0],
    [0, 1, 0]
]
इनपुट:
std::vector<std::string> labels = {"red", "green", "blue", "green"};

अपेक्षित आउटपुट:
std::vector<std::vector<long long>> expected = {
    {0, 0, 1},
    {0, 1, 0},
    {1, 0, 0},
    {0, 1, 0}
};
इनपुट:
string[] labels = new string[] {"red", "green", "blue", "green"};

अपेक्षित आउटपुट:
long[][] expected = new long[][] {
    new long[] {0, 0, 1},
    new long[] {0, 1, 0},
    new long[] {1, 0, 0},
    new long[] {0, 1, 0}
};

व्याख्या

The categories in alphabetical order are blue, green, red. So red → [0, 0, 1], green → [0, 1, 0] and blue → [1, 0, 0].

उदाहरण 2
इनपुट:
labels = ["yes"]

अपेक्षित आउटपुट:
expected = [
    [1]
]
इनपुट:
std::vector<std::string> labels = {"yes"};

अपेक्षित आउटपुट:
std::vector<std::vector<long long>> expected = {
    {1}
};
इनपुट:
string[] labels = new string[] {"yes"};

अपेक्षित आउटपुट:
long[][] expected = new long[][] {
    new long[] {1}
};

व्याख्या

There is only one category, so every vector is [1].

संदर्भ

यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।

दूसरों से सीखें

समुदाय समाधान

अभी तक कोई प्रकाशित समाधान नहीं। पहला साझा करने के लिए इस चुनौती को हल करें।