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

tutorial
,
1

Hello Codechef community.
This is CodeNCode

This is going to be a complete video lecture series on Dynamic Programming covering concepts in details with implementation and practice problems to make concepts clear and gain confidence.

Dynamic Programming Course Part 1

L00 : Course Overview

L01 : Staircase Problem

L02 : Staircase Problem Recursive Approach

L03 : 2 X N Tiling Problem

L04 : Subsets and BitMasking

L05 : Subset Sum Using BitMask

L06 : Chef Got Recipes(Codechef) | BitMasking Practice Problem

L07 : Coin Change Problem

L08 : Subset Sum Part 1

L09 : Subset Sum with Linear Space (Part 2)

L10 : Printing Result From DP Array

L11 : Min / Max Path Queries on 2D Grid (Part 1)

L12 : Min / Max Path Queries on 2D grid (Part 2)

E002 : Minimum Falling Path Sum | Leetcode

E003 : Minimum Path Sum | Leetcode

L13 : Longest Palindromic Substring

E004 : Longest Palindromic Substring | Leetcode

L14 : Unique ways to reas (N , M) From (1 , 1)

E005 : Unique Paths | Leetcode

E006 : Unique Paths II | Leetcode




Dynamic Programming Course Part 2

L01 : Caesar’s Legion | Codeforces (Rated 1800)

L02 : Flowers | Codeforces(Rated 1700)

L03 : Longest Regular Bracket Sequence | Codeforces (Rated 1900)

L04 : Let’s go rolling | Codeforces (Rated 1800)

L05 : Digit DP Introduction

L06 : Digit DP Phase 1

L07 : Digit DP Phase 2

L08 : Digit DP Phase 3 & SPOJ Practice Problem

(More Lectures coming)

Your suggestion / support is needed for this channel(CodeNCode) to grow.

Thank you for your valuable time.
CodeNCode.

40 Likes
2

23 May 2020 : 2 digit dp ectures added.

L06 : Digit DP Phase 1

L07 : Digit DP Phase 2

4 Likes
3

Raone number and D magic number k uper video upload kar na … Piz…

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