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

Solution: Fibonacci Number

Understand how to compute the nᵗʰ Fibonacci number efficiently by applying Binet’s formula and the golden ratio. Learn to implement a fast algorithm with logarithmic time complexity and constant space, moving beyond recursive or iterative solutions.

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