← Qualcomm questions

Fibonacci with recursion and time complexity

Filed under Qualcomm

Write a recursive function to compute the n-th Fibonacci number and derive its time complexity.

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 Qualcomm questions

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