Skip to content

Solve the knapsack problem #67

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ismaelsadeeq opened this issue Oct 23, 2023 · 0 comments
Open

Solve the knapsack problem #67

ismaelsadeeq opened this issue Oct 23, 2023 · 0 comments

Comments

@ismaelsadeeq
Copy link
Owner

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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant