Available question text
Given counts of items worth 1, 0, and -1, pick exactly k items to maximize the total sum — effectively take as many 1s as possible, then zeros, and only use -1s if k exceeds ones+zeros, and return the resulting sum.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Choose K Elements With Maximum Sum
Coding
- Difference Between Maximum and Minimum Price Sum
Coding
- Find the Maximum Sum of Node Values
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2600. K Items With the Maximum Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source