23. Dynamic Programming

Try these first

1. 1.

   Define dynamic programming. Why is it significant?

   Hint

   Think about how it relates to breaking down problems.

2. 2.

   What does the term 'memoization' refer to in dynamic programming?

   Hint

   Consider how this concept helps avoid redundancy.

3. 3.

   What is the main goal of dynamic programming?

   • To minimize space complexity
   • To break problems into independent subproblems
   • To make recursive processes efficient

   Hint

   Think about what dynamic programming aims to achieve.

4. 4.

   True or False: Memoization stores previously computed results to save time.

   • True
   • False

   Hint

   Recall what you learned about memoization.

5. 5.

   Develop a dynamic programming solution for the Fibonacci sequence. Explain your approach.

   Hint

   Consider defining your subproblems clearly.

6. 6.

   Describe an alternative approach to solving the coin change problem with dynamic programming. What are its limitations?

   Hint

   Think about how you can optimize the search for combinations.