Write the function to implement fibonacci Number.
F(n) = F(n-1) + F(n-2)
base case: F(0) = 0; F(1) = 1;

Question

Write the function to implement fibonacci Number.
 F(n) = F(n-1) + F(n-2)
 base case: F(0) = 0; F(1) = 1;

Sigiloso · Accepted Answer

I wrote the solution in javascript 

var fibonacciNum = function(int) {
    if (int ===0) {
        return 0;
    } else if (int ===1) {
        return 1;
    } else {
        return fibonacciNum(int-1) + fibonacciNum(int-2);
    }
    
};

var fibonacciNumNoRecursion = function (int) {
    if (int ===0) {
        return 0;
    } else if (int ===1) {
        return 1;
    } else {
        var fibo = 1;
        var fiboPrev = 0;
        for(var i = 2; i <= int; i++){
            var temp = fibo;
            fibo =  fibo + fiboPrev;
            fiboPrev = temp;
        }
        return fibo;
    }
}

Arena Solutions

Pergunta de entrevista da empresa Arena Solutions

Resposta da entrevista

Empresas seguidas

Buscas de vagas