This is going to be a complete video lecture series on Dynamic Programming covering concepts in detail with implementation, practice problems, and notes ( for Revision ) to make our concepts clear and gain confidence.

There are going to be 3 parts of the whole series.

**Part 1:** This will consist of lectures on Dynamic Programming and basic Problems related to it so that we can understand the terminologies and concepts clearly.

**Part 2:** This will consist of discussion on Standard Problems and techniques to solve them.

**Part 3:** This will consist of Practice Problem Series where we will be using our previous skills to solve problems.

After completing Part 2, we will have a contest on host a contest on HackerEarth so that you can see for yourself that how good you have understood concepts and techniques up to Part 2.

And Problem Discussion on SLACK.

L00. Course Overview

L01. Getting Started: Introduction to Dynamic Programming?

L02. Fundamental Concepts in Dynamic Programming.

L03. Maximum Subarray Sum / Maximum Sum Subarray.

L04. Number of paths in Grid.

L05. The mathematical solution to the number of paths in Grid.

E001: Frog 1 (AtCoder Problem and Practice Problems )

L06. Longest Common Subsequence.

E002. Longest Common Subsequence ( Leetcode Problem)

L07. Knapsack Problem ( AtCoder )

L08. Longest Palindromic Sequence using LCS

Your suggestion/support is needed for this channel (#codeforcode) to grow and help each other.

Thank you for your valuable time.

CODELABS3277

( www.codelabs3277.org )