5 Simple Steps for Solving Dynamic Programming Problems
In this video, we go over five steps that you can use as a framework to solve dynamic programming problems. You will see how these steps are applied to two specific dynamic programming problems: the longest increasing subsequence problem and optimal box stacking. The five steps in order are as follows:
1. Visualize examples
2. Find an appropriate subproblem
3. Find relationships among subproblems
4. Generalize the relationship
5. Implement by solving subproblems in order
After taking an in depth look at these problems, at the end of the video we will also have a discussion about common subproblems that you may encounter while solving dynamic programming problems.
Error correction: for the box problem, using dictionary solutions only works if we are given unique boxes -- using a list of subproblems would be a better way to solve it if we wanted to handle duplicate boxes (similar to how we did the longest increasing subsequence).
Support: / reducible
This video wouldn't be possible without the open source manim library created by 3blue1brown: https://github.com/3b1b/manim
Here is link to the repository that contains the code used to generate the animations in this video: https://github.com/nipunramk/Reducible
Music:
Prelude No. 2 by Chris Zabriskie is licensed under a Creative Commons Attribution license (https://creativecommons.org/licenses/...)
Source: http://chriszabriskie.com/preludes/
Artist: http://chriszabriskie.com/
All other music by Aakash Gandhi
On this page of the site you can watch the video online 5 Simple Steps for Solving Dynamic Programming Problems with a duration of hours minute second in good quality, which was uploaded by the user Reducible 16 August 2020, share the link with friends and acquaintances, this video has already been watched 1,076,346 times on youtube and it was liked by 30 thousand viewers. Enjoy your viewing!
