BTW, you said that you want questions. So What type of questions have you already practiced?
The typical easy dp problems involve-
Finding Length of Longest Increasing Sub-sequence
Finding Maximum sum of contiguous sub-array in an array of positive and negative integers.
Given an array of positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array. So 3 2 7 10 should return 13 (sum of 3 and 10) or 3 2 5 10 7 should return 15 (sum of 3, 5 and 7).
Hackerearth also has a good section of dp problems, with labelling as “easy” etc. Though I will say that practice some standard algorithms first before attempting them.
The way I found best for dp was that first get the concept of 3-5 algo, like LIS, LCS &etc. and then try to apply them in a practice problem. You will soon find yourself thinking and applying dp solutions naturally. Its just a matter of practice and getting used to it.