Climbing stairs

There are n stairs, and a person standing at the bottom can climb either 1 stair or 2 stairs at a time, count the number of ways that a person can reach at the top.

Hint

This algorithm calculates the number of distinct ways to climb a staircase with 'n' steps.

For any number of steps greater than two (n > 2), you can either take one step from the current position and then consider the remaining (n-1) steps, or take two steps and consider the remaining (n-2) steps.
If there are two steps (n = 2), there are two ways: take two steps at once, or take one step and then another.
If there's only one step (n = 1), there's only one way to climb it: take one step.

Python
Javascript

# Python implementation

def climb(n):
  if n < 1:
    return 0

  if n == 1:
    return 1

  if n == 2:
    return 2
  
  return climb(n - 1) + climb(n - 2)

n = 5

print(climb(n))

// Javascript implementation

function climb(n) {
  if (n < 1) {
    return 0;
  }

  if (n === 1) {
    return 1;
  }

  if (n === 2) {
    return 2;
  }
  
  return climb(n - 1) + climb(n - 2);
}

const n = 5;

console.log(climb(n));