DrawCode Practice Problem

Climbing Stairs

You are climbing a staircase with `n` steps. Each time you can climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Explore step-by-step interactive animations, memory state tracking, and live multi-language execution in DrawCode.