← HashedIn questions

Fibonacci and Coin Change

Filed under HashedIn

The question

Find the nth Fibonacci number in O(n) time and constant space without recursion. Solve the coin change problem.

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

Related HashedIn questions

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