Skip to content

problem6.md

Latest commit

 

History

History
13 lines (10 loc) · 411 Bytes

problem6.md

File metadata and controls

13 lines (10 loc) · 411 Bytes

Problem 6: Combinatorial Stairwell (Climbing Stairs)

Problem Statement

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?

Input Format

  • An integer n.

Example

Input: n = 3
Output: 3
Explanation: 1. 1 step + 1 step + 1 step, 2. 1 step + 2 steps, 3. 2 steps + 1 step.