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

tutorial
,
4

yes I will
after digit sum , most likely I will be explaining D magical number problem

3 Likes
5

thankq

6

you’re welcome

7

28 May 2020 : 1 new lecture added
L08 : Digit DP Phase 3 & SPOJ Practice Problem

8

sir plz upload bitmask dp it really hard to understand

9

I will try to make it easy , no worry.

1 Like
10

6 June 2020 : 2 new lecture added.
L13 : Longest Palindromic Substring

E004 : Longest Palindromic Substring | Leetcode

11

Bhai please make some videos on dp on tree.

12

going to make video on subtree query using segment tree and tree flattening.

1 Like
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