Leetcode 3684. Maximize Sum of At Most K Distinct Elements

Select up to k distinct numbers from nums to maximize their sum — equivalently, pick the largest unique values. Return those chosen values sorted in strictly descending order (up to k unique top elements).

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 3684. Maximize Sum of At Most K Distinct Elements

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact