Available question text
Pick up to k elements from an n×m matrix to maximize their total value, with the extra constraint that you may take at most limits[i] elements from row i. The core algorithmic pattern is converting each row into choices of taking t top elements (prefix sums) and solving a multiple-choice/0-1 knapsack over capacity k to combine rows optimally.
Related questions
Continue with questions that share topics or the same question type.
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 3462. Maximum Sum With at Most K Elements
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source