What questions can we do in Leetcode in dynamic programming for starters?

I want to know problems which can be solved using Dynamic programming in Leetcode which easy for a starter.
I’ve been practicing problems on LeetCode and I’ve noticed that some problems are specifically tagged with “Dynamic Programming” (DP). I understand the basics of DP, such as breaking problems down into subproblems and storing solutions to these subproblems to avoid redundant calculations. However, I often find it challenging to identify which problems are suitable for a DP approach and how to apply it effectively.

Could someone provide a detailed explanation or list of problem types commonly found on LeetCode that are well-suited for dynamic programming solutions? Examples of problem patterns or specific problems would be very helpful. Additionally, any tips on recognizing when a problem can be approached with DP and strategies for formulating a DP solution would be greatly appreciated.