Hard data structure and algorithm practice puzzle.
Given a list of probabilities and a threshold p, return the indices to keep, most likely first. Sort the indices by probability from high to low. Keep adding them and a running total until the total reaches p. Unlike top-k, the number kept changes with how sure the model is.
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 Calendar Merger, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles