Introduction to Dynamic Programming (Part two)
Problems
| Sake game | 366 / 391 | 900 | |
| Coins | 511 / 538 | 900 | |
| Coins 2 | 428 / 451 | 1000 | |
| Game on array | 324 / 342 | 1100 | |
| Longest increasing subsequence 2 | 370 / 394 | 1100 | |
| Convolution | 252 / 294 | 1200 | |
| Regular bracket sequence | 260 / 283 | 1200 | |
| Faulty addition | 181 / 193 | 1300 | |
| Weird bank | 194 / 201 | 1300 | |
| Delete operation | 201 / 257 | 1400 | |
| Palindromize | 192 / 196 | 1400 | |
| Color ribbon | 126 / 177 | 1400 | |
| Unique subsequences | 191 / 221 | 1500 | |
| Unique subsequences 2 | 129 / 155 | 1500 | |
| Cow exhibition | 95 / 116 | 1500 | |
| Knapsack 3 | 174 / 205 | 1600 | |
| Compressing array | 97 / 113 | 1600 | |
| Regular bracket sequence 2 | 87 / 105 | 1600 | |
| Maximum path 3 | 82 / 96 | 1600 | |
| Concating substring | 58 / 70 | 1600 | |
| Soil | 78 / 91 | 1700 | |
| Stacking boxes | 83 / 109 | 1700 | |
| String transformation | 64 / 75 | 1800 | |
| Palindromic quadruple | 55 / 72 | 1900 | |
| Finding teammates | 12 / 13 | 1900 |