Dynamic Programming

Question 1

Best time to buy and sell stock III - with most 2 transactions

Answer 1

You don’t know it, check GitHub. Or search YouTube

Question 2

Climb stairs - F

Answer 2

You know it

Question 3

Partition equal subset sum - F, G

Answer 3

You don’t know it, check leetcode again

Question 4

Knapsack 1 how full you can do

Answer 4

You know it

Question 5

Number of ways to stay in the same place after some steps - G

Answer 5

You know it

Question 6

Profitable schemes - G

Answer 6

You know it

Question 7

Longest increasing subsequence - G

Answer 7

You know it

Question 8

Rat jump

Answer 8

You don’t know it. Check github

Question 9

Count sqaure submatrices with all ones

Answer 9

You know it

Question 10

Float combination sum with minimal adjustment

Answer 10

You know it

Question 11

Minimal costs to merge stones

Answer 11

You know it

Question 12

Minimum number of coins to make a change

Answer 12

You know it

Question 13

01 matrix - distance to nearest 0

Answer 13

You know it