Introduction to Dynamic Programming (Part two)
Problems
| Sake game | 179 / 192 | 900 | |
| Coins | 286 / 303 | 900 | |
| Coins 2 | 224 / 241 | 1000 | |
| Game on array | 153 / 163 | 1100 | |
| Longest increasing subsequence 2 | 180 / 195 | 1100 | |
| Convolution | 117 / 145 | 1200 | |
| Regular bracket sequence | 105 / 113 | 1200 | |
| Faulty addition | 71 / 77 | 1300 | |
| Weird bank | 64 / 70 | 1300 | |
| Delete operation | 81 / 111 | 1400 | |
| Palindromize | 69 / 69 | 1400 | |
| Color ribbon | 38 / 59 | 1400 | |
| Unique subsequences | 99 / 116 | 1500 | |
| Unique subsequences 2 | 50 / 66 | 1500 | |
| Cow exhibition | 29 / 37 | 1500 | |
| Knapsack 3 | 85 / 99 | 1600 | |
| Compressing array | 43 / 52 | 1600 | |
| Regular bracket sequence 2 | 30 / 39 | 1600 | |
| Maximum path 3 | 26 / 30 | 1600 | |
| Concating substring | 18 / 20 | 1600 | |
| Soil | 37 / 42 | 1700 | |
| Stacking boxes | 36 / 52 | 1700 | |
| String transformation | 22 / 33 | 1800 | |
| Palindromic quadruple | 13 / 21 | 2000 |