In dynamic programming, the ___________ technique is used to store previously computed results...

  • Backtracking
  • Divide and Conquer
  • Greedy
  • Memoization
Dynamic programming often uses the memoization technique to store previously computed results in a data structure (like an array or a hash map) to avoid redundant computations. This helps in improving the efficiency of dynamic programming algorithms by reusing calculated values.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *