โ† HashedIn questions

Nth Fibonacci Number in O(1) Space

Filed under HashedIn

The question

Compute the nth Fibonacci number with O(N) time complexity and O(1) auxiliary space.

No write-up yet. Related questions below have one.

Related HashedIn questions

Collected from public candidate posts and coding forums. Updated Nov 2026.