# Introduction In this challenge, we will implement a function called `climbStairs` that calculates the number of distinct ways to climb a staircase. Given `n` steps, each time we can either climb 1 or 2 steps. The function should return the number of distinct ways to reach the top. We will write the solution in the provided `climbStairs.js` file and ensure that the function is exported correctly. Note that the function name and file name should not be changed arbitrarily.

Click the virtual machine below to start practicing