← Questions
Minimum eating rate to finish in time
0
I was asked this
No reports yet. Sign in to say where you were asked it.
You have piles of work (in the classic version, piles of bananas) and h hours. Each hour you process up to k units from a single pile. Find the smallest whole-number rate k that finishes every pile within h hours. The hours needed only go down as k goes up, so binary search on k.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding