Greedy Decoding
Beginner
Choose the next token greedily: the index of the largest logit (probability). On a tie, the smallest index wins.
Implement solve(logits).
Returns. Return the index as a Python int.
Examples
Example 1
Input:
solve([0.1, 0.7, 0.2])
Output:
1
Example 2
Input:
solve([1.0, 3.0, 3.0])
Output:
1
Keywords
problemsettransformer-llmgeneration
Python
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.