Full question:
Given N step stair, how many number of ways can you climb if you use either 1 or 2 at a time?
Answer
It will be F(n+1) fibonacci numb ...

# Search results for fibonacci

One of most common question from this area is to write a function which return Nth number of Fibonacci sequence.
Fibonacci numbers are a sequence of n ...

Well, I like the solution with iterators the best as it showcase different aspects of your knowlege. Here is one in C#
static IEnumerable Fibonacci(d ...

« previous1 next »