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) = 0$

• $F(1) = 1$

From that point on, every term is defined as:

• $F(n) = F(n - 1) + F(n - 2)$, for any $n$ greater than $1$

Your task is to compute the value of $F(n)$ for a given integer n.

Constraints:

• $0 \leq$ n $\leq 30$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.