Let's test your knowledge. Fill in the missing part by typing it in.

Dynamic programming is a powerful technique that can be used to solve optimization problems by breaking them down into smaller ___. By solving the smaller subproblems and storing the results, we can efficiently solve the larger problem. This approach helps avoid redundant computations and improves the overall runtime and efficiency of the solution.