Maximize Subarray Sum After Removing All Occurrences of One Element - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3410. Maximize Subarray Sum After Removing All Occurrences of One Element
Hard
50 Points
Array
Dynamic Programming
Segment Tree
You are given an integer array nums.
You can do the following operation on the array at most once:
Return the maximum subarray sum across all possible resulting arrays.
Examples
Example 1
Input: nums = [-3,2,-2,-1,3,-2,3]
Output: 7
Explanation:
We can have the following arrays after at most one operation:
The output is max(4, 4, 7, 4, 2) = 7 .
Example 2
Input: nums = [1,2,3,4]
Output: 10
Explanation:
It is optimal to not perform any operations.
Constraints
1 <= nums.length <= 105
-106 <= nums[i] <= 106
3410. Maximize Subarray Sum After Removing All Occurrences of One Element
Hard
50 Points
Array
Dynamic Programming
Segment Tree
You are given an integer array nums.
You can do the following operation on the array at most once:
Return the maximum subarray sum across all possible resulting arrays.
Examples
Example 1
Input: nums = [-3,2,-2,-1,3,-2,3]
Output: 7
Explanation:
We can have the following arrays after at most one operation:
The output is max(4, 4, 7, 4, 2) = 7 .
Example 2
Input: nums = [1,2,3,4]
Output: 10
Explanation:
It is optimal to not perform any operations.