problem.md

Problem 70: Climbing Stairs

Difficulty: Easy

Problem

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Note: Given n will be a positive integer.

Example

n = 1

output = 1