Leetcode List: https://leetcode.com/list/x1uv9jwh/

How to approach DP problems:

• Let's take this problem 1043. Partition Array for Maximum Sum

Problems based on some Common Concepts in DP along with a solved example:

• Longest Increasing Subsequence
• Partition Subset Sum:
• Longest Common Subsequence:
• Palindrome:
• Coin Change:
• Matrix multiplication:
• Matrix/2D Array:
• Hash + DP:
• State machine:
• Depth First Search +DP:
• Minimax DP:
• Miscellaneous:

Mastering the DP journey has been a marathon for me instead of a sprint. To keep a record of progress these lists will help us as we can train breadthwise and depth-wise on various topics. You can clone and watch these lists. It will be updated timely.

1. Linear Dp:

   link

   These types of questions are easy to figure out. You just need to find the repetitive part of solution and improve it by saving its result somewhere. A classical example is Fibonacci series.