| 0010 |
Regular Expression Matching |
C# |
no |
|
O(m*n) |
Hard |
DP |
| 0032 |
Longest Valid Parentheses |
C |
O(n) |
6ms |
O(n) |
Hard |
DP |
| 0044 |
Wildcard Matching |
C# |
O(n*n) |
162ms |
O(n*n) |
Hard |
DP |
| 0053 |
Maximum Subarray |
Java |
O(n) |
17ms |
O(n) |
Easy |
DP |
| 0062 |
Unique Paths |
Java |
- |
- |
- |
Medium |
DP |
| 0063 |
Unique Paths II |
Java |
- |
- |
- |
Medium |
DP |
| 0064 |
Minimum Path Sum |
Java |
- |
- |
- |
Medium |
DP |
| 0091 |
Decode Ways |
Java |
- |
- |
- |
Medium |
DP |
| 0095 |
Unique Binary Search Trees II |
Java |
- |
- |
- |
Medium |
DP |
| 0096 |
Unique Binary Search Trees |
Java |
- |
- |
- |
Medium |
DP |
| 0120 |
Triangle |
Java |
- |
- |
- |
Medium |
DP |
| 0121 |
Best Time to Buy and Sell Stock |
Scala |
- |
- |
- |
Easy |
DP |
| 0122 |
Best Time to Buy and Sell Stock II |
Scala |
- |
- |
- |
Easy |
DP |
| 0139 |
Word Break |
Java |
O(n*n) |
- |
O(n) |
Medium |
DP |
| 0140 |
Word Break II |
Java |
O(n*n) |
- |
O(n) |
Hard |
DP |
| 0152 |
Maximum Product Subarray |
Java |
O(n) |
- |
O(n) |
Medium |
DP |
| 0198 |
House Robber |
Java |
- |
- |
- |
Easy |
DP |
| 0213 |
House Robber II |
Java |
- |
- |
- |
Medium |
DP |
| 0303 |
Range Sum Query - Immutable |
Java |
- |
- |
- |
Easy |
DP |
| 0304 |
Range Sum Query 2D - Immutable |
Java |
- |
- |
- |
Medium |
DP |
| 0309 |
Best Time to Buy and Sell Stock with Cooldown |
Java |
- |
- |
- |
Medium |
DP |
| 0322 |
Coin Change |
C |
O(n*k) |
12ms |
O(n) |
Medium |
DP |
| 0343 |
Integer Break |
Java |
O(n*n) |
1ms |
O(n) |
Medium |
DP |
| 0357 |
Count Numbers with Unique Digits |
Java |
- |
- |
- |
Medium |
DP |
| 0375 |
Guess Number Higher or Lower II |
Java |
- |
- |
- |
Medium |
DP |
| 0376 |
Wiggle Subsequence |
Java |
- |
- |
- |
Medium |
DP |
| 0377 |
Combination Sum IV |
Java |
O(n*n) |
6MS |
O(n) |
Medium |
DP |
| 0392 |
Is Subsequence |
Java |
- |
- |
- |
Medium |
DP |
| 0403 |
Frog Jump |
Java |
- |
- |
- |
Hard |
DP |
| 0410 |
Split Array Largest Sum |
Java |
- |
- |
- |
Hard |
DP |
| 0416 |
Partition Equal Subset Sum |
Java |
- |
- |
- |
Medium |
DP |
| 0413 |
Arithmetic Slices |
Java |
- |
- |
- |
Medium |
DP |
| 0446 |
Arithmetic Slices II - Subsequence |
Java |
- |
- |
- |
Hard |
DP |
| 0464 |
Can I Win |
Java |
- |
- |
- |
Medium |
DP |
| 0466 |
Count The Repetitions |
Java |
- |
- |
- |
Hard |
DP |
| 0467 |
Unique Substrings in Wraparound String |
Java |
- |
- |
- |
Medium |
DP |
| 0472 |
Concatenated Words |
Java |
- |
- |
- |
Hard |
DP |
| 0474 |
Ones and Zeroes |
Java |
- |
- |
- |
Medium |
DP |
| 0486 |
Predict the Winner |
Java |
- |
- |
- |
Medium |
DP |
| 0494 |
Target Sum |
Java |
- |
- |
- |
Medium |
DP |
| 0514 |
Freedom Trail |
Java |
- |
- |
- |
Hard |
DP |
| 0516 |
Longest Palindromic Subsequence |
Java |
- |
- |
- |
Medium |
DP |
| 0517 |
Super Washing Machines |
Java |
- |
- |
- |
Hard |
DP |
| 0523 |
Continuous Subarray Sum |
Java |
- |
- |
- |
Medium |
DP |
| 0673 |
Number of Longest Increasing Subsequence |
Java |
O(m*n) |
27MS |
O(m*n) |
Medium |
DP |
| 0583 |
Delete Operation for Two Strings |
Java |
O(n*m) |
95.08% |
O(n*m) |
Medium |
DP |