Practice Maximum Erasure Value
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
You are given an array of positive integers nums and want to erase a subarray containing unique elements. The score you get by erasing the subarray is equal to the sum of its elements. Return the maximum score you can get by erasing exactly one subarray. An array b is called to be a subarray of a if it forms a contiguous subsequence of a, that is, if it is equal to a[l],a[l+1],...,a[r] for some (l,r).
Source: Maximum Erasure Value on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
nums = [4,2,4,5,6]
17
# Example 2
nums = [5,2,1,2,5,2,1,2,5]
8
Constraints
Related LeetCode Problems
Practice more problems similar to Maximum Erasure Value.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.