Fibonacci with Memoization

fibonacci.js

// Time complexity: O(n)
// Space complexity: O(n)

const memo = new Map();

function fibonacci(n) {
  if (memo.has(n)) {
    return memo.get(n);
  }
  
  if (n <= 1) {
    return 1;
  }
  
  const result = fibonacci(n - 1) + fibonacci(n - 2);
  
  memo.set(n, result);
  
  return result;
}

const array = [];

for (let i = 0; i < 10; i++) {
  array.push(fibonacci(i));
}

console.log(array);