Breaking News: Grepper is joining You.com. Read the official announcement!

climbing stairs leetcode solution javascript

Chetan Nada answered on January 18, 2023 Popularity 8/10 Helpfulness 2/10

answer climbing stairs leetcode solution javascript

climbing stairs leetcode solution javascript

Comment

// climbing stairs leetcode solution javascript
var climbStairs = function(n) {
    // This is fibonacci sequence.
    // Each number in a fibonacci sequence is the sum of the two preceding ones, starting from 0 and 1.
    // 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...
    // Fib(n)=Fib(n−1)+Fib(n−2)
    // so if n<=1 then n will return
    if(n <= 1){
        return n;
    }
    // if n >= 3 then we will use fibonacci sequence.
    let first = 1;
    let second = 2;
    for(let i=3; i<=n; i++){
        let third = first + second;
        first = second;
        second = third;
    }
    // return second variable because last third vairable value that stored in second variable
    return second;
};

Popularity 8/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: javascript solution

Link to this answer
Share Copy Link

Contributed on Jan 18 2023

Chetan Nada

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

climbing stairs leetcode solution javascript

Contents

More Related Answers

climbing stairs leetcode solution javascript

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.