Introduction to Dynamic Programming (Part two)
Problems
| Sake game | 496 / 526 | 900 | |
| Coins | 645 / 674 | 900 | |
| Coins 2 | 539 / 567 | 1000 | |
| Game on array | 430 / 449 | 1100 | |
| Longest increasing subsequence 2 | 485 / 515 | 1100 | |
| Convolution | 350 / 398 | 1200 | |
| Regular bracket sequence | 369 / 392 | 1200 | |
| Faulty addition | 274 / 293 | 1300 | |
| Weird bank | 306 / 313 | 1300 | |
| Delete operation | 285 / 346 | 1400 | |
| Palindromize | 286 / 291 | 1400 | |
| Color ribbon | 216 / 270 | 1400 | |
| Unique subsequences | 270 / 302 | 1500 | |
| Unique subsequences 2 | 200 / 229 | 1500 | |
| Cow exhibition | 170 / 205 | 1500 | |
| Knapsack 3 | 264 / 296 | 1600 | |
| Compressing array | 169 / 188 | 1600 | |
| Regular bracket sequence 2 | 149 / 173 | 1600 | |
| Maximum path 3 | 137 / 157 | 1600 | |
| Concating substring | 100 / 127 | 1600 | |
| Soil | 109 / 129 | 1700 | |
| Stacking boxes | 110 / 139 | 1700 | |
| String transformation | 95 / 105 | 1800 | |
| Palindromic quadruple | 77 / 100 | 1900 | |
| Finding teammates | 37 / 38 | 1900 |