# Dynamic Programming
| ID | Blog | Solutions | Source |
|:----:|:-------:|:----:|:----:|
| 1017 | [Staircases](https://helloacm.com/how-to-break-integers-staircases-using-dynamic-programming/) | [1](https://github.com/DoctorLai/ACM/tree/master/timus/1017.%20Staircases)<br/>cpp  | [timus](http://acm.timus.ru/problem.aspx?space=1&num=1017) |
| 746 | [Min Cost Climbing Stairs](https://helloacm.com/how-to-compute-the-min-cost-of-climbing-stairs-via-dynamic-programming-algorithm/) | [2](https://github.com/DoctorLai/ACM/tree/master/leetcode/746.%20Min%20Cost%20Climbing%20Stairs)<br/>cpp  | [leetcode](https://leetcode.com/problems/min-cost-climbing-stairs/) |
| 91 | [Decode Ways](https://helloacm.com/total-number-of-ways-to-decode-the-message-via-dynamic-programming-algorithm/) | [1](https://github.com/DoctorLai/ACM/tree/master/leetcode/91.%20Decode%20Ways)<br/>cpp  | [leetcode](https://leetcode.com/problems/decode-ways/) |
| 931 | [Minimum Falling Path Sum](https://helloacm.com/the-dynamic-programming-algorithm-to-compute-the-minimum-falling-path-sum/) | [1](https://github.com/DoctorLai/ACM/blob/master/leetcode/931.%20Minimum%20Falling%20Path%20Sum/931.cpp)<br/>cpp  | [leetcode](https://leetcode.com/problems/minimum-falling-path-sum/) |
| 322 | [Coin Change](https://helloacm.com/classic-knapsack-problem-variant-coin-change-via-dynamic-programming-and-breadth-first-search-algorithm/) | [2](https://github.com/DoctorLai/ACM/tree/master/leetcode/322.%20Coin%20Change)<br/>cpp  | [leetcode](https://leetcode.com/problems/coin-change/) |
| 518 | [Coin Change 2](https://helloacm.com/classic-unlimited-knapsack-problem-variant-coin-change-via-dynamic-programming-and-depth-first-search-algorithm/) | [1](https://github.com/DoctorLai/ACM/tree/master/leetcode/518.%20Coin%20Change%202)<br/>cpp  | [leetcode](https://leetcode.com/problems/coin-change-2/)
| 256 | [Paint House](https://helloacm.com/how-to-paint-the-houses-using-minimal-costs-via-dynamic-programming-algorithm/) | [1](https://github.com/DoctorLai/ACM/tree/master/leetcode/256.%20Paint%20House)<br/>cpp  | [leetcode](https://leetcode.com/problems/paint-house/)
| 276 | [Paint Fence](https://helloacm.com/compute-the-number-of-ways-to-paint-the-house-via-dynamic-programming-algorithm/) | [1](https://github.com/DoctorLai/ACM/tree/master/leetcode/276.%20Paint%20Fence)<br/>cpp  | [leetcode](https://leetcode.com/problems/paint-fence/)