With Memoization Are Time Complexity & Space Complexity Always the Same?
There are plenty examples for which you


need $\omega(1)$ time to compute each table entry or
do not need to keep all table entries.


An example for the former would be CYK; for the latter memoized Fibonacci and Bellman-Ford.