To code the Fibonacci sequence

Question

python solution to this answer using memoization. · Accepted Answer

mem = {0:1, 1:1}
def f(n):
    if n == 0 or n == 1:
        return mem[n]
    else:
        if n not in mem.keys():
            mem[n-2] = f(n-2)
            mem[n-1] = f(n-1)
            mem[n] = mem[n-2]+mem[n-1]
    return mem[n]

Practicing Dude · Answer

// Code Fibonacci
// The sum of the two preceding numbers

// nth Fibernachi
int NthFib(int nFib)
{
	// 1,1,2,3,5,8,13
	int nSum = 0;
	int nPrevSum = -1;
	int nCurSum = 1;

	do
	{
		nSum = nPrevSum + nCurSum;
		nPrevSum = nCurSum;
		nCurSum = nSum;
	} while (nFib--);

	return nCurSum;
}

// Recursive Fibernachi
int Fibo(int num)
{
	if (num < 2)
	{
		return num;
	}
	else
	{
		return(Fibo(num - 1) + Fibo(num - 2));
	}
}

Roblox

Roblox Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches