Suryanand
Resources
Sky
Emerald
Database
Home
← All DSA topics
·
System design
Dynamic Programming
20 problems in this topic. Select one to open the tabbed viewer.
Problems
1.
322. Coin Change
2.
518. Coin Change 2 — combinations (order of coins irrelevant).
3.
300. Longest Increasing Subsequence — patience sorting O(n log n).
4.
516. Longest Palindromic Subsequence
5.
72. Edit Distance
6.
139. Word Break
7.
213. House Robber II — circular street.
8.
91. Decode Ways
9.
416. Partition Equal Subset Sum — subset sum to target/2.
10.
494. Target Sum — count ways +/- to reach target.
11.
312. Burst Balloons — interval DP.
12.
1235. Maximum Profit in Job Scheduling — binary search + DP.
13.
1048. Longest String Chain
14.
115. Distinct Subsequences
15.
97. Interleaving String
16.
63. Unique Paths II — grid with obstacles.
17.
64. Minimum Path Sum
18.
221. Maximal Square
19.
132. Palindrome Partitioning II — minimum cuts.
20.
1043. Partition Array for Maximum Sum