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.

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

[FEATURE] Unbounded Knapsack in Dynamic Programming Section #2782

Closed
yeolesanskruti opened this issue Oct 7, 2024 · 1 comment · Fixed by #2786
Closed

[FEATURE] Unbounded Knapsack in Dynamic Programming Section #2782

yeolesanskruti opened this issue Oct 7, 2024 · 1 comment · Fixed by #2786
Labels
enhancement New feature or request hacktoberfest

Comments

@yeolesanskruti
Copy link
Contributor

Detailed description

I want to add the algorithm of "Unbounded Knapsack" in dp section.

Context

This covers the infinite supply of objects which is important and different from Knapsack problem.

Possible implementation

No response

Additional information

I am Contributor of Hactoberfest 2024.
Please assign me.

@yeolesanskruti yeolesanskruti added the enhancement New feature or request label Oct 7, 2024
@realstealthninja
Copy link
Collaborator

just create a pr and link it to this pull request

@realstealthninja realstealthninja linked a pull request Oct 7, 2024 that will close this issue
8 tasks
Pranjal-231003 pushed a commit to Pranjal-231003/C-Plus-Plus that referenced this issue Oct 24, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request hacktoberfest
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants