Problems ListClimbing Stairs
Easy
Determine the number of distinct ways to climb a staircase of n steps by taking either 1 or 2 steps at a time.
Example:
Input: n = 4
Output: 5
Problems ListProblems ListDetermine the number of distinct ways to climb a staircase of n steps by taking either 1 or 2 steps at a time.
Input: n = 4
Output: 5