Hard data structure and algorithm practice puzzle.
Given parcel weights in order and a number of days, return the smallest ship capacity that ships everything in time. Binary search the capacity, between the heaviest parcel and the total weight. For each guess, load parcels in order and start a new day when the next one won't fit. If it takes too many days, go bigger. Otherwise, try smaller.
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 Ordered Index, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles