Memoization can be a great paradigm to have in your toolbelt.
The aim of this video is to provide a simple use-case (fibonacci), a generic solution, and a utilization of that generic solution to greatly reduce the runtime for our simple use-case (fibonacci).
My chosen definition of the fibonacci sequence begins with: 1, 1, 2, 3, 5, 8...
Thus the "zero-th" element in my implementation is 1, as opposed to 0 (as is commonly used).