Climbing Stairs- LeetCode: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

climbingStairs.java

class Solution {
    public int climbStairs(int n) {
          int[] no_of_ways = new int[n + 1];
        //step zero
        no_of_ways[0] = 1;
        //step one 
        no_of_ways[1] = 1;

        // from 2nd step it is sum of previous two 
        for (int j = 2; j <= n; j++) {
            no_of_ways[j] = no_of_ways[j - 1] + no_of_ways[j - 2];
        }

        return no_of_ways[n];

        
    }
}