NexCode
ProblemsSubmissions
HA
Problems
Connecting

70. Climbing Stairs

Easy
MathDynamic ProgrammingMemoization

You are climbing a staircase that takes n steps to reach the top.

Each time you can climb 1 or 2 steps. Return the number of distinct ways to climb to the top.

Input

n = 2

Expected

2