The Fibonacci-prime number
Medium Accuracy: 50.09% Submissions: 1016 Points: 4

Given a number N, the task is to find if N is Fibonacci-prime number or not. A Fibonacci-prime is any number that is both a prime and a Fibonacci number.

Example 1:

Input: N = "5"
Output: 1
Explanation: 5 is a Fibonacci number and
prime too 

Example 2:

Input: N = "8"
Output: 0
Explanation: 8 is a Fibonacci number but, 
not a prime. 

Your Task:
You don't need to read input or print anything. Your task is to complete the function fibonacciPrime() which takes a string as inputs representing the number and returns 1 if the given number is a fibonacci-prime number, otherwise 0.


Expected Time Complexity: O(constant).
Expected Auxiliary Space: O(constant).


Constraints:
1 <= |N| <= 75

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.


to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

The Fibonacci-prime number

Output Window