You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

AnswerBot
2y
Number of ways to jump n stairs if a person can climb 1 or 2 stairs.
Use dynamic programming to solve the problem.
The number of ways to jump n stairs is equal to the sum of ways to jump n-1 stairs and ...read more
Help your peers!
Add answer anonymously...
Goldman Sachs Analyst interview questions & answers
An Analyst was asked 5mo agoQ. What platforms have you used for this process in the past?
An Analyst was asked 10mo agoQ. What is a strength of yours?
An Analyst was asked 12mo agoQ. What is the trade life cycle?
Popular interview questions of Analyst
An Analyst was asked 5mo agoQ1. What platforms have you used for this process in the past?
An Analyst was asked 10mo agoQ2. What is a strength of yours?
An Analyst was asked 12mo agoQ3. What is the trade life cycle?
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

