Lecture for Dynamic Programming

krishnayadav9 · September 25, 2019, 9:47pm

Hey, Everyone, I am new in CP. I want to learn Dynamic Programming. I am zero in Dynamic Programming. and I watched some videos related to Dynamic Programming. But I am unable to get. so Where can I start Dynamic Programming? I am zero so suggest me some good website to learn and practice. Thank you

shinjan · September 26, 2019, 12:34am

Bro You solved problems like GDSUB LAPD(of this sept long challenge ) using DP i have read your solutions are you sure you don’t know DP .Nice solutions though
I’m also new to DP you can checkout this article Topcoder

s5960r · September 26, 2019, 2:38am

Go to YouTube, it has many playlists on DP

Some of the channels having DP videos are

Back to Back SWE
Tushar Roy
CodingBlocks
Gaurav Sen
Rachit Jain

I’ll add more as i discover because I’m also learning DP😂

krishnayadav9 · September 26, 2019, 4:49am

GDSUB is very basic problem. LAPD is not based on DP.

anon55659401 · September 26, 2019, 6:06am

Dp is all about thinking and imagining. Also, the more tricks you know, the better it gets.

To improve the above things, first study all classical dp concepts, then go to cf problemset and solve as many dp problems as possible.

kshitij_789 · September 26, 2019, 7:19am

from where to learn dp optimizations?

markj · September 26, 2019, 10:22am

Try youtube…

istillovebravp · September 26, 2019, 11:25am

I found this useful DP Tutorial and Problem List - Codeforces

i_64 · September 26, 2019, 11:29am

MITOpenCourseware YouTube playlist on DP: Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths - YouTube

Watch the lectures delivered by the long hair guy, they’re great.

betuyash · September 26, 2019, 12:47pm

Hope it Helps !

invincibel · September 26, 2019, 12:53pm

this is a good one as well…

i_64 · October 20, 2019, 2:59am

Forgot to mention the “educational DP contest” on atcoder.jp
Those problems are designed in such a way that one who solves them gets an intuitive understanding about DP. You get TLE for recursive Memoization, it forces you to think about how the recursion DAG will be and which old solution is reused where, and make you write bottom-up to get an AC

sanchit2812 · October 20, 2019, 3:46am

devshiv · October 20, 2019, 4:08am

yeah, 5 star and learning dp ,nice!

s5960r · October 20, 2019, 4:22am

The learning process continues until the day you die.

-Kirk Douglas

sorb1997 · October 20, 2019, 6:36am

Codeforces has a blog on it. CP algorithms has articles on Divide and Conquer Optimisation and Convex Hull Trick. SPOJ has nice problems for practice, one such that I remember is ADAMOLD, can be solved using Divide and Conquer Optimisation and Knuth Optimisation.

sorb1997 · October 20, 2019, 6:38am

There are things within DP that you may not have known even after being a 5*. Not so wice comment.

nikhil_chhipa · August 18, 2020, 5:55pm

Aaditya verma best on youtube.