1695. Maximum Erasure Value.cpp

class Solution
{
public:
    int maximumUniqueSubarray(vector<int> &nums)
    {
        unordered_map<int, int> mp;
        int maxValue = 0, sum = 0;
        int i = 0, j = 0, n = nums.size();
        while (j < n)
        {
            sum += nums[j];
            mp[nums[j]]++;
            while (mp[nums[j]] > 1)
            {
                mp[nums[i]]--;
                sum -= nums[i++];
            }
            maxValue = max(sum, maxValue);
            j++;
        }
        return maxValue;
    }
};