Leetcode 2548. Maximum Price to Fill a Bag
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.