Implement nth Fibonacci number

Q: Implement nth Fibonacci number

This question evaluates a candidate's algorithmic problem-solving skills, specifically understanding of recurrence relations, recursion versus iterative implementations, dynamic programming trade-offs, and numerical limits when computing sequence values.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Problem

Write a function that returns the n-th Fibonacci number.

The Fibonacci sequence is defined as:

$F(0)=0$
$F(1)=1$
$F(n)=F(n-1)+F(n-2)$ for $n \ge 2$

Requirements

Input: integer n (assume n >= 0 ).
Output: integer F(n) .
Discuss time/space complexity and how you would handle large n .

Follow-ups (if asked)

Avoid recursion stack overflow.
Optimize for time (e.g., better than $O(n)$ ) or for very large values.

Implement nth Fibonacci number

Overview

Problem

Requirements

Follow-ups (if asked)

Comments (0)