Question: Which of the following is a characteristic of dynamic programming?

Options:

1. It always uses recursion
2. It requires a greedy approach
3. It stores results of subproblems
4. It is only applicable to optimization problems

Correct Answer: It stores results of subproblems

Solution:

Dynamic programming is characterized by storing the results of subproblems to avoid redundant calculations, which improves efficiency.