Skip to content

Practice Maximize Subarray Sum After Removing All Occurrences of One Element

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#3410
LeetCode Problem

Maximize Subarray Sum After Removing All Occurrences of One Element

Problem Statement

Given nums, you may choose a value x and remove all its occurrences once, provided the resulting array is nonempty. You may also leave the array unchanged. Return the greatest nonempty contiguous-subarray sum achievable in any resulting array.

Source: Maximize Subarray Sum After Removing All Occurrences of One Element on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [-3,2,-2,-1,3,-2,3]
Output
7

# Example 2

Input
nums = [1,2,3,4]
Output
10

Constraints

1 <= nums.length <= 10^5
-10^6 <= nums[i] <= 10^6

Related LeetCode Problems

Practice more problems similar to Maximize Subarray Sum After Removing All Occurrences of One Element.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.