Binary Search/Capacity to Ship Packages Within D DaysMedium

This practice workspace is built for desktop. Open it on a larger screen to start solving.

Capacity to Ship Packages Within D Days

Binary Search·Medium

A conveyor belt has packages that must be shipped from one port to another within days days.

The i-th package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages in the order given by weights. We may not load more weight than the maximum weight capacity of the ship.

Return the least weight capacity of the ship that will result in all the packages on the conveyor belt being shipped within days days.

Examples

Input: weights = [1,2,3,4,5,6,7,8,9,10], days = 5

Output: 15

A ship capacity of 15 ships all packages in 5 days: [1,2,3,4,5],[6,7],[8],[9],[10].

Input: weights = [3,2,2,4,1,4], days = 3

Output: 6

A ship capacity of 6 ships all packages in 3 days: [3,2],[2,4],[1,4].

Input: weights = [1,2,3,1,1], days = 4

Output: 3

Ship capacity of 3: [1,2],[3],[1,1],[]. Wait — [1,2],[3],[1],[1] is 4 days.

Constraints

1 <= days <= weights.length <= 5 * 10^4
1 <= weights[i] <= 500

00:00Preview Mode (Read Only)

Loading editor…

Tests

Preview Mode

This is a read-only preview of DSAMind's AI coaching. Sign up to get custom feedback on your own solution.

Passed32 ms

First attempt — retry to track metric movement here.

Your approach

Pattern:Binary Search
Time:O(N)
Space:O(1)

Complete approach — pattern and complexity both named.

Coach

What you got right

You correctly matched the sorted input requirement and implemented a linear-time scan using two pointers.

Where it diverged

No divergence detected. The code correctly aligns with the stated approach.

Next attempt: focus on

Try solving related sliding window problems to build familiarity with two-pointer variants.

Signals

No signals fired — clean run, you stayed in flow.