medium10 pts · first answer countssorting-and-searching
Slowest speed to finish within H hours
Piles of bananas are [3, 6, 7, 11]. Eating at speed k per hour, each pile takes ceil(pile / k) hours, one pile at a time. What is the smallest k that finishes all piles within 8 hours?
Discussion 0
Join free to post in the discussion.
Related questions
- Bubble sort best case with early exitBackend Developer
- What a stable sort meansBackend Developer
- Merge sort time in every caseBackend Developer
- Best simple sort for nearly sorted dataBackend Developer
- Swaps made by selection sortBackend Developer
- What in-place sorting meansBackend Developer
- Quick sort worst-case timeBackend Developer
- JavaScript default sort on numbersBackend Developer