Data-Structures-Algorithms-Problems icon indicating copy to clipboard operation
Data-Structures-Algorithms-Problems copied to clipboard

Solve the knapsack problem

Open ismaelsadeeq opened this issue 2 years ago • 0 comments

You are presented with a set of N items, each with its own weight and profit. Additionally, you have a bag with a limited capacity of W, meaning it can only hold items with a total weight not exceeding W. The objective is to strategically select items to place in the bag in order to maximize the total profit derived from those items.

Hint: understand Knapsack problem Follow contributing guidelines in a proposed PR.

ismaelsadeeq avatar Oct 23 '23 17:10 ismaelsadeeq