Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C++

Solution: Fibonacci Number

Explore how to compute the Fibonacci number for a given integer using a mathematical approach based on Binet's formula. Understand how leveraging the golden ratio allows you to achieve a logarithmic time complexity and constant space usage, enabling efficient solutions beyond simple recursion or iteration.

We'll cover the following...

Statement

The Fibonacci sequence is a famous series of numbers in which each value is created by adding the two preceding numbers. The sequence begins with:

  • F(0)=0F(0) = 0

  • F(1)=1F(1) = 1

From that point on, every term is defined as:

  • F(n)=F(n−1)+F(n−2)F(n) = F(n - 1) + F(n - 2), for any nn greater than 11 ...