@@ -0,0 +1,1274 @@
+package com.fishercoder.solutions;%0A%0A/**%0A * 1186. Maximum Subarray Sum with One Deletion%0A *%0A * Given an array of integers, return the maximum sum for a non-empty subarray (contiguous elements) with at most one element deletion.%0A * 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%0A * left and the sum of the remaining elements is maximum possible.%0A * Note that the subarray needs to be non-empty after deleting one element.%0A *%0A * Example 1:%0A * Input: arr = %5B1,-2,0,3%5D%0A * Output: 4%0A * Explanation: Because we can choose %5B1, -2, 0, 3%5D and drop -2, thus the subarray %5B1, 0, 3%5D becomes the maximum value.%0A *%0A * Example 2:%0A * Input: arr = %5B1,-2,-2,3%5D%0A * Output: 3%0A * Explanation: We just choose %5B3%5D and it's the maximum sum.%0A *%0A * Example 3:%0A * Input: arr = %5B-1,-1,-1,-1%5D%0A * Output: -1%0A * Explanation: The final subarray needs to be non-empty. You can't choose %5B-1%5D and delete -1 from it, then get an empty subarray to make the sum equals to 0.%0A *%0A * Constraints:%0A * 1 %3C= arr.length %3C= 10%5E5%0A * -10%5E4 %3C= arr%5Bi%5D %3C= 10%5E4%0A * */%0Apublic class _1186 %7B%0A    public static class Solution1 %7B%0A        public int maximumSum(int%5B%5D arr) %7B%0A            //TODO: implement it%0A            return -1;%0A        %7D%0A    %7D%0A%7D%0A

add skeleton for 1186