hard20 pts · first answer countsarraysbinary-search
Minimum eating speed by binary search
Piles of bananas are [3, 6, 7, 11] and Koko has 8 hours. Each hour she eats up to k bananas from one pile. What is the smallest k that lets her finish?
Discussion 0
Join free to post in the discussion.
Related questions
- Cost of reading arr[i]Backend Developer
- Inserting at the front of an arrayBackend Developer
- Why push is amortized O(1)Backend Developer
- Changing one character of a stringBackend Developer
- Reversing a simple stringBackend Developer
- slice vs spliceBackend Developer
- Index of the last elementBackend Developer
- indexOf and NaNBackend Developer