**THE PROBLEM STATEMENT**

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

The i-th package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (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 D days.

### Example 1

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

**Output:**15

**Explanation:**

A ship capacity of 15 is the minimum to ship all the packages in 5 days like this:

1st day: 1, 2, 3, 4, 5

2nd day: 6, 7

3rd day: 8

4th day: 9

5th day: 10

Note that the cargo must be shipped in the order given, so using a ship of capacity 14 and splitting the packages into parts like (2, 3, 4, 5), (1, 6, 7), (8), (9), (10) is not allowed.

### Example 2

**Input:**weights = [3,2,2,4,1,4], D = 3

**Output:**6

**Explanation:**

A ship capacity of 6 is the minimum to ship all the packages in 3 days like this:

1st day: 3, 2

2nd day: 2, 4

3rd day: 1, 4

### Example 3

**Input:**weights = [1,2,3,1,1], D = 4

**Output:**3

**Explanation:**

1st day: 1

2nd day: 2

3rd day: 3

4th day: 1, 1

**Note:-**

1. 1 <= D <= weights.length <= 50000

2. 1 <= weights[i] <= 500

### SOLUTION?

So before you see my solution below I recommend you to try solving it yourself first.

### Scroll Down For Solution…

**SOLUTION**

function leastWeightCapacity(weightsArr, days) { let sum = weightsArr.reduce(function(a, b) { return a + b; }, 0); let leastWeight = Math.round(sum / days); while (true) { let daySum = 0; let shipingDays = 1; let dayHigh = 0; for (let i = 0; i < weightsArr.length; i++) { if (daySum + weightsArr[i] > leastWeight) { daySum = 0; shipingDays++; } daySum += weightsArr[i]; if (daySum > dayHigh) dayHigh = daySum; } if (shipingDays === days) { return dayHigh > leastWeight ? dayHigh : leastWeight; } else if (shipingDays < days) { leastWeight--; } else { leastWeight++; } } } let answer = leastWeightCapacity([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 5); console.log(answer); //15 answer = leastWeightCapacity([3, 2, 2, 4, 1, 4], 3); console.log(answer); //6 answer = leastWeightCapacity([1, 2, 3, 1, 1], 4); console.log(answer); //3 answer = leastWeightCapacity([9, 1, 1, 1, 1], 2); console.log(answer); //9 answer = leastWeightCapacity([9, 1, 1, 1, 1, 50], 3); console.log(answer); //50 answer = leastWeightCapacity([2, 20, 20, 30, 2, 1, 1], 4); console.log(answer); //30

Interesting problem. Nice solution.

When some one searches for his required thing, therefore he/she wishes

to be available that in detail, so that thing is maintained over here.

Do you have a spam problem on this website; I also am a blogger,

and I was curious about your situation; we have created some nice procedures and we are looking to swap strategies with others,

be sure to shoot me an email if interested.

P.S. If you have a minute, would love your feedback on my new website re-design. You can find it by searching for “royal cbd” – no sweat if you can’t.

Keep up the good work!

We stumbled over here coming from a different web page and thought I

might check things out. I like what I see so now i’m following you.

Look forward to exploring your web page repeatedly.