Computer scienceAlgorithms and data structuresAlgorithmsPrinciples and techniquesDynamic programming

Dynamic programming basics

Why memoization?

Report a typo

In dynamic programming, we use memoization because it helps us ...

Select one option from the list

efficiently divide the problem into smaller subproblems.

avoid using recursion thus making an algorithm more efficient.

combine subproblems' solutions to get an answer for the initial problem.

avoid repeated computations by saving and reusing subproblems' solutions.

Create a free account to access the full topic