Fibonacci Number: LeetCode 509 | Microsoft Interview Problem

In this episode, we solve Leetcode problem 509 to find the specific Fibonacci number in the sequence. We accomplish this using Python 3. Watch and enjoy.

Top Software/ Coding Channels:

Top Python Coding Channels:

Snapchat: @christopheribe

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,

F(0) = 0, F(1) = 1
F(n) = F(n - 1) + F(n - 2).
Given n, calculate F(n).

Input: n = 2
Output: 1
Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.

Input: n = 3
Output: 2
Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.

Input: n = 4
Output: 3
Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.