Debug the Fibonacci Sequence
EasyChallenge 2 of 20
Debug the Fibonacci Sequence
EasyThis recursive Fibonacci implementation has a performance issue. Optimize it to handle larger inputs without timing out.
Challenge 2 of 20
30 XP
Community Solutions
AlgorithmsRecursionOptimizationDynamic Programming
Exit ChallengeTest Cases
0/4 passingTest Case #1
Input: 5
Expected: 5
Run tests to see results
Test Case #2
Input: 10
Expected: 55
Run tests to see results
Test Case #3
Input: 20
Expected: 6765
Run tests to see results
Test Case #4
Input: 30
Expected: 832040
Run tests to see results
solution.js
1
<span class="token keyword">function</span> fibonacci(n) {
<span class="token keyword">if</span> (n <;= <span <span class="token keyword">class</span>="token number">0</span>) {
<span class="token keyword">return</span> <span <span class="token keyword">class</span>="token number">0</span>;
} <span class="token keyword">else</span> <span class="token keyword">if</span> (n == <span <span class="token keyword">class</span>="token number">1</span>) {
<span class="token keyword">return</span> <span <span class="token keyword">class</span>="token number">1</span>;
}
<span class="token keyword">return</span> fibonacci(n - <span <span class="token keyword">class</span>="token number">1</span>) + fibonacci(n - <span <span class="token keyword">class</span>="token number">2</span>);
}Console
Run your code to see output here