Easy data structure and algorithm practice puzzle.
Given a score for every word in a model's vocabulary, return the index of the highest score. That's greedy decoding: always pick the most likely next word and never look back. If two tie, keep the first. Walk the list once and keep the best index so far.
Solve it three ways: snap the jigsaw pieces together, fill in the blanks, or type it from scratch against the tests. This one is free.
Every line of the solution comes with a note explaining why it is there, and a step by step replay shows the code running. At level 3, where you type it yourself, you can ask for an AI mock interview on this problem that ends with a hiring manager's scorecard.
Then grow it into a real project with the Software Engineer button: this puzzle becomes the Request Sampler, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles