ismaelsadeeq / Data-Structures-Algorithms-Problems

This repository contains Data structures/Algorithms Implementation and problems solved in various programming language with explanation
MIT License
35 stars 20 forks source link

Solve the knapsack problem #67

Open ismaelsadeeq opened 1 year ago

ismaelsadeeq commented 1 year ago

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.