Leetcode 1695. Maximum Erasure Value - two-pointer sliding window method

A Python solution using two-pointer sliding window. The main idea is routine: for each index i, find the longest subarray ending at index i and with unique elements. To check the uniqueness of elements, we refer to the set data structure. As the problem requires to return the sum/score of the corresponding subarray, we use a partial sum variable to track the running sum of these potential subarrays.

Some similar/relevant problems:

Leetcode 1234 Replace the Substring for Balanced String

Leetcode 76 Minimum Window Substring - two-pointer sliding window method

Leetcode Problem 560

Leetcode Problem 523

Leetcode Problem 525

Leetcode 1839

Leetcode 1498 Number of Subsequences That Satisfy the Sum Condition