Introduction to Dynamic Programming (Part two)
Problems
| Sake game | 243 / 261 | 900 | |
| Coins | 369 / 389 | 900 | |
| Coins 2 | 299 / 315 | 1000 | |
| Game on array | 208 / 223 | 1100 | |
| Longest increasing subsequence 2 | 257 / 277 | 1100 | |
| Convolution | 168 / 204 | 1200 | |
| Regular bracket sequence | 170 / 187 | 1200 | |
| Faulty addition | 115 / 123 | 1300 | |
| Weird bank | 114 / 118 | 1300 | |
| Delete operation | 128 / 170 | 1400 | |
| Palindromize | 112 / 115 | 1400 | |
| Color ribbon | 74 / 102 | 1400 | |
| Unique subsequences | 141 / 161 | 1500 | |
| Unique subsequences 2 | 81 / 101 | 1500 | |
| Cow exhibition | 56 / 70 | 1500 | |
| Knapsack 3 | 121 / 139 | 1600 | |
| Compressing array | 65 / 75 | 1600 | |
| Regular bracket sequence 2 | 50 / 61 | 1600 | |
| Maximum path 3 | 50 / 56 | 1600 | |
| Concating substring | 37 / 41 | 1600 | |
| Soil | 55 / 63 | 1700 | |
| Stacking boxes | 55 / 74 | 1700 | |
| String transformation | 43 / 55 | 1800 | |
| Palindromic quadruple | 37 / 50 | 2000 |