Fibonacci Sequence
Mathematics
Easy
15 points
Calculate the nth Fibonacci number.
Success Rate
0%
0 attempts
Problem Statement
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.
F(0) = 0, F(1) = 1
F(n) = F(n - 1) + F(n - 2), for n > 1.
Given n, calculate F(n).
Examples
Input:
n = 2Output:
1Explanation:
F(2) = F(1) + F(0) = 1 + 0 = 1.
Input:
n = 3Output:
2Explanation:
F(3) = F(2) + F(1) = 1 + 1 = 2.
Community Discussion
Quick Actions
Challenge Statistics
Total Attempts
0
Success Rate
0%
Difficulty
Easy
Points Reward
15
Supported Languages
Python
Javascript
Java
Cpp
Tags
#recursion
#dynamic-programming
#math