[idea]: Add the 0-1 Knapsack Problem to the DP Problem Set

ajay-dhangar / algo

This repository contains a collection of data structures and algorithms implemented in various programming languages. It is designed to help learners understand key concepts through hands-on examples. Contributions and improvements are welcome!

https://ajay-dhangar.github.io/algo/

MIT License

68 stars 200 forks source link

[idea]: Add the 0-1 Knapsack Problem to the DP Problem Set #1362

Open Aditya-PS-05 opened 2 hours ago

Aditya-PS-05 commented 2 hours ago

Idea Title

Adding 0-1 Knapsack Problem to the DP Problem Set

Idea Description

This issue proposes adding the 0-1 Knapsack problem to the project’s collection of Dynamic Programming (DP) problems. The 0-1 problem is a classic DP problem that helps users practice DP.

Potential Benefits

[X] Improves user experience
[X] Enhances learning
[X] Adds a new feature
[X] Improves code quality
[X] Other

Implementation Suggestions (Optional)

No response

github-actions[bot] commented 2 hours ago

👋 Hi @Aditya-PS-05! Thank you for opening your first issue on the Algo project. We're excited to help you out and appreciate your contribution. Please provide as much detail as possible to assist us in addressing the issue effectively. Welcome aboard! 😊

github-actions[bot] commented 2 hours ago

👋 Hi @Aditya-PS-05! Thanks for opening this issue. We appreciate your contribution to the Algo project. Our team will review it soon.

Aditya-PS-05 commented 2 hours ago

Please assign me this issue.