Medium data structure and algorithm practice puzzle.
Given a list of scores and k, return the indices of the k highest scores, highest first. Make a list of indices, sort them by their scores from high to low, and keep the first k. Top-k sampling does this so the model only picks from its strongest candidates.
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 Quantile Rig, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles