โ† MAQ Software questions
CodingEasy

Find nth Fibonacci number using recursion

Filed under MAQ Software

Write a function to compute the nth Fibonacci number using recursion, where F(0)=0, F(1)=1, and F(n) = F(n-1) + F(n-2).

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 MAQ Software questions

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