Hard data structure and algorithm practice puzzle.
An open world streams assets in as you move. Given asset sizes in the order they must load and k frames to load them in, split them into at most k groups in order so the largest group is as small as possible, and return that largest group. Loading too much in one frame is a visible hitch. Use binary search on the answer: for a cap, pack assets into frames greedily and count frames. If the count fits in k, try a smaller cap, otherwise a bigger one.
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 Entity Quantile Rig, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles