Skip to main content
Climbing Stairs | AlgoCracked
AlgoCracked
ProblemsClimbing Stairs
Easy52.0% acceptance
Dynamic ProgrammingMathMemoization

Climbing Stairs

You are climbing a staircase with n steps. Each move you may climb 1 or 2 steps. Return the number of distinct ways to reach the top. Input format Input is [n] , e.g. [5] .

Loading workspace…