[hvidgaard]

Dynamic programming is a mathematical term for a certain kind of problems that have certain properties and can be solved in a certain way.

Memoization is specific form of caching for functions.

That is all there is to it. Your link seems to conflate memoization with a global store that you must apply in an all or nothing fashion for functions. You do not, and calculating the n'th fibonacci number is a great example of how to use memoization without using O(n) space.