Leetcode 3487. Maximum Unique Subarray Sum After Deletion

Select a non-empty subsequence (you may delete any elements first) whose values are all distinct and maximize its sum — equivalently, pick at most one occurrence of each number (preserving order) to maximize the total.

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 3487. Maximum Unique Subarray Sum After Deletion

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact