Fibonacci, but with a cache

 1function fib(n, memo = {}) {
 2  if (n <= 1) return n;
 3  if (memo[n] != null) return memo[n];
 4  return memo[n] = fib(n - 1, memo) + fib(n - 2, memo);
 5}