Add solution #881

Author: JoshCrozier

README.md

@@ -691,6 +691,7 @@
 878|[Nth Magical Number](./0878-nth-magical-number.js)|Hard|
 879|[Profitable Schemes](./0879-profitable-schemes.js)|Hard|
 880|[Decoded String at Index](./0880-decoded-string-at-index.js)|Medium|
+881|[Boats to Save People](./0881-boats-to-save-people.js)|Medium|
 884|[Uncommon Words from Two Sentences](./0884-uncommon-words-from-two-sentences.js)|Easy|
 889|[Construct Binary Tree from Preorder and Postorder Traversal](./0889-construct-binary-tree-from-preorder-and-postorder-traversal.js)|Medium|
 890|[Find and Replace Pattern](./0890-find-and-replace-pattern.js)|Medium|

solutions/0881-boats-to-save-people.js

@@ -0,0 +1,36 @@
+/**
+ * 881. Boats to Save People
+ * https://leetcode.com/problems/boats-to-save-people/
+ * Difficulty: Medium
+ *
+ * You are given an array people where people[i] is the weight of the ith person, and an infinite
+ * number of boats where each boat can carry a maximum weight of limit. Each boat carries at
+ * most two people at the same time, provided the sum of the weight of those people is at most
+ * limit.
+ *
+ * Return the minimum number of boats to carry every given person.
+ */
+
+/**
+ * @param {number[]} people
+ * @param {number} limit
+ * @return {number}
+ */
+var numRescueBoats = function(people, limit) {
+  people.sort((a, b) => a - b);
+  let boats = 0;
+  let left = 0;
+  let right = people.length - 1;
+
+  while (left <= right) {
+    if (left < right && people[left] + people[right] <= limit) {
+      left++;
+      right--;
+    } else {
+      right--;
+    }
+    boats++;
+  }
+
+  return boats;
+};