title: Can every top down memoization algorithms be implemented in a bottom up tabulation approach?
body: <p>I been looking at <a href="https://programming.guide/dynamic-programming-vs-memoization-vs-tabulation.html" rel="nofollow noreferrer">this post</a> about various ways to optimize a Fibonacci function.</p>
  <p>Both top down memoization and a bottom up tabulation solve the problem. And I believe both approaches are considered dynamic programming? (please correct me if I am wrong)
  But it seems like the bottom up tabulation approach has better space complexity i.e. <code>o(1)</code></p>
  <p>My question is that, is it true that every problem that can be solved with top down memoization can also be solved with bottom up tabulation approach with better space complexity?</p>