Available question text
Given item types each with a weight and a price, determine the maximum total price you can achieve by choosing nonnegative quantities of the types to exactly fill a bag of given capacity (or report impossibility). This is an unbounded knapsack / coin-change style optimization balancing weight constraints and value.
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 2548. Maximum Price to Fill a Bag
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source