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

Solution: Fibonacci Number

Explore how to calculate Fibonacci numbers efficiently using the golden ratio and a simplified form of Binet’s formula. Learn to implement a solution that runs in logarithmic time and uses constant space, avoiding recursion and iteration pitfalls.

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 ...