โ† TCS questions
CodingEasy

Fibonacci Number using Recursion

Filed under TCS

Write a recursive function to calculate the nth Fibonacci number, 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 TCS questions

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