Medium data structure and algorithm practice puzzle.
Given a min-heap and a new value, add the value and return the fixed heap. Put it at the end, then compare it with its parent at (i - 1) / 2. If the parent is bigger, swap them and keep going up. Stop when the parent is smaller or equal, or you reach the top. It takes at most log n swaps, the height of the tree.
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 Trip Anomaly Watch, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles