The key to solve dynamic programming $($DP$)$ problem is to be able to come up with a definition of a subproblem for which we can write a recurrence relation $($i$.$e$.,$ recursive function$)$ relating the solution of the problem to the solutions of other $($smaller$)$ subproblems. This is called "Optimal Substructure", which is the hallmark of DP$.$