Added DP problems #204
Merged
Added DP problems #204
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
| int ugly[500]; | ||
| ugly[0] = 1; | ||
| for (int i = 1; i < 500; ++i) { | ||
| ugly[i] = min(ugly[i2]*2, min(ugly[i3]*3, ugly[i5]*5)); |
|
added comments |
prateekiiest
approved these changes
Dec 14, 2017
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.
Thank you for your contribution. Please provide the details requested below.
ISSUE NUMBER
#117
SHORT DESCRIPTION
I added 4 DP problems
Rod Cutting Problem
Min Cost Path between vertices
Subset Sum
Ugly Numbers
I also added detailed explanation for the problem at hand and their algorithmic solutions.
TESTING
I added test case examples in the Readme files. Input prompts are added to avoid ambiguity.