In these few set of videos, we have discussed the art of the state creation i.e. dynamic programming.
In this video we saw how to divide a dynamic programming problem into 3 different sub-problems.
1. Defining the states of the DP
2. Laying down the recurrence relation
3. Laying down the correct topological order to solve the states in.
Dynamic programming is considered one of the hardest programming paradigms to master. Thus in this video we have discussed a systematic way to approach a DP problem.
#programming #coding #competitiveprogramming #datastructure
Follow us on Instagram
/ codebrownie
On this page of the site you can watch the video online Approaching a dynamic programming problem - part 1 with a duration of hours minute second in good quality, which was uploaded by the user Code Brownie 04 April 2021, share the link with friends and acquaintances, this video has already been watched 133 times on youtube and it was liked by 7 viewers. Enjoy your viewing!