Memoization and Recursion in Python

I walk through a coding challenge to find the nth term in the Fibonacci sequence as quickly as possible. I show the classic method of recursion, and demonstrate how we can create a dictionary to store and retrieve previously calculated results in constant time to reduce runtime complexity.