Module Introduction to Dynamic Programming (Part two)

Introduction to Dynamic Programming (Part two)

Problems

Sake game 476 / 505 900
Coins 622 / 651 900
Coins 2 522 / 550 1000
Game on array 412 / 432 1100
Longest increasing subsequence 2 467 / 497 1100
Convolution 335 / 378 1200
Regular bracket sequence 348 / 370 1200
Faulty addition 259 / 274 1300
Weird bank 285 / 292 1300
Delete operation 273 / 333 1400
Palindromize 268 / 272 1400
Color ribbon 205 / 255 1400
Unique subsequences 258 / 289 1500
Unique subsequences 2 189 / 218 1500
Cow exhibition 160 / 195 1500
Knapsack 3 253 / 284 1600
Compressing array 160 / 179 1600
Regular bracket sequence 2 140 / 162 1600
Maximum path 3 131 / 149 1600
Concating substring 98 / 123 1600
Soil 108 / 128 1700
Stacking boxes 107 / 137 1700
String transformation 94 / 104 1800
Palindromic quadruple 74 / 95 1900
Finding teammates 37 / 37 1900