@3ms || Java Solution
\tclass Solution {\n\t\tpublic int maximumSum(int[] arr) {\n\t\t\tint n = arr.length;\n\t\t\tint maxWithOneDeletion = 0;\n\t\t\tint maxWithZeroDeletion = arr[0]
\tclass Solution {\n\t\tpublic int maximumSum(int[] arr) {\n\t\t\tint n = arr.length;\n\t\t\tint maxWithOneDeletion = 0;\n\t\t\tint maxWithZeroDeletion = arr[0];\n\t\t\tint max = maxWithZeroDeletion;\n\t\t\tfor(int i=1; i<n; i++) {\n\t\t\t\tmaxWithOneDeletion = Math.max(maxWithZeroDeletion, maxWithOneDeletion + arr[i]);\n\t\t\t\tmaxWithZeroDeletion = Math.max(arr[i], maxWithZeroDeletion + arr[i]);\n\t\t\t\tmax = Math.max(maxWithZeroDeletion, max);\n\t\t\t\tmax = Math.max(maxWithOneDeletion, max);\n\t\t\t}\n\t\t\treturn max;\n\t\t}\n\t}
[]