fibonacci sequence algorithms

Question

Goldman · Accepted Answer

public class Fibonacci
    {
        public int GetFibonacci(int n)
        {
            if (n == 1)
            {
                return 1;
            }

            if (n==2)
            {
                return 1;
            }

            else
            {
                return GetFibonacci(n - 1) + GetFibonacci(n-2);
            }

        }

Anonymous · Answer

use recursion method: 
Public class Solution(){
public int fibonacci(int n)
{
if(n==1 || n==2)
   return 1;
 return fibonacci(n-1)+fibonacci(n-2);
}
}

Goldman Sachs

Goldman Sachs interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches