Dynamic programming advanced #12
Open
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.
preclass work was doing dynamic programming problems on Leetcode + making sure you're comfortable with the problems from the last class
i think the main issue is that it's still quite hard for me to break the problem down into subproblems.
frog problem 4 ways -
while doing this, I realised that the memo for say, back to front is the same whether it's iterative or recursive. the only difference is how the memo is built. eg: the order in which it is built, the stack calls, etc
same for front to back recursive / iterative. commented that in the code too and printed out the final memos to confirm this.