To determine if a problem can be solved with dynamic programming, first try to solve the problem recursively. Then check whether divide-and-conquer style decomposition works, and whether breaking the problem down to the simplest subproblem can eventually build up to the optimal solution.
Conditions: You are trying to decide whether a problem is suitable for dynamic programming.
To determine if a problem can be solved with dynamic programming, first try to solve the problem recursively. Then check whether divide-and-conquer style decomposition works, and whether breaking the problem down to the simplest subproblem can eventually build up to the optimal solution.
Conditions: You are trying to decide whether a problem is suitable for dynamic programming.