unknown Interview Question for Software Developers

Country: India
Interview Type: Written Test

Comment hidden because of low score. Click to expand.
0
of 0 vote

Shortest code, but FAR from most efficient.

``````public int fib(int n){
return n < 2 ?
1 :
fib(n - 1) + fib(n - 2);
}``````

Comment hidden because of low score. Click to expand.
0

This is the most efficient code that I can make ( O(n) ):

``````public int fib(int n){
int nMinus1 = 1;
int nMinus2 = 1;
for(int i = 1; i < n; i++){
int temp = nMinus1 + nMinus2;
nMinus2 = nMinus1;
nMinus1 = temp;
}
return nMinus1;
}``````

Comment hidden because of low score. Click to expand.
0

This program is to generate fibonacci series, but the op is asking for the fibonacci prime.

Comment hidden because of low score. Click to expand.
0

The requirement is the nth prime not the nth number

Comment hidden because of low score. Click to expand.
0

It is required to find the nth prime not the nth number

Comment hidden because of low score. Click to expand.
0
of 0 vote

I guess the question is to find Fibonacci prime not nth Fibonacci

Comment hidden because of low score. Click to expand.
0
of 0 vote

I believe the question is to find Fibonacci prime not just Fibonacci

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````def nth_fib(number):
total = 0
prev1 = 0
prev2 = 0
for i in xrange(1, number):
prev2 = prev1
if i < 2:
prev1 = 1
total += prev1 + prev2

Comment hidden because of low score. Click to expand.
0
of 0 vote

Shortest code:

``def f(n): return 1 if n<=2 else f(n-2)+f(n-1)``

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.