Back to Questions
EEJ MAIN Aptitude
QUESTION #11015
Question 1
A tower has $10$ floors. You can climb either $1$ or $2$ steps at a time. In how many distinct ways can you reach the $10^{th}$ floor?
Correct Answer Explanation
This follows the Fibonacci sequence. Ways to reach floor $n$ equals $F_{n+1}$ where $F_1=1, F_2=1$. Thus $F_{11} = 89$.
Sign in to join the conversation and share your thoughts.
Log In to Comment