Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Knapsack problem #132

Open
Pallavi-Shtgr opened this issue Oct 21, 2024 · 1 comment
Open

Knapsack problem #132

Pallavi-Shtgr opened this issue Oct 21, 2024 · 1 comment
Assignees
@Pallavi-Shtgr
Labels
hacktoberfest-accepted Hacktoberfest

Comments

@Pallavi-Shtgr
Copy link
Contributor

The Knapsack Problem is a well-known optimization problem. The problem is simple: given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit, and the total value is maximized.
@Pallavi-Shtgr
Copy link
Contributor Author

0/1 Knapsack probelm #133 , accept my new pulll request

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@Pallavi-Shtgr Pallavi-Shtgr

Labels
hacktoberfest-accepted Hacktoberfest
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@Pallavi-Shtgr @Pradeepsingh61