Climbing Stairs — Easy Coding Interview Question

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

Example

Input: n = 2

Output: 2

Explanation: 1. 1 step + 1 step, 2. 2 steps

Constraints

• 1 ≤ n ≤ 45

Topics & Companies

Topics: dp

Asked by: Amazon, Google, Meta, Microsoft, Apple, Adobe

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns