Introduction to DP
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 1195 | Introduction to DP | Easy | Introduction to DP | A2Z |
1D DP
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 287 | Climbing stairs | Medium | 1D DP | A2Z B75 |
| 288 | Frog Jump | Medium | 1D DP | A2Z |
| 289 | Frog jump with K distances | Medium | 1D DP | A2Z |
| 291 | Maximum sum of non adjacent elements | Medium | 1D DP | A2Z B75 |
| 290 | House robber | Medium | 1D DP | A2Z B75 |
| 691 | Maximum Profit in Job Scheduling | Medium | 1D DP | SDE |
| 2397 | Decode Ways | Easy | 1D DP | B75 |
2D/3D DP and DP on Grids
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 292 | Ninja's training | Medium | 2D/3D DP and DP on Grids | A2Z |
| 2795 | Grid Unique Paths : DP on Grids (DP8) | Medium | 2D/3D DP and DP on Grids | A2Z |
| 300 | Unique paths II | Medium | 2D/3D DP and DP on Grids | A2Z |
| 298 | Minimum Falling Path Sum | Medium | 2D/3D DP and DP on Grids | A2Z |
| 299 | Triangle | Medium | 2D/3D DP and DP on Grids | A2Z |
| 769 | Ninja and his Friends | Medium | 2D/3D DP and DP on Grids | A2Z |
| 297 | Grid unique paths | Medium | 2D/3D DP and DP on Grids | SDE B75 |
| 2797 | Minimum sum path in the matrix | Medium | 2D/3D DP and DP on Grids | SDE |
DP on Subsequences
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 2804 | Subset sum equal to target (DP- 14) | Hard | DP on Subsequences | A2Z |
| 321 | Partition equal subset sum | Hard | DP on Subsequences | A2Z |
| 320 | Partition a set into two subsets with minimum absolute sum difference | Hard | DP on Subsequences | A2Z |
| 318 | Count subsets with sum K | Hard | DP on Subsequences | A2Z |
| 317 | Count partitions with given difference | Hard | DP on Subsequences | A2Z |
| 541 | Assign Cookies | Easy | DP on Subsequences | A2Z SDE |
| 2802 | Minimum Coins (DP - 20) | Hard | DP on Subsequences | A2Z |
| 324 | Target sum | Hard | DP on Subsequences | A2Z |
| 2801 | Coin Change 2 (DP - 22) | Hard | DP on Subsequences | A2Z |
| 325 | Unbounded knapsack | Hard | DP on Subsequences | A2Z |
| 2803 | Rod Cutting Problem - (DP - 24) | Hard | DP on Subsequences | A2Z |
| 315 | 0 and 1 Knapsack | Hard | DP on Subsequences | SDE |
| 316 | Coin change II | Hard | DP on Subsequences | SDE B75 |
| 323 | Subset sum equals to target | Hard | DP on Subsequences | SDE |
| 322 | Rod cutting problem | Hard | DP on Subsequences | SDE |
DP on Strings
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 308 | Longest common subsequence | Hard | DP on Strings | A2Z SDE B75 |
| 2799 | Print Longest Common Subsequence - (DP - 26) | Hard | DP on Strings | A2Z |
| 309 | Longest common substring | Hard | DP on Strings | A2Z |
| 310 | Longest palindromic subsequence | Hard | DP on Strings | A2Z |
| 2800 | Minimum insertions to make string palindrome - DP-29 | Hard | DP on Strings | A2Z |
| 311 | Minimum insertions or deletions to convert string A to B | Hard | DP on Strings | A2Z |
| 313 | Shortest common supersequence | Hard | DP on Strings | A2Z |
| 306 | Distinct subsequences | Hard | DP on Strings | A2Z |
| 307 | Edit distance | Hard | DP on Strings | A2Z SDE |
| 314 | Wildcard matching | Hard | DP on Strings | A2Z |
DP on Stocks
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 301 | Best time to buy and sell stock | Medium | DP on Stocks | A2Z B75 |
| 302 | Best time to buy and sell stock II | Medium | DP on Stocks | A2Z |
| 303 | Best time to buy and sell stock III | Medium | DP on Stocks | A2Z |
| 304 | Best time to buy and sell stock IV | Medium | DP on Stocks | A2Z |
| 56 | Best Time to Buy and Sell Stock with Cooldown | Medium | DP on Stocks | A2Z |
| 305 | Best time to buy and sell stock with transaction fees | Medium | DP on Stocks | A2Z |
DP on LIS
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 636 | Longest Increasing Subsequence | Medium | DP on LIS | A2Z SDE B75 |
| 851 | Print Longest Increasing Subsequence | Medium | DP on LIS | A2Z |
| 2851 | Longest Increasing Subsequence - (DP-43) | Medium | DP on LIS | A2Z |
| 603 | Largest Divisible Subset | Medium | DP on LIS | A2Z |
| 640 | Longest String Chain | Medium | DP on LIS | A2Z |
| 633 | Longest Bitonic Subsequence | Medium | DP on LIS | A2Z |
| 780 | Number of Longest Increasing Subsequences | Medium | DP on LIS | A2Z |
| 698 | Maximum Sum Increasing Subsequence | Medium | DP on LIS | SDE |
MCM DP - Partition DP
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 327 | Matrix chain multiplication | Hard | MCM DP - Partition DP | A2Z SDE |
| 2806 | Matrix Chain Multiplication - Bottom-Up - (DP-49) | Hard | MCM DP - Partition DP | A2Z |
| 328 | Minimum cost to cut the stick | Hard | MCM DP - Partition DP | A2Z |
| 326 | Burst balloons | Hard | MCM DP - Partition DP | A2Z |
| 276 | Different Ways to Evaluate a Boolean Expression | Medium | MCM DP - Partition DP | A2Z |
| 329 | Palindrome partitioning II | Hard | MCM DP - Partition DP | A2Z |
| 810 | Partition Array for Maximum Sum | Medium | MCM DP - Partition DP | A2Z |
| 1004 | Super Egg Drop | Medium | MCM DP - Partition DP | SDE |
| 2854 | Palindrome Partitioning (MCM Variation) | Hard | MCM DP - Partition DP | SDE |
DP on Squares
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 2860 | Maximum Rectangle Area with all 1's - (DP-55) | Hard | DP on Squares | A2Z |
| 2395 | Count Square Submatrices with All Ones - (DP-56) | Easy | DP on Squares | A2Z |