Dsa Recursion Warm-up

Fibonacci Sequence (N-th Term)

Write a program that finds the N-th term of the Fibonacci sequence using recursion. The input is a single integer n (0 <= n <= 30). Output the N-th term of the Fibonacci sequence. Example: Input: 5 Output: 5

Key concepts

recursionfibonaccisequence

Practise this out loud — free

Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.

🎙 Practise this question now

Part of InterviewLab's verified interview question bank. We show the prompt and concepts to practise with — never a copy-paste solution.