Learn Dynamic Programming #2 - Topic Stream

🚀 What will be covered in this livestream:

0:00 Intro
3:16 1741E - Updating DP's in two directions
23:56 1096D - Keeping our states for matching subsequences
53:41 463D - Importance of ordering in updating DP
1:18:24 264C - Keeping max values to optimize DP
1:44:14 570E - Memory optimization and moving in two directions

For questions or further discussion, contact me via my Telegram channel:

#coding #codeforces #programming #competitive_programming #learn_programming #learn_coding #code_tutorial #computer_science #computer_tutorial #dynamic_programming #learn_programming_online

[bubblesort]

Such a great stream. Please keep up the good work.

[mohdalizilani]

after dp streams do streams of segement tree with all patterns

[MithleshKumar-etpx]

you are a good teacher, greate videos

[vbbmgve]

why in second problem when s[i] = 'h' then dp[i][1] = min(dp[i-1][1], dp[i-1][0])/ i think that dp[i-1][1] < dp[i-1][0] because [1] we not delete and so we dont get point, but in dp[i-1][0] we delete 'h' so we get some poits for it and so should be true this dp[i-1][1] < dp[i-1][0] . where the problem

[ronakkriplani]

One request, In every video please dry run at least one test case.

[arnavgoel]

in the 4th problem if I am changing the order of taking max dp[c[i]], i am getting a different answer, any thoughts on that?