Hard data structure and algorithm practice puzzle.
Given pile sizes and a number of hours, return the slowest eating speed that finishes every pile in time. Each hour you eat from one pile, up to your speed. Binary search the SPEED, from 1 to the biggest pile. For each guess, add up the hours needed (each pile divided by speed, rounded up). If it fits, try slower. If not, go faster.
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 Ticket Sorted Store, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles