Medium data structure and algorithm practice puzzle.
Given piece sizes, a list of moves, and a max size, apply the moves and return the new sizes. Read the moves two at a time: take one line from the first position and give it to the second. Skip any move that would empty a piece or push one past the max. The pieces end up looking hand cut, but none goes missing and none gets too big.
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 Packet Coverage Report, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles