How should I practice Climbing Stairs?

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

Is Climbing Stairs associated with Bloomberg LP?

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

Climbing Stairs

Bloomberg LP● EasyNEW GRADPHONE SCREEN

Learn

Problem statement

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.

Function

climbStairs(n: int) → int

Examples

Example 1

n = 2return = 2

The two valid sequences are 1 + 1 and 2.

Example 2

n = 5return = 8

Every sequence ends with a one-step move from step 4 or a two-step move from step 3, giving 5 + 3 = 8.

Example 3

n = 1return = 1

There is one way to climb one step.

Constraints

1 <= n <= 45.