[C++ Dynamic Programming Enhancement] Add multiple knapsack & brute force/memo solutions #1654
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This Pull Request enhances the dynamic programming section of the C++ code in the “hello algo” project by adding new examples and approaches:
Unbounded Knapsack (Complete Knapsack)
Added brute force (recursive) solution and memoized solution to show top-down approaches alongside the existing bottom-up DP.
Multiple Knapsack Problem
Introduced a new complete code example for the multiple knapsack problem, illustrating how it differs from the 0/1 and unbounded knapsack problems.
Coin Change Problem
Added brute force and memoized (top-down) solutions, so readers can compare different strategies (recursive vs. DP) for the same problem.