Websites
You may want to eat your Wheaties, or some fish, or whatever food is supposed to make your brain extra sharp before checking out the Bellman Equation. It's a big one.
Here's a friendly little solution to a classic dynamic programming problem. You might notice that it also works for figuring out how many chess moves you need to make before you reach a particular state on the board. If you've got a dynamic programming quiz coming up, then this is a great refresher. It's not going to help you much for your Biology quiz though.
Practice makes perfect (except when it doesn't), so practice away. Here's a list from Clemson University to help you practice dynamic programming.
Everyone likes games, and games like game theory, and game theory likes dynamic programming, which makes all those games possible.
Why should you care what teaching assistants recommend? Because they know more than you, or at least know someone who knows more than you. Just be quiet and read the post.
Do you have questions about dynamic programming? Great, so do interviewers. Get prepped for your tech interview with these questions.
Way back in the day, when people were just figuring out how to use Bellman's optimization theory for computer science, Kevin Brown wrote a paper about it from Carnegie Mellon University. (We know you're thinking: that school has nothing to do with melons. It's not even spelled the same, which we should've noticed before we called them to ask about growing the best watermelon.)
Video
If you thought your solution was good, just check out this 20-minute video using the Bellman equation to do it.
Check out MIT's 54-minute video lecture on this stuff. That sounds boring, but it's really not, unless you're expecting something more exciting.