Problem Statement
Find nth Fibonacci number.
Approach
F(n) = F(n-1) + F(n-2). Use memoization or iteration.
Time & Space Complexity
Time O(n), Space O(1) iterative.
This experience deserves a bigger screen
The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview