Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

easy· 1d-dp Mock interview

Climbing Stairs

You climb a staircase of `n` steps, taking 1 or 2 steps at a time. Return the number of distinct ways to reach the top.

Examples

in: n = 3

out: 3

1+1+1, 1+2, 2+1

in: n = 2

out: 2

1+1 or 2

Constraints

0 <= n <= 40

Hints

target: O(n) time, O(1) space⌘↩ run · ⇧⌘↩ submit