Problem title
Difficulty
Avg time to solve

Nth Fibonacci Number
Easy
--
Median of two sorted arrays
Hard
25 mins
Fire in the cells.
Hard
15 mins
Floor in BST
Moderate
30 mins
Size of Largest BST in Binary Tree
Easy
10 mins
Kth Smallest Element
Easy
15 mins
Rearrange The Array
Moderate
15 mins
Level Order Traversal
Easy
15 mins
Count Ways
Easy
24 mins
Sum Between Zeroes
Easy
20 mins
18

Nth Fibonacci Number

Difficulty: EASY

Problem Statement

Nth term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -

    F(n) = F(n-1) + F(n-2), 
    Where, F(1) = F(2) = 1

Provided N you have to find out the Nth Fibonacci Number.

Input Format :
The first line of each test case contains a real number ‘N’.
Output Format :
For each test case, return its equivalent Fibonacci number.
Constraints:
1 <= N <= 10000     
Where ‘N’ represents the number for which we have to find its equivalent Fibonacci number.

Time Limit: 1 second

Sample Input 1:

6

Sample Output 1:

8

Explanation of Sample Input 1:

Now the number is ‘6’ so we have to find the “6th” Fibonacci number
So by using the property of the Fibonacci series i.e 

[ 1, 1, 2, 3, 5, 8]
So the “6th” element is “8” hence we get the output.
Reset Code
Full screen
copy-code
Console