Dynamic Programming Flashcards
1
Q
Best time to buy and sell stock III - with most 2 transactions
A
You don’t know it, check GitHub. Or search YouTube
2
Q
Climb stairs - F
A
You know it
3
Q
Partition equal subset sum - F, G
A
You don’t know it, check leetcode again
4
Q
Knapsack 1 how full you can do
A
You know it
5
Q
Number of ways to stay in the same place after some steps - G
A
You know it
6
Q
Profitable schemes - G
A
You know it
7
Q
Longest increasing subsequence - G
A
You know it
8
Q
Rat jump
A
You don’t know it. Check github
9
Q
Count sqaure submatrices with all ones
A
You know it
10
Q
Float combination sum with minimal adjustment
A
You know it
11
Q
Minimal costs to merge stones
A
You know it
12
Q
Minimum number of coins to make a change
A
You know it
13
Q
01 matrix - distance to nearest 0
A
You know it
