Practice Maximum Unique Subarray Sum After Deletion
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given nums, you may delete any number of elements while keeping the array nonempty. From the remaining array, choose a nonempty contiguous subarray with no repeated value. Return the maximum sum obtainable for such a subarray.
Source: Maximum Unique Subarray Sum After Deletion on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,2,3,4,5]
Output
15
# Example 2
Input
nums = [1,1,0,1,1]
Output
1
# Example 3
Input
nums = [1,2,-1,-2,1,0,-1]
Output
3
Constraints
1 <= nums.length <= 100
-100 <= nums[i] <= 100
Related LeetCode Problems
Practice more problems similar to Maximum Unique Subarray Sum After Deletion.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.