Challenge: Staircase Problem
A child is running up a staircase with
n steps and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a function to count the number of possible ways that the child can run up the stairs.
An integer that represents the number of stairs
An integer that represents the number of ways that those stairs can be climbed
n = 4
result = 7
First, take a close look at this problem and design a step-by-step algorithm before jumping to the implementation. This problem is designed for your practice, so try to solve it on your own first. If you get stuck, you can always refer to the solution provided in the solution section. Good luck!