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://mirror.codeforces.com/blog/entry/47764)↵
5. [Everything about Dynamic Programming](https://mirror.codeforces.com/blog/entry/43256)↵
6. [Digit DP 1](https://mirror.codeforces.com/blog/entry/53960)↵
7. [some solutions of digit dp problems](https://mirror.codeforces.com/blog/entry/7221)↵
8. [digit Dp for product digits](https://mirror.codeforces.com/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://mirror.codeforces.com/blog/entry/20935)↵
13. [DP on trees problem-3](https://mirror.codeforces.com/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://mirror.codeforces.com/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://mirror.codeforces.com/blog/entry/337)↵
21. [Coin Problems](https://medium.com/@harryjobz/coin-problem-lets-code-2-0-83b607bdcfdc)↵
22. [nice DP problem Editorial](https://medium.com/spidernitt/problem-c-codeforces-round-455-293ac65c10d6)↵
23. [Subsequence related Problem solution](https://medium.com/@harryjobz/subsequence-of-length-3-2766e834303b)↵
24. [Smallest Word problem tutorial](https://medium.com/spidernitt/smallest-word-e98611c09555)↵
↵
### Dynamic Programming related contests:↵
↵
* [Atcoder Dp contest](https://atcoder.jp/contests/dp)↵
↵
### Problems related to Dynamic Programming:↵
You have to solve these problems to develop DP skills↵
↵
#### Simple DP Problems:↵
1. [Lightoj Problems](http://lightoj.com/volume_problemcategory.php?user_id=43745&category=Dynamic%20Programming)↵
2. [New Year and the Permutation Concatenation](https://mirror.codeforces.com/problemset/problem/1091/D)↵
3. [Multiply](https://mirror.codeforces.com/problemset/problem/1061/C)↵
4. [Stars Drawing(Easy Version)](https://mirror.codeforces.com/problemset/problem/1015/E1)↵
5. [Consecutive Subsequence](https://mirror.codeforces.com/problemset/problem/977/F)↵
6. [substring](https://mirror.codeforces.com/problemset/problem/919/D)↵
7. [permute Digits](https://mirror.codeforces.com/problemset/problem/915/C)↵
8. [Mike and GCD Problem](https://mirror.codeforces.com/problemset/problem/798/C)↵
9. [Mahmud and message](https://mirror.codeforces.com/problemset/problem/766/C)↵
10. [Travel Card](https://mirror.codeforces.com/problemset/problem/756/B)↵
11. [Coloring Trees](https://mirror.codeforces.com/problemset/problem/711/C) ↵
12. [Robbers' Watch](https://mirror.codeforces.com/problemset/problem/685/A)↵
13. [Alyona And the tree](https://mirror.codeforces.com/problemset/problem/682/C)↵
14. [Geometric Progression](https://mirror.codeforces.com/problemset/problem/567/C)↵
15. [Kyoya and balls](https://mirror.codeforces.com/problemset/problem/553/A)↵
16. [soldier and number game](https://mirror.codeforces.com/problemset/problem/546/D)↵
17. [Animals](https://mirror.codeforces.com/problemset/problem/35/D)↵
↵
#### Bitmask DP problems:↵
↵
1. [Problem 1](http://acm.timus.ru/problem.aspx?space=1&num=1152)↵
2. [Problem 2](http://acm.timus.ru/problem.aspx?space=1&num=1817)↵
3. [Problem 3](http://acm.sgu.ru/problem.php?contest=0&problem=527)↵
4. [Problem 4](http://acm.sgu.ru/problem.php?contest=0&problem=536)↵
5. [problem 5 ](http://mirror.codeforces.com/problemset/problem/8/C)↵
6. [problem 6](http://mirror.codeforces.com/problemset/problem/16/E)↵
7. [problem 7](http://mirror.codeforces.com/problemset/problem/71/E)↵
8. [Problem 8](https://mirror.codeforces.com/problemset/problem/1051/D)↵
↵
#### DP on Trees Problems:↵
↵
1. [Appleman and Trees](https://mirror.codeforces.com/contest/461/problem/B)↵
2. [Counting On Trees](https://www.hackerearth.com/challenges/competitive/march-clash-15/algorithm/counting-on-tree-1/description/)↵
3. [Rivers](https://www.iarcs.org.in/inoi/online-study-material/problems/rivers.php)↵
4. [Coffee shop](https://www.iarcs.org.in/inoi/online-study-material/problems/coffee-shop.php)↵
5. [mobiles](https://www.iarcs.org.in/inoi/online-study-material/problems/mobiles-apio.php)↵
6. [Binary Apple Tree](http://acm.timus.ru/problem.aspx?space=1&num=1018)↵
7. [Tree pruning](https://www.hackerrank.com/challenges/tree-pruning/problem)↵
8. [Anniveersary Problem](http://acm.timus.ru/problem.aspx?space=1&num=1039)↵
9. [Berland Fedaralization](https://mirror.codeforces.com/contest/440/problem/D)↵
↵
#### Some Hard DP Problems:↵
↵
1. [Complete Mirror](https://mirror.codeforces.com/problemset/problem/1182/D)↵
2. [Destroy it!](https://mirror.codeforces.com/problemset/problem/1176/F)↵
3. [Nauuo and Pictures (easy version)](https://mirror.codeforces.com/problemset/problem/1172/C1)↵
4. [Ehab and the Expected GCD Problem](https://mirror.codeforces.com/problemset/problem/1174/E)↵
5. [And Reachability](https://mirror.codeforces.com/problemset/problem/1168/C)↵
6. [Card Bag](https://mirror.codeforces.com/problemset/problem/1156/F)↵
7. [Leaf Partition](https://mirror.codeforces.com/problemset/problem/1146/F)↵
8. [Sonya and Informatics](https://mirror.codeforces.com/problemset/problem/1151/F)↵
9. [Knapsack](https://mirror.codeforces.com/problemset/problem/1132/E)↵
10. [Power Tree](https://mirror.codeforces.com/problemset/problem/1120/D)↵
↵
#### Additional Problems↵
1. [Bob and K — Subset](https://www.hackerearth.com/practice/basic-programming/implementation/basics-of-implementation/practice-problems/algorithm/bob-and-subset-23f0729c/)↵
2. [Road](https://www.hackerearth.com/challenges/competitive/january-circuits-18/algorithm/road-1-63e2e618/)↵
3. [A Race Against Time](https://www.hackerrank.com/contests/w36/challenges/a-race-against-time)↵
4. [Nuske vs Phantom Thnook](https://agc015.contest.atcoder.jp/tasks/agc015_c)↵
5. [Xor Pyramid](https://mirror.codeforces.com/contest/983/problem/B)↵
6. [Rain and Umbrellas](https://mirror.codeforces.com/contest/988/problem/F)↵
7. [Equal](https://www.hackerrank.com/challenges/equal/problem)↵
↵
* [Different types of Dynamic programming problems in one blog](https://mirror.codeforces.com/blog/entry/325)↵
↵
↵
Thank You So Much.↵
↵
**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://mirror.codeforces.com/blog/entry/47764)↵
5. [Everything about Dynamic Programming](https://mirror.codeforces.com/blog/entry/43256)↵
6. [Digit DP 1](https://mirror.codeforces.com/blog/entry/53960)↵
7. [some solutions of digit dp problems](https://mirror.codeforces.com/blog/entry/7221)↵
8. [digit Dp for product digits](https://mirror.codeforces.com/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://mirror.codeforces.com/blog/entry/20935)↵
13. [DP on trees problem-3](https://mirror.codeforces.com/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://mirror.codeforces.com/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://mirror.codeforces.com/blog/entry/337)↵
21. [Coin Problems](https://medium.com/@harryjobz/coin-problem-lets-code-2-0-83b607bdcfdc)↵
22. [nice DP problem Editorial](https://medium.com/spidernitt/problem-c-codeforces-round-455-293ac65c10d6)↵
23. [Subsequence related Problem solution](https://medium.com/@harryjobz/subsequence-of-length-3-2766e834303b)↵
24. [Smallest Word problem tutorial](https://medium.com/spidernitt/smallest-word-e98611c09555)↵
↵
### Dynamic Programming related contests:↵
↵
* [Atcoder Dp contest](https://atcoder.jp/contests/dp)↵
↵
### Problems related to Dynamic Programming:↵
You have to solve these problems to develop DP skills↵
↵
#### Simple DP Problems:↵
1. [Lightoj Problems](http://lightoj.com/volume_problemcategory.php?user_id=43745&category=Dynamic%20Programming)↵
2. [New Year and the Permutation Concatenation](https://mirror.codeforces.com/problemset/problem/1091/D)↵
3. [Multiply](https://mirror.codeforces.com/problemset/problem/1061/C)↵
4. [Stars Drawing(Easy Version)](https://mirror.codeforces.com/problemset/problem/1015/E1)↵
5. [Consecutive Subsequence](https://mirror.codeforces.com/problemset/problem/977/F)↵
6. [substring](https://mirror.codeforces.com/problemset/problem/919/D)↵
7. [permute Digits](https://mirror.codeforces.com/problemset/problem/915/C)↵
8. [Mike and GCD Problem](https://mirror.codeforces.com/problemset/problem/798/C)↵
9. [Mahmud and message](https://mirror.codeforces.com/problemset/problem/766/C)↵
10. [Travel Card](https://mirror.codeforces.com/problemset/problem/756/B)↵
11. [Coloring Trees](https://mirror.codeforces.com/problemset/problem/711/C) ↵
12. [Robbers' Watch](https://mirror.codeforces.com/problemset/problem/685/A)↵
13. [Alyona And the tree](https://mirror.codeforces.com/problemset/problem/682/C)↵
14. [Geometric Progression](https://mirror.codeforces.com/problemset/problem/567/C)↵
15. [Kyoya and balls](https://mirror.codeforces.com/problemset/problem/553/A)↵
16. [soldier and number game](https://mirror.codeforces.com/problemset/problem/546/D)↵
17. [Animals](https://mirror.codeforces.com/problemset/problem/35/D)↵
↵
#### Bitmask DP problems:↵
↵
1. [Problem 1](http://acm.timus.ru/problem.aspx?space=1&num=1152)↵
2. [Problem 2](http://acm.timus.ru/problem.aspx?space=1&num=1817)↵
3. [Problem 3](http://acm.sgu.ru/problem.php?contest=0&problem=527)↵
4. [Problem 4](http://acm.sgu.ru/problem.php?contest=0&problem=536)↵
5. [problem 5 ](http://mirror.codeforces.com/problemset/problem/8/C)↵
6. [problem 6](http://mirror.codeforces.com/problemset/problem/16/E)↵
7. [problem 7](http://mirror.codeforces.com/problemset/problem/71/E)↵
8. [Problem 8](https://mirror.codeforces.com/problemset/problem/1051/D)↵
↵
#### DP on Trees Problems:↵
↵
1. [Appleman and Trees](https://mirror.codeforces.com/contest/461/problem/B)↵
2. [Counting On Trees](https://www.hackerearth.com/challenges/competitive/march-clash-15/algorithm/counting-on-tree-1/description/)↵
3. [Rivers](https://www.iarcs.org.in/inoi/online-study-material/problems/rivers.php)↵
4. [Coffee shop](https://www.iarcs.org.in/inoi/online-study-material/problems/coffee-shop.php)↵
5. [mobiles](https://www.iarcs.org.in/inoi/online-study-material/problems/mobiles-apio.php)↵
6. [Binary Apple Tree](http://acm.timus.ru/problem.aspx?space=1&num=1018)↵
7. [Tree pruning](https://www.hackerrank.com/challenges/tree-pruning/problem)↵
8. [Anniveersary Problem](http://acm.timus.ru/problem.aspx?space=1&num=1039)↵
9. [Berland Fedaralization](https://mirror.codeforces.com/contest/440/problem/D)↵
↵
#### Some Hard DP Problems:↵
↵
1. [Complete Mirror](https://mirror.codeforces.com/problemset/problem/1182/D)↵
2. [Destroy it!](https://mirror.codeforces.com/problemset/problem/1176/F)↵
3. [Nauuo and Pictures (easy version)](https://mirror.codeforces.com/problemset/problem/1172/C1)↵
4. [Ehab and the Expected GCD Problem](https://mirror.codeforces.com/problemset/problem/1174/E)↵
5. [And Reachability](https://mirror.codeforces.com/problemset/problem/1168/C)↵
6. [Card Bag](https://mirror.codeforces.com/problemset/problem/1156/F)↵
7. [Leaf Partition](https://mirror.codeforces.com/problemset/problem/1146/F)↵
8. [Sonya and Informatics](https://mirror.codeforces.com/problemset/problem/1151/F)↵
9. [Knapsack](https://mirror.codeforces.com/problemset/problem/1132/E)↵
10. [Power Tree](https://mirror.codeforces.com/problemset/problem/1120/D)↵
↵
#### Additional Problems↵
1. [Bob and K — Subset](https://www.hackerearth.com/practice/basic-programming/implementation/basics-of-implementation/practice-problems/algorithm/bob-and-subset-23f0729c/)↵
2. [Road](https://www.hackerearth.com/challenges/competitive/january-circuits-18/algorithm/road-1-63e2e618/)↵
3. [A Race Against Time](https://www.hackerrank.com/contests/w36/challenges/a-race-against-time)↵
4. [Nuske vs Phantom Thnook](https://agc015.contest.atcoder.jp/tasks/agc015_c)↵
5. [Xor Pyramid](https://mirror.codeforces.com/contest/983/problem/B)↵
6. [Rain and Umbrellas](https://mirror.codeforces.com/contest/988/problem/F)↵
7. [Equal](https://www.hackerrank.com/challenges/equal/problem)↵
↵
* [Different types of Dynamic programming problems in one blog](https://mirror.codeforces.com/blog/entry/325)↵
↵
↵
Thank You So Much.↵
