Code AnalysisIntermediate 50s
Trace: Memoized Fibonacci
What is printed?
Starter code
const memo = {};
function fib(n) {
if (n <= 1) return n;
if (memo[n]) return memo[n];
return (memo[n] = fib(n - 1) + fib(n - 2));
}
console.log(fib(10));Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.