## ULTIMATE DP SERIES LINK DROP!↵
↵
## Now Video Lectures Are Available — [Playlist Link](https://youtube.com/playlist?list=PLiF6lAo--At1-wfJi5qwVxqwAsSEOkDMK&si=u8ATwhxjNp5rdGYr)↵
↵
Hello! I'm excited to share my Dynamic Programming Series!↵
↵
I've created a comprehensive Dynamic Programming series featuring **160+ problems**, with **115+ problems sourced from [LeetCode](https://leetcode.com/u/LeetCode/)**. This series covers **12 different DP patterns**, ranging from **1D to Graph DP**, with a strong focus on **medium and hard-level problems**. In each folder, the problems are sequenced based on their serial order, so start with the problem labeled Serial 1, then move to Serial 2, and so on. Learn the patterns in the following order (click the pattern to jump to the specific folder):↵
↵
- [1D DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/1D%20DP) ↵
- [Multi Dimensional DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Multi%20Dimensional%20DP) ↵
- [Subarrays DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Subarrays%20DP) ↵
- [Subsequences DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Subsequences%20DP) ↵
- [LIS DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/LIS%20DP) ↵
- [String DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/String%20DP) ↵
- [Stocks DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Stocks%20DP) ↵
- [Game Theory DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Game%20Theory%20DP) ↵
- [Partition DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Partition%20DP) ↵
- [Square Submatrix DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Square%20Submatrix%20DP) ↵
- [Tree DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Tree%20DP) ↵
- [Graph DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Graph%20DP) ↵
↵
**Link (in case above don't work):** https://github.com/hiren-j/Ultimate-DP-Series/tree/main↵
↵
### What sets this series apart:↵
↵
- Both **Top-Down DP** and **Bottom-Up DP** solutions ↵
- **Multiple ways** of writing Top-Down and Bottom-Up approaches ↵
- Solutions consider **optimizations**, including various space optimizations across different patterns ↵
- Detailed time and space complexity notes for recursive solutions ↵
- **Readable code** with **necessary comments** ↵
- Perfect sequence of problems for each pattern, helping you solve them in the right order ↵
↵
Whether you're a beginner or aiming to master DP, this series will be helpful for everyone. Read the question, try the problem yourself first, then **open the solution and follow the sequence**. By the end, you'll have solved **115+ [LeetCode](https://leetcode.com/u/LeetCode/) Dynamic Programming problems**.↵
↵
I will continue to add more problems and updates to keep the series comprehensive and current.↵
#DynamicProgramming #LeetCode #Coding #ProblemSolving #SoftwareEngineering #DSAisLove↵
#Codeforces #ProblemSet #StudyGuide #DP #12Patterns #DPPatterns↵
↵
*Dynamic Programming: Why overthink when you can explore all the possibilities and let the code do the heavy lifting!*↵
↵
## Now Video Lectures Are Available — [Playlist Link](https://youtube.com/playlist?list=PLiF6lAo--At1-wfJi5qwVxqwAsSEOkDMK&si=u8ATwhxjNp5rdGYr)↵
↵
Hello! I'm excited to share my Dynamic Programming Series!↵
↵
I've created a comprehensive Dynamic Programming series featuring **160+ problems**, with **115+ problems sourced from [LeetCode](https://leetcode.com/u/LeetCode/)**. This series covers **12 different DP patterns**, ranging from **1D to Graph DP**, with a strong focus on **medium and hard-level problems**. In each folder, the problems are sequenced based on their serial order, so start with the problem labeled Serial 1, then move to Serial 2, and so on. Learn the patterns in the following order (click the pattern to jump to the specific folder):↵
↵
- [1D DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/1D%20DP) ↵
- [Multi Dimensional DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Multi%20Dimensional%20DP) ↵
- [Subarrays DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Subarrays%20DP) ↵
- [Subsequences DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Subsequences%20DP) ↵
- [LIS DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/LIS%20DP) ↵
- [String DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/String%20DP) ↵
- [Stocks DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Stocks%20DP) ↵
- [Game Theory DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Game%20Theory%20DP) ↵
- [Partition DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Partition%20DP) ↵
- [Square Submatrix DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Square%20Submatrix%20DP) ↵
- [Tree DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Tree%20DP) ↵
- [Graph DP](https://github.com/hiren-j/dsaAffection/tree/C%2B%2B/Dynamic%20Programming/Graph%20DP) ↵
↵
**Link (in case above don't work):** https://github.com/hiren-j/Ultimate-DP-Series/tree/main↵
↵
### What sets this series apart:↵
↵
- Both **Top-Down DP** and **Bottom-Up DP** solutions ↵
- **Multiple ways** of writing Top-Down and Bottom-Up approaches ↵
- Solutions consider **optimizations**, including various space optimizations across different patterns ↵
- Detailed time and space complexity notes for recursive solutions ↵
- **Readable code** with **necessary comments** ↵
- Perfect sequence of problems for each pattern, helping you solve them in the right order ↵
↵
Whether you're a beginner or aiming to master DP, this series will be helpful for everyone. Read the question, try the problem yourself first, then **open the solution and follow the sequence**. By the end, you'll have solved **115+ [LeetCode](https://leetcode.com/u/LeetCode/) Dynamic Programming problems**.↵
↵
I will continue to add more problems and updates to keep the series comprehensive and current.↵
#DynamicProgramming #LeetCode #Coding #ProblemSolving #SoftwareEngineering #DSAisLove↵
#Codeforces #ProblemSet #StudyGuide #DP #12Patterns #DPPatterns↵
↵
*Dynamic Programming: Why overthink when you can explore all the possibilities and let the code do the heavy lifting!*↵
