[Feature Request]: Add 0-1 Kanpsack problem in Dynamic Programming

[shuvojitss]

Is there an existing issue for this?

• I have searched the existing issues

Feature Description

NAME:

Given N items where each item has some weight and profit associated with it and also given a bag with capacity W, [i.e., the bag can hold at most W weight in it]. The task is to put the items into the bag such that the sum of profits associated with them is the maximum possible.

Input:

The value of N and W along with the coressponding weight and profit of each.

Output:

Maximum Possible Profit.

Record

• I agree to follow this project's Code of Conduct
• I want to work on this issue
• I'm willing to provide further clarification or assistance if needed.

Full Name

Shuvojit Samanta

Participant Role

GSSOC

[github-actions]

🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.

Feel free to join our community on Discord to discuss more!