New update is available. Click here to update.

Dynamic Programming Notes

DP with Arrays Based Problems

0% completed

Maximum sum of two non-overlapping subarrays of a given size

Minimum Jumps

Minimum Removals

Minimum steps to reach target by a Knight

Minimum cost of reducing Array by merging any adjacent elements repetitively

DP with Strings Based Problems

0% completed

Wildcard Pattern Matching

Scramble String

Regular Expression Match

LCS of 3 strings

Distinct Subsequences

DP with Maths Based Problems

0% completed

Choose Students

Best Time To Buy and Sell Stock

Matrix Chain Multiplication

Buy and Sell Stock - III

Coin Game

DP with Trees Based Problems

0% completed

Optimal BST

Number of balanced binary trees

Goku and Dragon Balls

Breaking and Partitioning Based Problems

0% completed

Partition to K equal sum subsets

Partition Equal Subset Sum

Palindrome Partitioning ll

Maximum Length of Chain

King and his Golden Rod

Counting Based Problems

0% completed

Ways To Make Coin Change

Ways to arrange balls

Count number of ways to cover a distance

Count ways to reach the nth stairs

Count Palindromic Subsequences

Standard Problems

0% completed

Longest Palindromic Substring

Edit Distance

Rod cutting problem

Longest Increasing Subsequence

0 - 1 Knapsack

Mixed Problems

0% completed

Loot Houses

Colorful Knapsack

Word Wrap

Optimal Strategy for a Game

Cut Logs

Interleaving Two Strings

Common Digit Longest Subsequence

Tiling Problem

Gold mine problem

Maze with N doors and 1 Key