1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
function solution(n) {
  function fib(n, memo = []) {
    if (memo[n] !== undefined) {
      return memo[n];
    }

    if (n < 2) {
      return 1;
    }

    let res = fib(n - 1, memo) + fib(n - 2, memo);

    memo[n] = res;

    return res;
  }

  return fib(n) % 1234567;
}