algorithms & ds - competitive programming problems set (c++ solutions_base - dynamic programming)

Author: florist-notes

competitive_prog/code/dynamic_p.MD

@@ -215,4 +215,7 @@ Directed Acyclic Graphs : LIS = Longest path in DAG + 1. LIS [4] = 1 + max { LIS
 
 <img src="img/boxstack_algo.png" width=100%>
 
-Resources : [ Video : [5 Simple Steps for Solving Dynamic Programming Problems](https://youtu.be/aPQY__2H3tE?si=5E-UJDxwCPKKrxC7), Mastering Dynamic Programming - How to solve any interview problem - [(Part 1)](https://youtu.be/Hdr64lKQ3e4?si=gyxiDKqWIzPo_EGx), [(Part 2)](https://youtu.be/rE5h11FwiVw?si=Bv5AKug6xIZOJjwV), NeetCode - [Dynamic Programming](https://www.youtube.com/watch?v=g0npyaQtAQM&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO), [Dynamic Programming - Learn to Solve Algorithmic Problems & Coding Challenges](https://youtu.be/oBt53YbR9Kk?si=kKhLpcDl7AAf1oVH), [DP Series](https://www.youtube.com/watch?v=PGsgv6nXhLw&list=PLDzeHZWIZsTomOPnCiU3J95WufjE36wsb), hackerEarth - [Dynamic Programming](https://www.hackerearth.com/practice/algorithms/dynamic-programming/introduction-to-dynamic-programming-1/tutorial/), leetcode - [Dynamic Programming](https://leetcode.com/tag/dynamic-programming/) ]
+Resources : [ Video : [5 Simple Steps for Solving Dynamic Programming Problems](https://youtu.be/aPQY__2H3tE?si=5E-UJDxwCPKKrxC7), Mastering Dynamic Programming - How to solve any interview problem - [(Part 1)](https://youtu.be/Hdr64lKQ3e4?si=gyxiDKqWIzPo_EGx), [(Part 2)](https://youtu.be/rE5h11FwiVw?si=Bv5AKug6xIZOJjwV), NeetCode - [Dynamic Programming](https://www.youtube.com/watch?v=g0npyaQtAQM&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO), [Dynamic Programming - Learn to Solve Algorithmic Problems & Coding Challenges](https://youtu.be/oBt53YbR9Kk?si=kKhLpcDl7AAf1oVH), [DP Series](https://www.youtube.com/watch?v=PGsgv6nXhLw&list=PLDzeHZWIZsTomOPnCiU3J95WufjE36wsb), hackerEarth - [Dynamic Programming](https://www.hackerearth.com/practice/algorithms/dynamic-programming/introduction-to-dynamic-programming-1/tutorial/), leetcode - [Dynamic Programming](https://leetcode.com/tag/dynamic-programming/) ]
+
+Read : [ [Dynamic Programming (DP) Tutorial with Problems](https://www.geeksforgeeks.org/introduction-to-dynamic-programming-data-structures-and-algorithm-tutorials/), [DP Tutorial and Problem List](https://codeforces.com/blog/entry/67679), [Must do Dynamic programming Problems Category wise](https://leetcode.com/discuss/general-discussion/1050391/Must-do-Dynamic-programming-Problems-Category-wise), [Everything About Dynamic Programming](https://codeforces.com/blog/entry/43256), [Dynamic Programming Problems](https://leetcode.com/discuss/general-discussion/1000929/solved-all-dynamic-programming-dp-problems-in-7-months), [The Ultimate Guide to Dynamic Programming](https://medium.com/@al.eks/the-ultimate-guide-to-dynamic-programming-65865ef7ec5b), [DYNAMIC PROGRAMMING: FROM NOVICE TO ADVANCED](https://www.topcoder.com/thrive/articles/Dynamic%20Programming:%20From%20Novice%20to%20Advanced), [Dynamic Programming Algorithms Every Programmer Should Know](https://dev.to/rishitashaw/dynamic-programming-algorithms-every-programmer-should-know-3915), [
+Dynamic Programming Patterns](https://leetcode.com/discuss/general-discussion/458695/Dynamic-Programming-Patterns), [Top 50 Dynamic Programming Practice Problems](https://medium.com/techie-delight/top-50-dynamic-programming-practice-problems-4208fed71aa3) ]

competitive_prog/dsalgo.MD

@@ -129,6 +129,8 @@ Graph Algorithms [ [NOTES](./code/graph_base.MD) ] </th>
     + Knapsack Problems
     + From Permutations to Subsets
     + Counting Tilings
+
+[ [How to Solve Any Dynamic Programming Problem](https://blog.pramp.com/how-to-solve-any-dynamic-programming-problem-603b6fbbd771) ]
 </td>
 <td>