Easy data structure and algorithm practice puzzle.
Given a min-heap stored as an array, return its smallest value, or null if it's empty. In a min-heap, the smallest value is always at index 0. No searching needed. That's the whole point of a heap.
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 Login Streak Finder, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles