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 medium difficulty Coding & Algorithms question, commonly asked during Onsite rounds at Google.

What role is this question designed for?

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

Implement Fibonacci with efficiency constraints | Google Interview Question

Implement Fibonacci with efficiency constraints

Last updated: Mar 29, 2026

Quick Overview

This Coding & Algorithms interview prompt for Data Scientist roles evaluates algorithmic efficiency, dynamic programming principles and numeric-handling considerations by requiring computation of the nth Fibonacci number at very large input sizes; abstraction level: implementation-level algorithmic optimization and complexity analysis.

Google

Nov 24, 2025, 12:00 AM

Data Scientist

Onsite

Coding & Algorithms

Write a function fib(n) that returns the nth Fibonacci number (0-indexed: fib(0)=0, fib(1)=1).

Requirements:

Handle n up to at least 10^6.
Discuss time and space complexity.
If exact integers are too large for the language’s native int, explain what you would do (e.g., modulo arithmetic or big integers).

Comments (0)

Loading comments...

Browse More Questions

More Coding & Algorithms•More Google•More Data Scientist•Google Data Scientist•Google Coding & Algorithms•Data Scientist Coding & Algorithms