Back to Recursion
Practice
Cycles through all question types automatically
Multiple Choice
→
Code Typing
Live Mastery
0%Good enough
0
Answered
0
Correct
0
Streak
0
Best
Round 1 · Q1/10
intermediate
Naive recursive Fibonacci is slow because:
1–4 to select · Space to skip · Enter to advance
Multiple Choice is endless — keep going as long as you like. Mastery updates after every answer.