Practice using recursive/functional techniques. How many ways can I compute the Fibonacci sequence? Let me count the ways. Three so far. Iterative loops are not used, only recursion. Mutation is kept to a minimum in favor of shadowing/immutable data structures.