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:↵
↵
* [Topcoder Tutorial](https://www.topcoder.com/community/competitive-programming/tutorials/dynamic-programming-from-novice-to-advanced/)↵
* [Dynamic Programming,from novice to advanced](https://www.cnblogs.com/drizzlecrj/archive/2007/10/26/939159.html)↵
* [Learn DP and other tricks](https://www.codechef.com/certification/data-structures-and-algorithms/prepare#foundation)↵
* [Non-trivial DP tricks](https://codeforces.me/blog/entry/47764)↵
* [Everything about Dynamic Programming](https://codeforces.me/blog/entry/43256)↵
* [Digit DP 1](https://codeforces.me/blog/entry/53960)↵
* [some solutions of digit dp problems](https://codeforces.me/blog/entry/7221)↵
* [digit Dp for product digits](https://codeforces.me/blog/entry/53286)↵
* [Digit Dp tutorial bangla](http://shakilcompetitiveprogramming.blogspot.com/2015/09/digit-dp.html)↵
* [Digit DP hackerrank tutorial](https://www.hackerrank.com/topics/digit-dp)↵
* [Important problems solutions of Digit DP](http://gautamdegitdp.blogspot.com/)↵
* [DP on trees](https://codeforces.me/blog/entry/20935)↵
* [DP on trees problem-3](https://codeforces.me/blog/entry/63257)↵
* [DP on trees](https://www.commonlounge.com/discussion/8573ee40c4cb4673824c867715a5bc7b)↵
* [A Tricky DP Problem on Trees](http://rachitiitr.blogspot.com/2017/05/a-tricky-dp-problem-on-trees.html)↵
* [Bitmask DP](https://www.hackerearth.com/practice/algorithms/dynamic-programming/bit-masking/tutorial/)↵
* [SOS Dp](https://codeforces.me/blog/entry/45223)↵
* [Sum Over Subsets](https://www.geeksforgeeks.org/sum-subsets-dynamic-programming/)↵
* [bitmask dp, buildup sos dp](https://algowarehouse.blogspot.com/2018/01/bitmask-dp-buildup-to-sos-dp-pt-2.html)↵
* [A little bit of classics: dynamic programming over subsets and paths in graphs](https://codeforces.me/blog/entry/337)↵
* [Coin Problems](https://medium.com/@harryjobz/coin-problem-lets-code-2-0-83b607bdcfdc)↵
* [nice DP problem Editorial](https://medium.com/spidernitt/problem-c-codeforces-round-455-293ac65c10d6)↵
* [Subsequence related Problem solution](https://medium.com/@harryjobz/subsequence-of-length-3-2766e834303b)↵
* [Smallest Word problem tutorial](https://medium.com/spidernitt/smallest-word-e98611c09555)↵
* [codechef Dp tutorials](https://www.codechef.com/wiki/tutorial-dynamic-programming)↵
* [starting Dynamic Programming](https://www.quora.com/How-can-one-start-solving-dynamic-programming-problems)↵
* [Introduction to DP-1 (hackerrank)](https://www.hackerearth.com/practice/algorithms/dynamic-programming/introduction-to-dynamic-programming-1/tutorial/)↵
* [A brief Introduction to DP](https://drive.google.com/file/d/1K68sWVc5e4MnyACr2i5sLKWIhShn638S/view)↵
* [Dp tutorials](https://vplanetcoding.com/course2#698A)↵
* [DP strategy](https://www.quora.com/How-can-I-be-perfect-in-dynamic-programming-How-should-I-practice/answer/Bohdan-Pryshchenko?ch=10&share=9a742611&srid=DDSy)↵
↵
↵
### Dynamic Programming Youtube Tutorials:↵
* [Algorithms Series | Session 3 | Dynamic Programming (Arabic)](https://www.youtube.com/watch?v=34Drti_iMsg)↵
* [Dynamic programming I (Arabic)](https://www.youtube.com/watch?v=TNgPT91sn90)↵
* [DP playlist(Arabic)](https://www.youtube.com/playlist?list=PLPt2dINI2MIattDutu7IOAMlUuLeN8k2p)↵
* [DP playlist2(Arabic)](https://www.youtube.com/playlist?list=PLPSFnlxEu99Gc6mSTVoYzPG77tnUW8znJ)↵
* [Atcoder DP contest solutions by Errichto](https://www.youtube.com/watch?v=FAQxdm0bTaw&t=312s)↵
* [DP playlist(English)](https://www.youtube.com/playlist?list=PLamzFoFxwoNjtJZoNNAlYQ_Ixmm2s-CGX)↵
* [DP playlist (created by gkcs, English)](https://www.youtube.com/playlist?list=PLMCXHnjXnTnto1pZVvH7rbZ9W5neZ7Yhc)↵
* [DP playlist2(English)](https://www.youtube.com/playlist?list=PLiQ766zSC5jM2OKVr8sooOuGgZkvnOCTI)↵
* [DP playlist3(Englush)](https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr)↵
* [Dp playlist4(English)](https://www.youtube.com/playlist?list=PLJULIlvhz0rE83NKhnq7acXYIeA0o1dXb)↵
* [DP playlist5(English)](https://www.youtube.com/playlist?list=PLqM7alHXFySGbXhWx7sBJEwY2DnhDjmxm)↵
* [DP playlist6(English)](https://www.youtube.com/playlist?list=PLfBJlB6T2eOtMXgK3FLUTawHjzpIEySHF)↵
* [DP playlist7(English)](https://www.youtube.com/playlist?list=PLawezQIZQjju9cZPjjD1vQK8IuNxcRD8u)↵
* [DP MIT open course](https://www.youtube.com/playlist?list=PLZDUDpMlJOnzqEo45zDQjuZqv2PGRNHI1)↵
* [Atcoder DP contest stream](https://www.youtube.com/watch?v=FAQxdm0bTaw)↵
* [vplanet DP tutorials](https://www.youtube.com/channel/UCdNNY8Y8meG3z9Wy6MTzcLg/videos)↵
* [Algorithms Live](https://www.youtube.com/channel/UCBLr7ISa_YDy5qeATupf26w/featured)↵
↵
↵
### Dynamic Programming related contests:↵
↵
* [Atcoder Dp contest](https://atcoder.jp/contests/dp)↵
* [Marathan Dp Contest(cloned)](https://vjudge.net/contest/202878)↵
↵
### 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.me/problemset/problem/1091/D)↵
* [Multiply](https://codeforces.me/problemset/problem/1061/C)↵
* [Stars Drawing(Easy Version)](https://codeforces.me/problemset/problem/1015/E1)↵
* [Consecutive Subsequence](https://codeforces.me/problemset/problem/977/F)↵
* [substring](https://codeforces.me/problemset/problem/919/D)↵
* [permute Digits](https://codeforces.me/problemset/problem/915/C)↵
* [Mike and GCD Problem](https://codeforces.me/problemset/problem/798/C)↵
* [Mahmud and message](https://codeforces.me/problemset/problem/766/C)↵
* [Travel Card](https://codeforces.me/problemset/problem/756/B)↵
* [Coloring Trees](https://codeforces.me/problemset/problem/711/C) ↵
* [Robbers' Watch](https://codeforces.me/problemset/problem/685/A)↵
* [Alyona And the tree](https://codeforces.me/problemset/problem/682/C)↵
* [Geometric Progression](https://codeforces.me/problemset/problem/567/C)↵
* [Kyoya and balls](https://codeforces.me/problemset/problem/553/A)↵
* [soldier and number game](https://codeforces.me/problemset/problem/546/D)↵
* [Animals](https://codeforces.me/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.me/problemset/problem/8/C)↵
* [problem 6](http://codeforces.me/problemset/problem/16/E)↵
* [problem 7](http://codeforces.me/problemset/problem/71/E)↵
* [Problem 8](https://codeforces.me/problemset/problem/1051/D)↵
↵
#### DP on Trees Problems:↵
↵
* [Appleman and Trees](https://codeforces.me/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.me/contest/440/problem/D)↵
↵
#### Some Hard DP Problems:↵
↵
* [Complete Mirror](https://codeforces.me/problemset/problem/1182/D)↵
* [Destroy it!](https://codeforces.me/problemset/problem/1176/F)↵
* [Nauuo and Pictures (easy version)](https://codeforces.me/problemset/problem/1172/C1)↵
* [Ehab and the Expected GCD Problem](https://codeforces.me/problemset/problem/1174/E)↵
* [And Reachability](https://codeforces.me/problemset/problem/1168/C)↵
* [Card Bag](https://codeforces.me/problemset/problem/1156/F)↵
* [Leaf Partition](https://codeforces.me/problemset/problem/1146/F)↵
* [Sonya and Informatics](https://codeforces.me/problemset/problem/1151/F)↵
* [Knapsack](https://codeforces.me/problemset/problem/1132/E)↵
* [Power Tree](https://codeforces.me/problemset/problem/1120/D)↵
↵
#### Additional Problems↵
* [Good DP Problems](https://codeforces.me/blog/entry/20284)↵
* [Bob and K — Subset](https://www.hackerearth.com/practice/basic-programming/implementation/basics-of-implementation/practice-problems/algorithm/bob-and-subset-23f0729c/)↵
* [Road](https://www.hackerearth.com/challenges/competitive/january-circuits-18/algorithm/road-1-63e2e618/)↵
* [A Race Against Time](https://www.hackerrank.com/contests/w36/challenges/a-race-against-time)↵
* [Nuske vs Phantom Thnook](https://agc015.contest.atcoder.jp/tasks/agc015_c)↵
* [Xor Pyramid](https://codeforces.me/contest/983/problem/B)↵
* [Rain and Umbrellas](https://codeforces.me/contest/988/problem/F)↵
* [Equal](https://www.hackerrank.com/challenges/equal/problem)↵
↵
* [Different types of Dynamic programming problems in one blog](https://codeforces.me/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:↵
↵
* [Topcoder Tutorial](https://www.topcoder.com/community/competitive-programming/tutorials/dynamic-programming-from-novice-to-advanced/)↵
* [Dynamic Programming,from novice to advanced](https://www.cnblogs.com/drizzlecrj/archive/2007/10/26/939159.html)↵
* [Learn DP and other tricks](https://www.codechef.com/certification/data-structures-and-algorithms/prepare#foundation)↵
* [Non-trivial DP tricks](https://codeforces.me/blog/entry/47764)↵
* [Everything about Dynamic Programming](https://codeforces.me/blog/entry/43256)↵
* [Digit DP 1](https://codeforces.me/blog/entry/53960)↵
* [some solutions of digit dp problems](https://codeforces.me/blog/entry/7221)↵
* [digit Dp for product digits](https://codeforces.me/blog/entry/53286)↵
* [Digit Dp tutorial bangla](http://shakilcompetitiveprogramming.blogspot.com/2015/09/digit-dp.html)↵
* [Digit DP hackerrank tutorial](https://www.hackerrank.com/topics/digit-dp)↵
* [Important problems solutions of Digit DP](http://gautamdegitdp.blogspot.com/)↵
* [DP on trees](https://codeforces.me/blog/entry/20935)↵
* [DP on trees problem-3](https://codeforces.me/blog/entry/63257)↵
* [DP on trees](https://www.commonlounge.com/discussion/8573ee40c4cb4673824c867715a5bc7b)↵
* [A Tricky DP Problem on Trees](http://rachitiitr.blogspot.com/2017/05/a-tricky-dp-problem-on-trees.html)↵
* [Bitmask DP](https://www.hackerearth.com/practice/algorithms/dynamic-programming/bit-masking/tutorial/)↵
* [SOS Dp](https://codeforces.me/blog/entry/45223)↵
* [Sum Over Subsets](https://www.geeksforgeeks.org/sum-subsets-dynamic-programming/)↵
* [bitmask dp, buildup sos dp](https://algowarehouse.blogspot.com/2018/01/bitmask-dp-buildup-to-sos-dp-pt-2.html)↵
* [A little bit of classics: dynamic programming over subsets and paths in graphs](https://codeforces.me/blog/entry/337)↵
* [Coin Problems](https://medium.com/@harryjobz/coin-problem-lets-code-2-0-83b607bdcfdc)↵
* [nice DP problem Editorial](https://medium.com/spidernitt/problem-c-codeforces-round-455-293ac65c10d6)↵
* [Subsequence related Problem solution](https://medium.com/@harryjobz/subsequence-of-length-3-2766e834303b)↵
* [Smallest Word problem tutorial](https://medium.com/spidernitt/smallest-word-e98611c09555)↵
* [codechef Dp tutorials](https://www.codechef.com/wiki/tutorial-dynamic-programming)↵
* [starting Dynamic Programming](https://www.quora.com/How-can-one-start-solving-dynamic-programming-problems)↵
* [Introduction to DP-1 (hackerrank)](https://www.hackerearth.com/practice/algorithms/dynamic-programming/introduction-to-dynamic-programming-1/tutorial/)↵
* [A brief Introduction to DP](https://drive.google.com/file/d/1K68sWVc5e4MnyACr2i5sLKWIhShn638S/view)↵
* [Dp tutorials](https://vplanetcoding.com/course2#698A)↵
* [DP strategy](https://www.quora.com/How-can-I-be-perfect-in-dynamic-programming-How-should-I-practice/answer/Bohdan-Pryshchenko?ch=10&share=9a742611&srid=DDSy)↵
↵
↵
### Dynamic Programming Youtube Tutorials:↵
* [Algorithms Series | Session 3 | Dynamic Programming (Arabic)](https://www.youtube.com/watch?v=34Drti_iMsg)↵
* [Dynamic programming I (Arabic)](https://www.youtube.com/watch?v=TNgPT91sn90)↵
* [DP playlist(Arabic)](https://www.youtube.com/playlist?list=PLPt2dINI2MIattDutu7IOAMlUuLeN8k2p)↵
* [DP playlist2(Arabic)](https://www.youtube.com/playlist?list=PLPSFnlxEu99Gc6mSTVoYzPG77tnUW8znJ)↵
* [Atcoder DP contest solutions by Errichto](https://www.youtube.com/watch?v=FAQxdm0bTaw&t=312s)↵
* [DP playlist(English)](https://www.youtube.com/playlist?list=PLamzFoFxwoNjtJZoNNAlYQ_Ixmm2s-CGX)↵
* [DP playlist (created by gkcs, English)](https://www.youtube.com/playlist?list=PLMCXHnjXnTnto1pZVvH7rbZ9W5neZ7Yhc)↵
* [DP playlist2(English)](https://www.youtube.com/playlist?list=PLiQ766zSC5jM2OKVr8sooOuGgZkvnOCTI)↵
* [DP playlist3(Englush)](https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr)↵
* [Dp playlist4(English)](https://www.youtube.com/playlist?list=PLJULIlvhz0rE83NKhnq7acXYIeA0o1dXb)↵
* [DP playlist5(English)](https://www.youtube.com/playlist?list=PLqM7alHXFySGbXhWx7sBJEwY2DnhDjmxm)↵
* [DP playlist6(English)](https://www.youtube.com/playlist?list=PLfBJlB6T2eOtMXgK3FLUTawHjzpIEySHF)↵
* [DP playlist7(English)](https://www.youtube.com/playlist?list=PLawezQIZQjju9cZPjjD1vQK8IuNxcRD8u)↵
* [DP MIT open course](https://www.youtube.com/playlist?list=PLZDUDpMlJOnzqEo45zDQjuZqv2PGRNHI1)↵
* [Atcoder DP contest stream](https://www.youtube.com/watch?v=FAQxdm0bTaw)↵
* [vplanet DP tutorials](https://www.youtube.com/channel/UCdNNY8Y8meG3z9Wy6MTzcLg/videos)↵
* [Algorithms Live](https://www.youtube.com/channel/UCBLr7ISa_YDy5qeATupf26w/featured)↵
↵
↵
### Dynamic Programming related contests:↵
↵
* [Atcoder Dp contest](https://atcoder.jp/contests/dp)↵
* [Marathan Dp Contest(cloned)](https://vjudge.net/contest/202878)↵
↵
### 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.me/problemset/problem/1091/D)↵
* [Multiply](https://codeforces.me/problemset/problem/1061/C)↵
* [Stars Drawing(Easy Version)](https://codeforces.me/problemset/problem/1015/E1)↵
* [Consecutive Subsequence](https://codeforces.me/problemset/problem/977/F)↵
* [substring](https://codeforces.me/problemset/problem/919/D)↵
* [permute Digits](https://codeforces.me/problemset/problem/915/C)↵
* [Mike and GCD Problem](https://codeforces.me/problemset/problem/798/C)↵
* [Mahmud and message](https://codeforces.me/problemset/problem/766/C)↵
* [Travel Card](https://codeforces.me/problemset/problem/756/B)↵
* [Coloring Trees](https://codeforces.me/problemset/problem/711/C) ↵
* [Robbers' Watch](https://codeforces.me/problemset/problem/685/A)↵
* [Alyona And the tree](https://codeforces.me/problemset/problem/682/C)↵
* [Geometric Progression](https://codeforces.me/problemset/problem/567/C)↵
* [Kyoya and balls](https://codeforces.me/problemset/problem/553/A)↵
* [soldier and number game](https://codeforces.me/problemset/problem/546/D)↵
* [Animals](https://codeforces.me/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.me/problemset/problem/8/C)↵
* [problem 6](http://codeforces.me/problemset/problem/16/E)↵
* [problem 7](http://codeforces.me/problemset/problem/71/E)↵
* [Problem 8](https://codeforces.me/problemset/problem/1051/D)↵
↵
#### DP on Trees Problems:↵
↵
* [Appleman and Trees](https://codeforces.me/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.me/contest/440/problem/D)↵
↵
#### Some Hard DP Problems:↵
↵
* [Complete Mirror](https://codeforces.me/problemset/problem/1182/D)↵
* [Destroy it!](https://codeforces.me/problemset/problem/1176/F)↵
* [Nauuo and Pictures (easy version)](https://codeforces.me/problemset/problem/1172/C1)↵
* [Ehab and the Expected GCD Problem](https://codeforces.me/problemset/problem/1174/E)↵
* [And Reachability](https://codeforces.me/problemset/problem/1168/C)↵
* [Card Bag](https://codeforces.me/problemset/problem/1156/F)↵
* [Leaf Partition](https://codeforces.me/problemset/problem/1146/F)↵
* [Sonya and Informatics](https://codeforces.me/problemset/problem/1151/F)↵
* [Knapsack](https://codeforces.me/problemset/problem/1132/E)↵
* [Power Tree](https://codeforces.me/problemset/problem/1120/D)↵
↵
#### Additional Problems↵
* [Good DP Problems](https://codeforces.me/blog/entry/20284)↵
* [Bob and K — Subset](https://www.hackerearth.com/practice/basic-programming/implementation/basics-of-implementation/practice-problems/algorithm/bob-and-subset-23f0729c/)↵
* [Road](https://www.hackerearth.com/challenges/competitive/january-circuits-18/algorithm/road-1-63e2e618/)↵
* [A Race Against Time](https://www.hackerrank.com/contests/w36/challenges/a-race-against-time)↵
* [Nuske vs Phantom Thnook](https://agc015.contest.atcoder.jp/tasks/agc015_c)↵
* [Xor Pyramid](https://codeforces.me/contest/983/problem/B)↵
* [Rain and Umbrellas](https://codeforces.me/contest/988/problem/F)↵
* [Equal](https://www.hackerrank.com/challenges/equal/problem)↵
↵
* [Different types of Dynamic programming problems in one blog](https://codeforces.me/blog/entry/325)↵
↵
↵
Thank You So Much.↵
