Problems
Dynamic Programming
Choose difficulty level to view problems.
0%
Mastery
Dynamic Programming Progress
0
/ 32
Questions Solved in Dynamic Programming
Easy
0
/ 4
Medium
0
/ 17
Hard
0
/ 11
| # | Problem | Status | Practice On Practice | Companies |
|---|---|---|---|---|
| 1 |
|
Coin Change · 10 Companies
|
||
| 2 |
|
Coin Change II · 8 Companies
|
||
| 3 |
|
Partition Equal Subset Sum · 8 Companies
|
||
| 4 |
|
Target Sum · 8 Companies
|
||
| 5 |
|
Ones and Zeroes · 4 Companies
|
||
| 6 |
|
Unique Paths · 7 Companies
|
||
| 7 |
|
Unique Paths II · 9 Companies
|
||
| 8 |
|
Triangle · 7 Companies
|
||
| 9 |
|
Minimum Path Sum · 8 Companies
|
||
| 10 |
|
Decode Ways · 8 Companies
|
||
| 11 |
|
Word Break · 10 Companies
|
||
| 12 |
|
Longest Palindromic Subsequence · 10 Companies
|
||
| 13 |
|
Longest Common Subsequence · 10 Companies
|
||
| 14 |
|
Longest Increasing Subsequence · 15 Companies
|
||
| 15 |
|
Number of Longest Increasing Subsequence · 7 Companies
|
||
| 16 |
|
House Robber II · 7 Companies
|
||
| 17 |
|
Best Time to Buy and Sell Stock with Cooldown · 8 Companies
|