Have the function FibonacciChecker(num) return the string yes if the number given is part of the Fibonacci sequence. This sequence is defined by: Fn = Fn-1 + Fn-2, which means to find Fn you add the previous two numbers up. The first two numbers are 0 and 1, then come 1, 2, 3, 5, etc. If num is not in the Fibonacci sequence, return the string no.
Fibonacci Checker Coderbyte Solution In Java
import java.util.Arrays;
public class FibonacciChecker {
String FibonacciChecker(int num) {
int fib1 = 0;
int fib2 = 1;
while (fib2 < num) {
int temp = fib1;
fib1 = fib2;
fib2 = temp + fib2;
}
return fib2 == num ? "yes" : "no";
}
public static void main (String[] args) {
// keep this function call here
Scanner s = new Scanner(System.in);
FibonacciChecker c = new FibonacciChecker();
System.out.print(c.FibonacciChecker(54));
}
}
Fibonacci Checker Coderbyte Solution In JavaScript
function FibonacciChecker(num) {
if(num===2||num===3){
return "yes";
}
var num1=0;
var num2=1;
var num3=1;
for(var i=0; i<=num; i++){
if(num1===num){return "yes";}
num1 = num2;
num2 = num3;
num3 = num1+num2;
}
return "no";
}
