Leetcode 2813. Maximum Elegance of a K-Length Subsequence

Select exactly k items (each with profit and category) to maximize total_profit + (number_of_distinct_categories)^2, requiring a trade-off between picking highest-profit items (even if same category) and increasing category diversity for a quadratic bonus. The core challenge is combinatorial selection that balances sum maximization with a nonlinear reward for distinct categories.

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 2813. Maximum Elegance of a K-Length Subsequence

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact