Koko Eating Bananas

You get an array of integers piles and an integer h. Pile i holds piles[i] bananas. Koko has h hours to eat all n piles.

Return the slowest whole-number speed k at which she finishes every pile within h hours.

At speed k, she eats up to k bananas each hour, from a single pile. If that pile has fewer left, she finishes it and waits for the next hour. So a pile of p bananas takes p / k hours, rounded up.

Example 1:

Input: piles = [5,9,2], h = 6
Output: 3
Explanation: At speed 3 the piles take 2 + 3 + 1 = 6 hours, just enough.
At speed 2 they would take 3 + 5 + 1 = 9 hours.

Example 2:

Input: piles = [8,15,4], h = 3
Output: 15
Explanation: 3 piles in 3 hours means one hour per pile.
The biggest pile has 15 bananas, so the speed must be 15.

Example 3:

Input: piles = [12], h = 5
Output: 3
Explanation: At speed 3 the only pile takes 4 hours, within the 5.
At speed 2 it would take 6.

Constraints:

• 1 to 10,000 piles.
• Each pile has 1 to 10⁹ bananas.
• h is at least the number of piles and at most 10⁹.