← Google questions
CodingReported in a candidate post, Jul 2025

Check if number is Fibonacci

Filed under Google

Given a non-negative integer n, determine whether n is a Fibonacci number. The Fibonacci sequence is defined as F(0) = 0, F(1) = 1, and F(k) = F(k-1) + F(k-2) for k >= 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 Google questions

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