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

**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.