Easy data structure and algorithm practice puzzle.
Given a min-heap and a number n, pop the smallest value n times and return what's left, smallest first. Popping the minimum n times leaves everything except the n smallest, so sort and drop the first n. Popping everything one at a time like this is how heapsort works.
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 Ticket Daily Digest, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles