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

Slightly modified Knapsack problem. #109

Open
bdyutish opened this issue Sep 30, 2020 · 1 comment
Open

Slightly modified Knapsack problem. #109

bdyutish opened this issue Sep 30, 2020 · 1 comment
Labels
algorithms datastructures DSA good first issue Good for newcomers hacktoberfest hacktoberfest2020 hactoberfest

Comments

@bdyutish
Copy link

You have to choose some of the N items. Your knapsack has a capacity of W which means that the sum of the weights of items taken must be at most W. Item i has a weight of Wi and a value of Vi. Find the maximum possible sum of the values of items that you can home.
The twist here being that the constraints for W is 1<=W<=1e9. 1<=Vi<=1e3.

Found this to be a very interesting variation of the popular knapsack problem and would love to contribute under hacktoberfest. Can this be assigned to me?

P.S : Code in Python.
@Tejoooo
Copy link

Tejoooo commented Oct 12, 2023

@bdyutish can u assign me this issue i am interested to solve this

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
algorithms datastructures DSA good first issue Good for newcomers hacktoberfest hacktoberfest2020 hactoberfest
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@bdyutish @akshitagupta15june @Tejoooo