Add solution #2105

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,748 LeetCode solutions in JavaScript
+# 1,749 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1612,6 +1612,7 @@
 2101|[Detonate the Maximum Bombs](./solutions/2101-detonate-the-maximum-bombs.js)|Medium|
 2103|[Rings and Rods](./solutions/2103-rings-and-rods.js)|Easy|
 2104|[Sum of Subarray Ranges](./solutions/2104-sum-of-subarray-ranges.js)|Medium|
+2105|[Watering Plants II](./solutions/2105-watering-plants-ii.js)|Medium|
 2114|[Maximum Number of Words Found in Sentences](./solutions/2114-maximum-number-of-words-found-in-sentences.js)|Easy|
 2115|[Find All Possible Recipes from Given Supplies](./solutions/2115-find-all-possible-recipes-from-given-supplies.js)|Medium|
 2116|[Check if a Parentheses String Can Be Valid](./solutions/2116-check-if-a-parentheses-string-can-be-valid.js)|Medium|

solutions/2105-watering-plants-ii.js

@@ -0,0 +1,61 @@
+/**
+ * 2105. Watering Plants II
+ * https://leetcode.com/problems/watering-plants-ii/
+ * Difficulty: Medium
+ *
+ * Alice and Bob want to water n plants in their garden. The plants are arranged in a row and are
+ * labeled from 0 to n - 1 from left to right where the ith plant is located at x = i.
+ *
+ * Each plant needs a specific amount of water. Alice and Bob have a watering can each, initially
+ * full. They water the plants in the following way:
+ * - Alice waters the plants in order from left to right, starting from the 0th plant. Bob waters
+ *   the plants in order from right to left, starting from the (n - 1)th plant. They begin watering
+ *   the plants simultaneously.
+ * - It takes the same amount of time to water each plant regardless of how much water it needs.
+ * - Alice/Bob must water the plant if they have enough in their can to fully water it. Otherwise,
+ *   they first refill their can (instantaneously) then water the plant.
+ * - In case both Alice and Bob reach the same plant, the one with more water currently in his/her
+ *   watering can should water this plant. If they have the same amount of water, then Alice should
+ *   water this plant.
+ *
+ * Given a 0-indexed integer array plants of n integers, where plants[i] is the amount of water the
+ * ith plant needs, and two integers capacityA and capacityB representing the capacities of Alice's
+ * and Bob's watering cans respectively, return the number of times they have to refill to water all
+ * the plants.
+ */
+
+/**
+ * @param {number[]} plants
+ * @param {number} capacityA
+ * @param {number} capacityB
+ * @return {number}
+ */
+var minimumRefill = function(plants, capacityA, capacityB) {
+  let result = 0;
+  let left = 0;
+  let right = plants.length - 1;
+  let waterA = capacityA;
+  let waterB = capacityB;
+
+  while (left <= right) {
+    if (left === right) {
+      if (waterA >= waterB && waterA < plants[left]) result++;
+      if (waterB > waterA && waterB < plants[right]) result++;
+      break;
+    }
+
+    if (waterA < plants[left]) {
+      waterA = capacityA;
+      result++;
+    }
+    waterA -= plants[left++];
+
+    if (waterB < plants[right]) {
+      waterB = capacityB;
+      result++;
+    }
+    waterB -= plants[right--];
+  }
+
+  return result;
+};