<pre class="shiki github-dark shaku"><code>// please modify code below to make it work for large number like `fib(1000)`// recursion should still be usedfunction fib(n, memo = {}) { if (memo[n]) return memo[n]; if (n === 0) return 0 if (n === 1) return 1 memo[n] = fib(n - 1, memo) + fib(n - 2, memo); return memo[n];}</code></pre>

My solution

In 86. Generate Fibonacci Number you are asked to create a fib(n). This could be simply done by a recursion, but it costs so much time that your brows…