FoundationNumeric answer
Climbing a staircase · Part 1 of 3
You climb a staircase one move at a time. Each move climbs a number of steps from an allowed set, and two climbs differ if their sequences of moves differ, so 1 then 2 and 2 then 1 count separately.
The allowed moves are 1 or 2 steps. In how many ways can you climb 8 steps?
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.
Learn the method
Dynamic programming, and why it is the same as an EV recursion
More data structures and algorithms questions
- You climb a staircase of 10 steps, taking one or two steps at a time.Foundation
- Using an unlimited supply of coins worth 1, 3 and 4, in how many ways can you…Applied
- What is the expected number of fair coin flips to see two heads in a row?Applied
- What is the edit distance between "kitten" and "sitting"?Applied
- What most often decides whether a dynamic programming solution is feasible?Applied
- What is the length of the longest strictly increasing subsequence of…Applied