It is one of those problems that invites us to list paths one by one. There is a much more elegant way to solve it.

12-step ladder

Strategist
Numerical territory

Riddle statement

You climb a 12-step ladder. In each movement you can advance 1 or 2 steps.

How many different ways can you get to the top?