Minimum eating rate to finish in time
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.
AppleTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.