Leetcode 1695. Maximum Erasure Value

Find the maximum sum of any contiguous subarray that contains only unique elements. This reduces to a sliding-window / two-pointer problem maintaining a seen-set and running sum to compute the maximum in O(n) time (n up to 1e5).