Add solution #3511

JoshCrozier · JoshCrozier · commit 1c8473f68beb · 2025-07-24T23:51:59.000-05:00
diff --git a/README.md b/README.md
@@ -2713,6 +2713,7 @@
 3491|[Phone Number Prefix](./solutions/3491-phone-number-prefix.js)|Easy|
 3496|[Maximize Score After Pair Deletions](./solutions/3496-maximize-score-after-pair-deletions.js)|Medium|
 3506|[Find Time Required to Eliminate Bacterial Strains](./solutions/3506-find-time-required-to-eliminate-bacterial-strains.js)|Hard|
+3511|[Make a Positive Array](./solutions/3511-make-a-positive-array.js)|Medium|
 
 ## License
 
diff --git a/solutions/3511-make-a-positive-array.js b/solutions/3511-make-a-positive-array.js
@@ -0,0 +1,35 @@
+/**
+ * 3511. Make a Positive Array
+ * https://leetcode.com/problems/make-a-positive-array/
+ * Difficulty: Medium
+ *
+ * You are given an array nums. An array is considered positive if the sum of all numbers in
+ * each subarray with more than two elements is positive.
+ *
+ * You can perform the following operation any number of times:
+ * - Replace one element in nums with any integer between -1018 and 1018.
+ *
+ * Find the minimum number of operations needed to make nums positive.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var makeArrayPositive = function(nums) {
+  let result = 0;
+  let lowestSum = nums[0] + nums[1];
+
+  for (let i = 2; i < nums.length; i++) {
+    const currentValue = nums[i];
+    const currentTriplet = currentValue + nums[i - 1] + nums[i - 2];
+    lowestSum = Math.min(lowestSum + currentValue, currentTriplet);
+
+    if (lowestSum <= 0) {
+      nums[i] = lowestSum = 10 ** 18;
+      result++;
+    }
+  }
+
+  return result;
+};
