โ† Adobe questions

Nth term of Fibonacci series in log n

Filed under Adobe

Write a function to calculate the nth Fibonacci number efficiently in O(log n) time using matrix exponentiation or fast doubling.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Adobe questions

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