← TCS questions

Nth Fibonacci number

Filed under TCS · Also reported at Adobe, CloudKaptan, Intel, Oracle, Philips, Tekion, Zuora

Given an integer `n`, compute the `n`-th Fibonacci number. The Fibonacci sequence is defined as `F(0) = 0`, `F(1) = 1`, and `F(n) = F(n - 1) + F(n - 2)` for `n >= 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 TCS questions

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