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.

What difficulty level is this interview question?

This is a easy difficulty Coding & Algorithms question, commonly asked during Onsite rounds at Intuit.

What role is this question designed for?

This question is commonly asked for Data Scientist candidates at Intuit during technical interviews.

Implement nth Fibonacci number

Last updated: Mar 29, 2026

Quick Overview

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.

Intuit

Aug 1, 2025, 12:00 AM

Data Scientist

Onsite

Coding & Algorithms

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.

Comments (0)

Loading comments...

Browse More Questions

More Coding & Algorithms•More Intuit•More Data Scientist•Intuit Data Scientist•Intuit Coding & Algorithms•Data Scientist Coding & Algorithms