Today I've listed some DP tutorials and problems. Actually, I made it for my personal practice. But I think It may Help others too.↵
↵
**Note: If you have some other tutorial links and nice problems, mention them. I'll add them here. It'll help me too.**↵
↵
## Dynamic programming:↵
↵
1. [Topcoder Tutorial](https://www.topcoder.com/community/competitive-programming/tutorials/dynamic-programming-from-novice-to-advanced/)↵
2. [Dynamic Programming,from novice to advanced](https://www.cnblogs.com/drizzlecrj/archive/2007/10/26/939159.html)↵
3. [Learn DP and other tricks](https://www.codechef.com/certification/data-structures-and-algorithms/prepare#foundation)↵
4. [Non-trivial DP tricks](https://codeforces.net/blog/entry/47764)↵
5. [Everything about Dynamic Programming](https://codeforces.net/blog/entry/43256)↵
6. [Digit DP 1](https://codeforces.net/blog/entry/53960)↵
7. [some solutions of digit dp problems](https://codeforces.net/blog/entry/7221)↵
8. [digit Dp for product digits](https://codeforces.net/blog/entry/53286)↵
9. [Digit Dp tutorial bangla](http://shakilcompetitiveprogramming.blogspot.com/2015/09/digit-dp.html)↵
10. [Digit DP hackerrank tutorial](https://www.hackerrank.com/topics/digit-dp)↵
11. [Important problems solutions of Digit DP](http://gautamdegitdp.blogspot.com/)↵
12. [DP on trees](https://codeforces.net/blog/entry/20935)↵
13. [DP on trees problem-3](https://codeforces.net/blog/entry/63257)↵
14. [DP on trees](https://www.commonlounge.com/discussion/8573ee40c4cb4673824c867715a5bc7b)↵
15. [A Tricky DP Problem on Trees](http://rachitiitr.blogspot.com/2017/05/a-tricky-dp-problem-on-trees.html)↵
16. [Bitmask DP](https://www.hackerearth.com/practice/algorithms/dynamic-programming/bit-masking/tutorial/)↵
17. [SOS Dp](https://codeforces.net/blog/entry/45223)↵
18. [Sum Over Subsets](https://www.geeksforgeeks.org/sum-subsets-dynamic-programming/)↵
19. [bitmask dp, buildup sos dp](https://algowarehouse.blogspot.com/2018/01/bitmask-dp-buildup-to-sos-dp-pt-2.html)↵
20. [A little bit of classics: dynamic programming over subsets and paths in graphs](https://codeforces.net/blog/entry/337)↵
↵
### Problems related to Dynamic Programming:↵
You have to solve these problems to develop DP skills↵
↵
#### Simple DP Problems:↵
[Lightoj Problems](http://lightoj.com/volume_problemcategory.php?user_id=43745&category=Dynamic%20Programming)↵
↵
[New Year and the Permutation Concatenation](https://codeforces.net/problemset/problem/1091/D)↵
↵
[Multiply](https://codeforces.net/problemset/problem/1061/C)↵
↵
[Stars Drawing(Easy Version)](https://codeforces.net/problemset/problem/1015/E1)↵
↵
[Consecutive Subsequence](https://codeforces.net/problemset/problem/977/F)↵
↵
[substring](https://codeforces.net/problemset/problem/919/D)↵
↵
[permute Digits](https://codeforces.net/problemset/problem/915/C)↵
↵
[Mike and GCD Problem](https://codeforces.net/problemset/problem/798/C)↵
↵
[Mahmud and message](https://codeforces.net/problemset/problem/766/C)↵
↵
[Travel Card](https://codeforces.net/problemset/problem/756/B)↵
↵
[Coloring Trees](https://codeforces.net/problemset/problem/711/C) ↵
↵
[Robbers' Watch](https://codeforces.net/problemset/problem/685/A)↵
↵
[Alyona And the tree](https://codeforces.net/problemset/problem/682/C)↵
↵
[Geometric Progression](https://codeforces.net/problemset/problem/567/C)↵
↵
[Kyoya and balls](https://codeforces.net/problemset/problem/553/A)↵
↵
[soldier and number game](https://codeforces.net/problemset/problem/546/D)↵
↵
[Animals](https://codeforces.net/problemset/problem/35/D)↵
↵
#### Bitmask DP problems:↵
↵
[Problem 1](http://acm.timus.ru/problem.aspx?space=1&num=1152)↵
↵
[Problem 2](http://acm.timus.ru/problem.aspx?space=1&num=1817)↵
↵
[Problem 3](http://acm.sgu.ru/problem.php?contest=0&problem=527)↵
↵
[Problem 4](http://acm.sgu.ru/problem.php?contest=0&problem=536)↵
↵
[problem 5 ](http://codeforces.net/problemset/problem/8/C)↵
↵
[problem 6](http://codeforces.net/problemset/problem/16/E)↵
↵
[problem 7](http://codeforces.net/problemset/problem/71/E)↵
↵
[Problem 8](https://codeforces.net/problemset/problem/1051/D)↵
↵
#### DP on Trees Problems:↵
↵
[Appleman and Trees](https://codeforces.net/contest/461/problem/B)↵
↵
[Counting On Trees](https://www.hackerearth.com/challenges/competitive/march-clash-15/algorithm/counting-on-tree-1/description/)↵
↵
[Rivers](https://www.iarcs.org.in/inoi/online-study-material/problems/rivers.php)↵
↵
[Coffee shop](https://www.iarcs.org.in/inoi/online-study-material/problems/coffee-shop.php)↵
↵
[mobiles](https://www.iarcs.org.in/inoi/online-study-material/problems/mobiles-apio.php)↵
↵
[Binary Apple Tree](http://acm.timus.ru/problem.aspx?space=1&num=1018)↵
↵
[Tree pruning](https://www.hackerrank.com/challenges/tree-pruning/problem)↵
↵
[Anniveersary Problem](http://acm.timus.ru/problem.aspx?space=1&num=1039)↵
↵
[Berland Fedaralization](https://codeforces.net/contest/440/problem/D)↵
↵
#### Some Hard DP Problems:↵
↵
[Complete Mirror](https://codeforces.net/problemset/problem/1182/D)↵
↵
[Destroy it!](https://codeforces.net/problemset/problem/1176/F)↵
↵
[Nauuo and Pictures (easy version)](https://codeforces.net/problemset/problem/1172/C1)↵
↵
[Ehab and the Expected GCD Problem](https://codeforces.net/problemset/problem/1174/E)↵
↵
[And Reachability](https://codeforces.net/problemset/problem/1168/C)↵
↵
[Card Bag](https://codeforces.net/problemset/problem/1156/F)↵
↵
[Leaf Partition](https://codeforces.net/problemset/problem/1146/F)↵
↵
[Sonya and Informatics](https://codeforces.net/problemset/problem/1151/F)↵
↵
[Knapsack](https://codeforces.net/problemset/problem/1132/E)↵
↵
[Power Tree](https://codeforces.net/problemset/problem/1120/D)↵
↵
**Note: If you have some other tutorial links and nice problems, mention them. I'll add them here. It'll help me too.**↵
↵
## Dynamic programming:↵
↵
1. [Topcoder Tutorial](https://www.topcoder.com/community/competitive-programming/tutorials/dynamic-programming-from-novice-to-advanced/)↵
2. [Dynamic Programming,from novice to advanced](https://www.cnblogs.com/drizzlecrj/archive/2007/10/26/939159.html)↵
3. [Learn DP and other tricks](https://www.codechef.com/certification/data-structures-and-algorithms/prepare#foundation)↵
4. [Non-trivial DP tricks](https://codeforces.net/blog/entry/47764)↵
5. [Everything about Dynamic Programming](https://codeforces.net/blog/entry/43256)↵
6. [Digit DP 1](https://codeforces.net/blog/entry/53960)↵
7. [some solutions of digit dp problems](https://codeforces.net/blog/entry/7221)↵
8. [digit Dp for product digits](https://codeforces.net/blog/entry/53286)↵
9. [Digit Dp tutorial bangla](http://shakilcompetitiveprogramming.blogspot.com/2015/09/digit-dp.html)↵
10. [Digit DP hackerrank tutorial](https://www.hackerrank.com/topics/digit-dp)↵
11. [Important problems solutions of Digit DP](http://gautamdegitdp.blogspot.com/)↵
12. [DP on trees](https://codeforces.net/blog/entry/20935)↵
13. [DP on trees problem-3](https://codeforces.net/blog/entry/63257)↵
14. [DP on trees](https://www.commonlounge.com/discussion/8573ee40c4cb4673824c867715a5bc7b)↵
15. [A Tricky DP Problem on Trees](http://rachitiitr.blogspot.com/2017/05/a-tricky-dp-problem-on-trees.html)↵
16. [Bitmask DP](https://www.hackerearth.com/practice/algorithms/dynamic-programming/bit-masking/tutorial/)↵
17. [SOS Dp](https://codeforces.net/blog/entry/45223)↵
18. [Sum Over Subsets](https://www.geeksforgeeks.org/sum-subsets-dynamic-programming/)↵
19. [bitmask dp, buildup sos dp](https://algowarehouse.blogspot.com/2018/01/bitmask-dp-buildup-to-sos-dp-pt-2.html)↵
20. [A little bit of classics: dynamic programming over subsets and paths in graphs](https://codeforces.net/blog/entry/337)↵
↵
### Problems related to Dynamic Programming:↵
You have to solve these problems to develop DP skills↵
↵
#### Simple DP Problems:↵
[Lightoj Problems](http://lightoj.com/volume_problemcategory.php?user_id=43745&category=Dynamic%20Programming)↵
↵
[New Year and the Permutation Concatenation](https://codeforces.net/problemset/problem/1091/D)↵
↵
[Multiply](https://codeforces.net/problemset/problem/1061/C)↵
↵
[Stars Drawing(Easy Version)](https://codeforces.net/problemset/problem/1015/E1)↵
↵
[Consecutive Subsequence](https://codeforces.net/problemset/problem/977/F)↵
↵
[substring](https://codeforces.net/problemset/problem/919/D)↵
↵
[permute Digits](https://codeforces.net/problemset/problem/915/C)↵
↵
[Mike and GCD Problem](https://codeforces.net/problemset/problem/798/C)↵
↵
[Mahmud and message](https://codeforces.net/problemset/problem/766/C)↵
↵
[Travel Card](https://codeforces.net/problemset/problem/756/B)↵
↵
[Coloring Trees](https://codeforces.net/problemset/problem/711/C) ↵
↵
[Robbers' Watch](https://codeforces.net/problemset/problem/685/A)↵
↵
[Alyona And the tree](https://codeforces.net/problemset/problem/682/C)↵
↵
[Geometric Progression](https://codeforces.net/problemset/problem/567/C)↵
↵
[Kyoya and balls](https://codeforces.net/problemset/problem/553/A)↵
↵
[soldier and number game](https://codeforces.net/problemset/problem/546/D)↵
↵
[Animals](https://codeforces.net/problemset/problem/35/D)↵
↵
#### Bitmask DP problems:↵
↵
[Problem 1](http://acm.timus.ru/problem.aspx?space=1&num=1152)↵
↵
[Problem 2](http://acm.timus.ru/problem.aspx?space=1&num=1817)↵
↵
[Problem 3](http://acm.sgu.ru/problem.php?contest=0&problem=527)↵
↵
[Problem 4](http://acm.sgu.ru/problem.php?contest=0&problem=536)↵
↵
[problem 5 ](http://codeforces.net/problemset/problem/8/C)↵
↵
[problem 6](http://codeforces.net/problemset/problem/16/E)↵
↵
[problem 7](http://codeforces.net/problemset/problem/71/E)↵
↵
[Problem 8](https://codeforces.net/problemset/problem/1051/D)↵
↵
#### DP on Trees Problems:↵
↵
[Appleman and Trees](https://codeforces.net/contest/461/problem/B)↵
↵
[Counting On Trees](https://www.hackerearth.com/challenges/competitive/march-clash-15/algorithm/counting-on-tree-1/description/)↵
↵
[Rivers](https://www.iarcs.org.in/inoi/online-study-material/problems/rivers.php)↵
↵
[Coffee shop](https://www.iarcs.org.in/inoi/online-study-material/problems/coffee-shop.php)↵
↵
[mobiles](https://www.iarcs.org.in/inoi/online-study-material/problems/mobiles-apio.php)↵
↵
[Binary Apple Tree](http://acm.timus.ru/problem.aspx?space=1&num=1018)↵
↵
[Tree pruning](https://www.hackerrank.com/challenges/tree-pruning/problem)↵
↵
[Anniveersary Problem](http://acm.timus.ru/problem.aspx?space=1&num=1039)↵
↵
[Berland Fedaralization](https://codeforces.net/contest/440/problem/D)↵
↵
#### Some Hard DP Problems:↵
↵
[Complete Mirror](https://codeforces.net/problemset/problem/1182/D)↵
↵
[Destroy it!](https://codeforces.net/problemset/problem/1176/F)↵
↵
[Nauuo and Pictures (easy version)](https://codeforces.net/problemset/problem/1172/C1)↵
↵
[Ehab and the Expected GCD Problem](https://codeforces.net/problemset/problem/1174/E)↵
↵
[And Reachability](https://codeforces.net/problemset/problem/1168/C)↵
↵
[Card Bag](https://codeforces.net/problemset/problem/1156/F)↵
↵
[Leaf Partition](https://codeforces.net/problemset/problem/1146/F)↵
↵
[Sonya and Informatics](https://codeforces.net/problemset/problem/1151/F)↵
↵
[Knapsack](https://codeforces.net/problemset/problem/1132/E)↵
↵
[Power Tree](https://codeforces.net/problemset/problem/1120/D)↵
