Unbounded Knapsack (Dynamic Programming)

[shahzaibahmad3]

Given Input : an array of weights wt[], an array of values val[] containing weights and values for each item and a Weight W of Knapsack.
Output : Maximise the profit.
here we are allowed to use unlimited number of instances of an item unlike 0-1 Knapsack problem.

Test Case:
input- wt={1,2,3,4}
val={25,35,10,25}, W=8
Output- 200

[rangira]

Can I take this

[sanguvk123]

can i do this?

[stale]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[stale]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!