Skip to content

Latest commit

 

History

History
5 lines (3 loc) · 213 Bytes

File metadata and controls

5 lines (3 loc) · 213 Bytes

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.