Dynamic Programming Course : basics to Digit DP (27 July 2020 : 2 editorial added)

tutorial
,
13

are there going to be live lectures or just explanatory videos

14

for me live lecture is a bit difficult #NoWifiConnection.
soon after having a wifi connection may be I will be giving some live lectures.

1 Like
15

okay thanks :+1: :pray:

16

Sir I am a fan of your lectures. A few days ago, I knew nothing about bitmasks,graph and dynamic programming . But after watching your videos I can solve some problems on these topics. Now I am requesting you to make video on Longest increasing subsequence , Longest Common Subsequence and on 0-1 knapsack

17

don’t worry buddy , I have a lot in mind for future lectures.

18

I can’t thank you enough. Thank you for everything😌

19

mention not buddy

20

Sir it will be really helpful to us if you make videos on not only Longest increasing subsequence , Longest Common Subsequence and on 0-1 knapsack, but also some problems from codeforces or codechef related to these topics

21

I always do that , I teach certain concept then take 1 or problem from some online judge and show the implementation.

22

https://cses.fi/problemset/task/1097

sir please make a video on this problem.

23

I have a problem related to this , I will try this one too.
thanks for suggestion

25

When we will get the next videos on DP?

26

http://lightoj.com/volume_showproblem.php?problem=1011
Please make a video on this problem.

27

27 July 2020 : video editorial added
E005 : Unique Paths | Leetcode
E006 : Unique Paths II | Leetcode

28

hi,
Can anybody please explain how to approach this problem: DGTCNT Problem - CodeChef. I went through editorial but unable to understand.

29

that’s a medium level problem and requires knowledge of “dp with bit-mask”.

I advice you to first learn dp with bitmask , solve 2 - 3 easy problems using that knowledge (you can find problems related to this concept here : Link )

then after try this problem again.

2 Likes
30

Thanks. I will be solving problems suggested by you first.

31

Could anybody tell me the approach to this problem ?

32

This post was flagged by the community and is temporarily hidden.

33

sir,please make lecture on suffix array