Google Technical Interviews in Management round:
More DBA job interview questions and answers at
Google Technical Interviews in Management round: Given that you can take one step or two steps forward from a given step. So find the total number of ways of reaching Nth step.
# Solution:The simple recurrence relation governing this problem is f(N)=f(N-1) +f(N-2)(why?),which is a fibonacci sequence.
Other Job Interview Questions