If you've ever done a tech interview, you're probably familiar with the Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, .... where each number is the sum of the previous two. A relatively simple (and relatively overused) interview problem is to write a function that returns the n-th Fibonacci number …
