Approach Summary
Binary search on capacity [max(weights), sum(weights)]. Feasibility: simulate days needed greedily with given capacity.
How to Recognize This Pattern
- "Minimum capacity to finish in D days"
- Classic binary-search-on-answer pattern
Complexity Analysis
Time Complexity
O(n log(sum))
Space Complexity
O(1)
Tags
Array Binary Search