Introduction to Dynamic Programming (Part two)
Problems
| Sake game | 377 / 402 | 900 | |
| Coins | 522 / 549 | 900 | |
| Coins 2 | 438 / 461 | 1000 | |
| Game on array | 331 / 349 | 1100 | |
| Longest increasing subsequence 2 | 382 / 405 | 1100 | |
| Convolution | 259 / 301 | 1200 | |
| Regular bracket sequence | 267 / 290 | 1200 | |
| Faulty addition | 188 / 201 | 1300 | |
| Weird bank | 204 / 211 | 1300 | |
| Delete operation | 207 / 265 | 1400 | |
| Palindromize | 200 / 204 | 1400 | |
| Color ribbon | 136 / 191 | 1400 | |
| Unique subsequences | 195 / 226 | 1500 | |
| Unique subsequences 2 | 133 / 158 | 1500 | |
| Cow exhibition | 102 / 123 | 1500 | |
| Knapsack 3 | 178 / 209 | 1600 | |
| Compressing array | 103 / 119 | 1600 | |
| Regular bracket sequence 2 | 90 / 108 | 1600 | |
| Maximum path 3 | 85 / 99 | 1600 | |
| Concating substring | 60 / 74 | 1600 | |
| Soil | 81 / 93 | 1700 | |
| Stacking boxes | 86 / 113 | 1700 | |
| String transformation | 67 / 78 | 1800 | |
| Palindromic quadruple | 56 / 74 | 1900 | |
| Finding teammates | 14 / 16 | 1900 |