Maximum erasure value

Array Hash Table Sliding Window

64.1% acceptance

Feb 25, 2026

3396

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).

Solution

Rust

Time O(n²)

Space O(n)

LeetCode

solution.rs

impl Solution {
  pub fn maximum_unique_subarray(nums: Vec<i32>) -> i32 {
    use std::collections::HashSet;
    let mut set: HashSet<i32> = HashSet::new();
    let mut left = 0usize;
    let mut current_sum = 0i32;
    let mut max_sum = 0i32;
    for right in 0..nums.len() {
      while set.contains(&nums[right]) {
        set.remove(&nums[left]);
        current_sum -= nums[left];
        left += 1;
      }
      set.insert(nums[right]);
      current_sum += nums[right];
      if current_sum > max_sum {
        max_sum = current_sum;
      }
    }
    max_sum
  }
}