You can read the task, take hints and check your answer — but nothing is saved. No XP, no skill points, and this task will not be marked complete.
Naive recursive Fibonacci has time complexity O(2^n). What single technique reduces it to O(n)? One word.
What this proves: Identify repeated subproblems as the signal for caching.
Need assistance? You can reveal sequential hints. Each hint applies a minor penalty to your score.
If you are completely stuck, you can unlock the full step-by-step walkthrough.