## Problem – Fibonacci Number LeetCode Solution

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), for n > 1.
```

Given `n`

, calculate `F(n)`

.

**Example 1:**

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

**Example 2:**

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

**Example 3:**

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

**Constraints:**

### Fibonacci Number LeetCode Solution in Java

```
class Solution
{
public int fib(int N)
{
if(N <= 1)
return N;
int a = 0, b = 1;
while(N-- > 1)
{
int sum = a + b;
a = b;
b = sum;
}
return b;
}
}
```

### Fibonacci Number LeetCode Solution in Python

```
def fib(N):
if N == 0: return 0
if N == 1: return 1
return fib(N-1) + fib(N-2)
```

### Fibonacci Number LeetCode Solution in C++

```
int fib(int N) {
if(N == 0) return 0;
if(N == 1) return 1;
return fib(N-1) + fib(N-2);
}
```

##### Fibonacci Number LeetCode Solution Review:

In our experience, we suggest you solve this Fibonacci Number LeetCode Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Fibonacci Number LeetCode Solution

**Find on LeetCode**

##### Conclusion:

I hope this Fibonacci Number LeetCode Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

**More Coding Solutions >>**

**LeetCode Solutions**

**Hacker Rank Solutions**

**CodeChef Solutions**