Hackerrank - Is Fibo

Problem Statement A description of the problem can be found on Hackerrank. Solution Create Fibonacci sequence and check if the actual Fibonacci number is equals number n. Stop the sequence if actual Fibonacci number is greater then n. I created solution in: Java JavaScript Scala Ruby All solutions are also available on my GitHub. Java […]

Hackerrank - Fibonacci Numbers

Problem Statement A description of the problem can be found on Hackerrank. Solution Use the equation for Fibonacci numbers in problem statement: Fibonacci(n) = 0 , n = 1 Fibonacci(n) = 1 , n = 2 Fibonacci(n) = Fibonacci(n-1) + Fibonacci(n-2) , n > 2 I created solution in: Scala All solutions are also available […]