Introduction to Dynamic Programming (Part two)
Problems
| Sake game | 301 / 326 | 900 | |
| Coins | 440 / 464 | 900 | |
| Coins 2 | 360 / 380 | 1000 | |
| Game on array | 271 / 286 | 1100 | |
| Longest increasing subsequence 2 | 308 / 330 | 1100 | |
| Convolution | 210 / 250 | 1200 | |
| Regular bracket sequence | 217 / 239 | 1200 | |
| Faulty addition | 150 / 160 | 1300 | |
| Weird bank | 157 / 163 | 1300 | |
| Delete operation | 161 / 213 | 1400 | |
| Palindromize | 148 / 152 | 1400 | |
| Color ribbon | 101 / 148 | 1400 | |
| Unique subsequences | 169 / 198 | 1500 | |
| Unique subsequences 2 | 106 / 131 | 1500 | |
| Cow exhibition | 75 / 92 | 1500 | |
| Knapsack 3 | 155 / 180 | 1600 | |
| Compressing array | 84 / 98 | 1600 | |
| Regular bracket sequence 2 | 71 / 88 | 1600 | |
| Maximum path 3 | 66 / 78 | 1600 | |
| Concating substring | 48 / 58 | 1600 | |
| Soil | 70 / 82 | 1700 | |
| Stacking boxes | 70 / 95 | 1700 | |
| String transformation | 57 / 69 | 1800 | |
| Palindromic quadruple | 47 / 60 | 1900 | |
| Finding teammates | 8 / 8 | 1900 |