Basic Problemscountinglinear
Climbing Stairs with 3 Moves
You climb a staircase of n steps, and each move goes up 1, 2, or 3 steps. Count the distinct routes to the top. The staircase is the same as the flagship lesson's; only your move set grew.
Do this lesson first: climbing stairsThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.