Unbounded Knapsack using Dynamic Programming and add Rod Cutting Problem and Coin Change Problem as it's two important variations

Question

Unbounded Knapsack using Dynamic Programming and add Rod Cutting Problem and Coin Change Problem as it's two important variations

bhavinjawade opened this issue 4 years ago · 4 comments

I would love to add the famous problem of Unbounded Knapsack using Dynamic Programming and add Rod Cutting Problem and Coin Change Problem as it's two important variations. If you would kindly assign me to the issue.

@Ishita-0112, Sounds good. Let me create an issue for this and assign it you. Please reply to the following issue.

Originally posted by @bhavinjawade in #8 (comment)

Answer 1 · 2020-09-30T18:19:30.000Z

Will start working on it immediately. Kindly assign the issue. Thank you.
Looking forward to contribute more.

Answer 2 · 2020-09-30T18:20:15.000Z

Great. Assigned it to you.

Answer 3 · 2020-09-30T18:25:26.000Z

Great. Assigned it to you.

Thank you.

Answer 4 · 2020-10-15T14:46:14.000Z

I have added the 2 python codes. Kindly check. Thank you.