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 |
|
Min Cost Climbing Stairs · 7 Companies
|
||
| 2 |
|
House Robber · 10 Companies
|
||
| 3 |
|
Counting Bits · 8 Companies
|
||
| 4 |
|
N-th Tribonacci Number · 3 Companies
|
||
| 5 |
|
Edit Distance · 10 Companies
|
||
| 6 |
|
Regular Expression Matching · 11 Companies
|
||
| 7 |
|
Wildcard Matching · 9 Companies
|
||
| 8 |
|
Distinct Subsequences · 5 Companies
|
||
| 9 |
|
Burst Balloons · 7 Companies
|
||
| 10 |
|
Minimum Cost to Merge Stones · 4 Companies
|
||
| 11 |
|
Minimum Difficulty of a Job Schedule · 5 Companies
|
||
| 12 |
|
Best Time to Buy and Sell Stock IV · 7 Companies
|
||
| 13 |
|
Cherry Pickup II · 3 Companies
|
||
| 14 |
|
Longest Increasing Path in a Matrix · 8 Companies
|
||
| 15 |
|
Word Break II · 9 Companies
|
||
| 16 |
|
Coin Change · 10 Companies
|
||
| 17 |
|
Coin Change II · 8 Companies
|
||
| 18 |
|
Partition Equal Subset Sum · 8 Companies
|
||
| 19 |
|
Target Sum · 8 Companies
|
||
| 20 |
|
Ones and Zeroes · 4 Companies
|
||
| 21 |
|
Unique Paths · 7 Companies
|
||
| 22 |
|
Unique Paths II · 9 Companies
|
||
| 23 |
|
Triangle · 7 Companies
|
||
| 24 |
|
Minimum Path Sum · 8 Companies
|
||
| 25 |
|
Decode Ways · 8 Companies
|
||
| 26 |
|
Word Break · 10 Companies
|
||
| 27 |
|
Longest Palindromic Subsequence · 10 Companies
|
||
| 28 |
|
Longest Common Subsequence · 10 Companies
|
||
| 29 |
|
Longest Increasing Subsequence · 15 Companies
|
||
| 30 |
|
Number of Longest Increasing Subsequence · 7 Companies
|
||
| 31 |
|
House Robber II · 7 Companies
|
||
| 32 |
|
Best Time to Buy and Sell Stock with Cooldown · 8 Companies
|