🔥🚀Dynamic Programming🚀🔥

DP - NUMBERS

1.Fibonacci Number
2.Nth - Tribonacci Number
3.Perfect Squares
4.Ways to Nth stair / Climbing Stairs
5.Number of Dice Rolls Sum to Target

DP - ARRAYS

1.House Robber I
2.House Robber II
3.Coin Change (Minimum Coins)
4.Coin Change (Count Ways)
5.Minimum Cost Climbing Stairs
6.Minimum Cost for Tickets
7.Target Sum
8.Reducing Dishes
9.Combination Sum IV
10.Rod Cutting Problem

DP - STRINGS

1.Longest Common Subsequence
2.Longest Increasing Subsequence
3.Print Longest Common Subsequence
4.Edit Distance
5.Longest Common Substring (Print + Length)
6.Longest Palindromic Substring
7.Longest Palindromic Subsequence
8.Word Break I
9.Word Break II
10.Distinct Subsequences
11.Wildcard Matching
12.Shortest Common Supersequence
13.Minimum Insertions to make String Palindrome
14.Minimum ASCII delete Sum of Strings
15.Interleaving Strings
16.Regular Expression Matching
17.Ones & Zeroes

DP - GRIDS

1.Unique Paths I
2.Unique Paths II ( With Obstacles )
3.Minimum Path Sum
4.Minimum/Maximum Falling Path Sum
5.Triangle
6.Maximal Square
7.Maximum Area Rectangle

DP - STOCKS

1.Buy & Sell Stocks I ( 1 Transaction )
2.Buy & Sell Stocks II ( Infinite Transactions )
3.Buy & Sell Stocks III ( Atmost 2 Transactions )
4.Buy & Sell Stocks IV ( Atmost K transactions )
5.Buy & Sell Stocks V ( With Transaction Fees )
6.Buy & Sell Stocks VI ( With Cooldown Period )

DP - BINARY SEARCH

1.Longest Increasing Subsequence
2.Russian Doll Envelopes
3.Maximum Height Cuboid Stack

DP - TREES

1.Unique BST I
2.Unique BST II
3.House Robber III

DP - GAMES

1.Jump Game I
2.Jump Game II
3.Stone Game I
4.Stone Game II
5.Stone Game III
6.Stone Game IV
7.Last Stone Weight

3D - DP

1.Cherry PickUp 1
2.Cherry PickUp 2
3.Knight Probability
4.Burst Balloons
5.Dungeon Game
Total ~~ 63 Problems to finish DP GRIND 🔥🚀🦅

Comments (0)