Skip to content
Get started

Hopping rabbit, up to three steps

A rabbit climbs a staircase of 10 steps, hopping 1, 2 or 3 steps at a time. How many distinct sequences of hops take it exactly to the top?

Show hints (2)+
  1. The last hop is 1, 2 or 3 steps - so W(n)=W(n−1)+W(n−2)+W(n−3)W(n) = W(n-1) + W(n-2) + W(n-3).
  2. Start from W(0)=1W(0) = 1, W(1)=1W(1) = 1, W(2)=2W(2) = 2 and build up to n=10n = 10.

Answer

Reveal answer →

274

Create a free account to see the full worked solution and track your progress.

Interview format: Trading Aptitude Tests, Options Trading

Related questions