Data structures and algorithms
You climb a staircase of 10 steps, taking one or two steps at a time.
FoundationNumeric answer
You climb a staircase of 10 steps, taking one or two steps at a time. In how many distinct ways can you reach the top?
Answer with a number. Fractions, powers and expressions like 23/6 or C(52,5) are read correctly in practice.
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Report an issue with this question
Learn the method
Dynamic programming, and why it is the same as an EV recursion
Of the kind reported at
More data structures and algorithms questions
- What is the length of the longest strictly increasing subsequence of…Applied · Premium
- Items have weights 1,3,4,5 and values 1,4,5,7.Applied · Premium
- With coins of 1, 5, 6 and 9, what is the fewest coins that make 11?Applied · Premium
- Climbing a staircase, part 2 of 3Applied · Premium
- You roll a fair six-sided die up to three times, stopping whenever you like and…Advanced · Premium
- Climbing a staircase, part 1 of 3Foundation · Premium