1

Dynamic Programming Introduction

1

Climbing Stars

2

Frog Jump(DP-3)

3

Frog Jump with k distances(DP-4)

4

Maximum sum of non-adjacent elements (DP 5)

5

House Robber (DP 6)

1

Ninja's Training (DP 7)

2

Grid Unique Paths : DP on Grids (DP8)

3

Grid Unique Paths 2 (DP 9)

4

Minimum path sum in Grid (DP 10)

5

Minimum path sum in Triangular Grid (DP 11)

6

Minimum/Maximum Falling Path Sum (DP-12)

7

3-d DP : Ninja and his friends (DP-13)

1

Subset sum equal to target (DP- 14)

2

Partition Equal Subset Sum (DP- 15)

3

Partition Set Into 2 Subsets With Min Absolute Sum Diff (DP- 16)

4

Count Subsets with Sum K (DP - 17)

5

Count Partitions with Given Difference (DP - 18)

6

0/1 Knapsack (DP - 19)

7

Minimum Coins (DP - 20)

8

Target Sum (DP - 21)

9

Coin Change 2 (DP - 22)

10

Unbounded Knapsack (DP - 23)

11

Rod Cutting Problem | (DP - 24)

1

Longest Common Subsequence | (DP - 25)

2

Print Longest Common Subsequence | (DP - 26)

3

Longest Common Substring | (DP - 27)

4

Longest Palindromic Subsequence | (DP-28)

5

Minimum insertions to make string palindrome | DP-29

6

Minimum Insertions/Deletions to Convert String | (DP- 30)

7

Shortest Common Supersequence | (DP - 31)

8

Distinct Subsequences| (DP-32)

9

Edit Distance | (DP-33)

10

Wildcard Matching | (DP-34)

1

Best Time to Buy and Sell Stock |(DP-35)

2

Buy and Sell Stock - II|(DP-36)

3

Buy and Sell Stocks III|(DP-37)

4

Buy and Stock Sell IV |(DP-38)

5

Buy and Sell Stocks With Cooldown|(DP-39)

6

Buy and Sell Stocks With Transaction Fee|(DP-40)

1

Longest Increasing Subsequence |(DP-41)

2

Printing Longest Increasing Subsequence|(DP-42)

3

Longest Increasing Subsequence |(DP-43)

4

Largest Divisible Subset|(DP-44)

5

Longest String Chain|(DP-45)

6

Longest Bitonic Subsequence |(DP-46)

7

Number of Longest Increasing Subsequences|(DP-47)

1

Matrix Chain Multiplication|(DP-48)

2

Matrix Chain Multiplication | Bottom-Up|(DP-49)

3

Minimum Cost to Cut the Stick|(DP-50)

4

Burst Balloons|(DP-51)

5

Evaluate Boolean Expression to True|(DP-52)

6

Palindrome Partitioning - II|(DP-53)

7

Partition Array for Maximum Sum|(DP-54)

1

Maximum Rectangle Area with all 1's|(DP-55)

2

Count Square Submatrices with All Ones|(DP-56)