Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2195. Append K Integers With Minimal Sum
Pick k distinct positive integers not in nums so their sum is minimized — equivalently, find and sum the k smallest positive integers missing from nums. Because nums and k can be large, the typical approach identifies gaps in the sorted unique nums and uses arithmetic-range sums to accumulate the k smallest missing values efficiently.
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.