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

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1695. Maximum Erasure Value

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact