Search
⌘K
Get Premium
Leetcode 2829. Determine the Minimum Sum of a k-avoiding Array
Choose n distinct positive integers with no two summing to k and minimize their total; the core challenge is to construct the smallest possible set while never including both x and k−x (solvable by a simple greedy selection).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.