Home/ Questions/Q 8410927
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-10T00:18:25+00:00

There are many problems that can be solved using Dynamic programming e.g. Longest increasing

  • 0

There are many problems that can be solved using Dynamic programming e.g. Longest increasing subsequence. This problem can be solved by using 2 approaches

  1. Memoization (Top Down) – Using recursion to solve the sub-problem and storing the result in some hash table.
  2. Tabulation (Bottom Up) – Using Iterative approach to solve the problem by solving the smaller sub-problems first and then using it during the execution of bigger problem.

My question is which is better approach in terms of time and space complexity?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Short answer: it depends on the problem!

    Memoization usually requires more code and is less straightforward, but has computational advantages in some problems, mainly those which you do not need to compute all the values for the whole matrix to reach the answer.

    Tabulation is more straightforward, but may compute unnecessary values. If you do need to compute all the values, this method is usually faster, though, because of the smaller overhead.

    • 0