Which of the following is/are property/properties of a dynamic programming problem?
(a) Optimal substructure
(b) Overlapping subproblems
(c) Greedy approach
(d) Both optimal substructure and overlapping subproblems
I got this question in my homework.
My doubt is from Dynamic Programming topic in division Dynamic Programming of Data Structures & Algorithms II