Fibonacci Membership Check

Given an integer N, determine if it is a member of the Fibonacci series. Return true if the number is a member of the Fibonacci series, otherwise return false.

Fibonacci Series Definition:

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

Where F(0) = 0 and F(1) = 1.

Input:

Integer N

Output:

true or false

Example:

Input:

8

Output:

true

Explanation:

8 is a Fibonacci number (as F(6) = 8).

Constraints:

0

Question

Fibonacci Membership Check

Given an integer N, determine if it is a member of the Fibonacci series. Return true if the number is a member of the Fibonacci series, otherwise return false.

Fibonacci Series Definition:

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

Where F(0) = 0 and F(1) = 1.

Input:

Integer N

Output:

true or false

Example:

Input:

Output:

true

Explanation:

8 is a Fibonacci number (as F(6) = 8).

Constraints:

0 <= n <= 10^4

Accepted Answer

Check if a given integer is a member of the Fibonacci series.

Implement a function to check if the given number is a perfect square.
Check if 5*N^2 + 4 or 5*N^2 - 4 is a perfect square to determine Fibonacci membership.
Return true if the number is a perfect square of 5*N^2 + 4 or 5*N^2 - 4, otherwise false.

Fibonacci Membership Check

Fibonacci Series Definition:

Input:

Output:

Example:

Input:

Output:

Explanation:

Constraints:

Nagarro Software Developer interview questions & answers

Popular interview questions of Software Developer