Add solution #1011

Author: JoshCrozier

Diff for: README.md

@@ -1,4 +1,4 @@
-# 1,085 LeetCode solutions in JavaScript
+# 1,086 LeetCode solutions in JavaScript
 
 [https://leetcode.com/](https://leetcode.com/)
 
@@ -819,6 +819,7 @@
 1008|[Construct Binary Search Tree from Preorder Traversal](./solutions/1008-construct-binary-search-tree-from-preorder-traversal.js)|Medium|
 1009|[Complement of Base 10 Integer](./solutions/1009-complement-of-base-10-integer.js)|Easy|
 1010|[Pairs of Songs With Total Durations Divisible by 60](./solutions/1010-pairs-of-songs-with-total-durations-divisible-by-60.js)|Medium|
+1011|[Capacity To Ship Packages Within D Days](./solutions/1011-capacity-to-ship-packages-within-d-days.js)|Medium|
 1022|[Sum of Root To Leaf Binary Numbers](./solutions/1022-sum-of-root-to-leaf-binary-numbers.js)|Easy|
 1023|[Camelcase Matching](./solutions/1023-camelcase-matching.js)|Medium|
 1028|[Recover a Tree From Preorder Traversal](./solutions/1028-recover-a-tree-from-preorder-traversal.js)|Hard|

Diff for: solutions/1011-capacity-to-ship-packages-within-d-days.js

@@ -0,0 +1,47 @@
+/**
+ * 1011. Capacity To Ship Packages Within D Days
+ * https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/
+ * Difficulty: Medium
+ *
+ * A conveyor belt has packages that must be shipped from one port to another within days days.
+ *
+ * The ith 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 days days.
+ */
+
+/**
+ * @param {number[]} weights
+ * @param {number} days
+ * @return {number}
+ */
+var shipWithinDays = function(weights, days) {
+  let left = Math.max(...weights);
+  let right = weights.reduce((sum, weight) => sum + weight, 0);
+
+  while (left < right) {
+    const mid = Math.floor((left + right) / 2);
+    let currentDays = 1;
+    let currentWeight = 0;
+
+    for (const weight of weights) {
+      if (currentWeight + weight > mid) {
+        currentDays++;
+        currentWeight = weight;
+      } else {
+        currentWeight += weight;
+      }
+    }
+
+    if (currentDays > days) {
+      left = mid + 1;
+    } else {
+      right = mid;
+    }
+  }
+
+  return left;
+};