👽

swolecoder · swolecoder · commit ed16c5677eb2 · 2021-01-14T12:19:36.000-05:00
diff --git a/Day93/index.js b/Day93/index.js
@@ -0,0 +1,41 @@
+/**
+ * @param {number[]} nums
+ * @param {number} x
+ * @return {number}
+ */
+var minOperations = function (n, x) {
+
+    let map = {};
+
+    let sum = 0;
+
+    for (let i = 0; i < n.length; i++) {
+        sum += n[i];
+
+        map[sum] = i + 1
+    }
+
+    sum = 0;
+
+    let res = Infinity;
+    if (map[x] != undefined) res = map[x]
+
+
+    for (let i = n.length - 1; i >= 0; i--) {
+
+        sum += n[i];
+        // sum + y === x
+        let y = x - sum;
+
+        if (y == 0) {
+            res = Math.min(res, n.length - i)
+        } else {
+
+            if (map[y] !== undefined && map[y] < i) {
+                res = Math.min(res, map[y] + n.length - i)
+            }
+        }
+
+    }
+    return res == Infinity ? -1 : res;
+};
diff --git a/README.md b/README.md
@@ -204,4 +204,7 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
 
 |Day 91| [1296. Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/) | [javascript]()|[:memo:](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)|Medium|
 
-|Day 92| [881. Boats to Save People](https://leetcode.com/problems/boats-to-save-people/) | [javascript]()|[:memo:](https://leetcode.com/problems/boats-to-save-people/)|Medium|
+|Day 92| [881. Boats to Save People](https://leetcode.com/problems/boats-to-save-people/) | [javascript]()|[:memo:](https://leetcode.com/problems/boats-to-save-people/)|Medium|
+
+
+|Day 93| [1658. Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/) | [javascript]()|[:memo:](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/)|Medium|
