Climbing Stairs Problem

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

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

Example 1

Input: n = 2

Output: 2

Explanation: There are two ways to climb to the top.

1. 1 step + 1 step
2. 2 steps

Example 2

Input: n = 3

Output: 3

Explanation: There are three ways to climb to the top.

1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

Constraints

• 1 <= n <= 45

Reference for problem description

LeetCode: Climbing Stairs

Getting Started

Let's start to use this project.
There is a python file with the code and a Jupyter Notebook to visualize the code execution in your browser.

Prerequisites

Python 3 must be installed.

Installation

To execute the project open the terminal and go to the project folder. Then execute it with python:

python3 climbing_stairs.py

You can also use Jupyter Notebook to execute it in your browser or text editor directly.