How should I practice Climbing Stairs?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google phone screen problems in FastPrep.

Is Climbing Stairs associated with Google?

FastPrep tags this as a Google phone screen coding practice problem when the problem catalog has that company and stage context.

Google● EasyNEW GRADPHONE SCREEN

You are climbing a staircase with n steps.

On each move, you may climb either 1 step or 2 steps. Return the number of distinct sequences of moves that reach exactly the top.

climbStairs(n: int) → int

n = 2return = 2

The two valid sequences are 1 + 1 and 2.

n = 5return = 8

Every valid sequence ends with either a 1-step move from step 4 or a 2-step move from step 3, giving 5 + 3 = 8 sequences.