Add solution #1186

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,171 LeetCode solutions in JavaScript
+# 1,172 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -919,6 +919,7 @@
 1178|[Number of Valid Words for Each Puzzle](./solutions/1178-number-of-valid-words-for-each-puzzle.js)|Hard|
 1184|[Distance Between Bus Stops](./solutions/1184-distance-between-bus-stops.js)|Easy|
 1185|[Day of the Week](./solutions/1185-day-of-the-week.js)|Easy|
+1186|[Maximum Subarray Sum with One Deletion](./solutions/1186-maximum-subarray-sum-with-one-deletion.js)|Medium|
 1189|[Maximum Number of Balloons](./solutions/1189-maximum-number-of-balloons.js)|Easy|
 1200|[Minimum Absolute Difference](./solutions/1200-minimum-absolute-difference.js)|Easy|
 1206|[Design Skiplist](./solutions/1206-design-skiplist.js)|Hard|

solutions/1186-maximum-subarray-sum-with-one-deletion.js

@@ -0,0 +1,31 @@
+/**
+ * 1186. Maximum Subarray Sum with One Deletion
+ * https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion/
+ * Difficulty: Medium
+ *
+ * Given an array of integers, return the maximum sum for a non-empty subarray (contiguous elements)
+ * with at most one element deletion. In other words, you want to choose a subarray and optionally
+ * delete one element from it so that there is still at least one element left and the sum of the
+ * remaining elements is maximum possible.
+ *
+ * Note that the subarray needs to be non-empty after deleting one element.
+ */
+
+/**
+ * @param {number[]} arr
+ * @return {number}
+ */
+var maximumSum = function(arr) {
+  let maxNoDelete = arr[0];
+  let maxOneDelete = 0;
+  let result = arr[0];
+
+  for (let i = 1; i < arr.length; i++) {
+    const prevMaxNoDelete = maxNoDelete;
+    maxNoDelete = Math.max(arr[i], maxNoDelete + arr[i]);
+    maxOneDelete = Math.max(prevMaxNoDelete, maxOneDelete + arr[i]);
+    result = Math.max(result, maxNoDelete, maxOneDelete);
+  }
+
+  return result;
+};