Climbing Stairs Leetcode

Problem Link LeetCode Version NeetCode Version Problem Statement 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: Input: n =...