โ† Infosys questions
CodingReported in a candidate post, Mar 2025

Write a recursive Fibonacci function and analyze its complexity

Filed under Infosys

Write a recursive function to compute the nth Fibonacci number and analyze its time and space 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 Infosys questions

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