Climbing Stairs Problem (JS)

Hilarious Hummingbird answered on July 12, 2022 Popularity 7/10 Helpfulness 10/10

answer Climbing Stairs Problem (JS)

Climbing Stairs Problem (JS)

Comment

var climbStairs = function(n) {
    if (n == 1 || n == 0) return 1 // our base cases

    let first = 1;
    let second = 2;

    for (let i = 3; i <= n; i++) {
        let third = first + second;
        first = second;
        second = third;
    }
    return second;

};

Popularity 7/10 Helpfulness 10/10 Language javascript

Source: dev.to

Tags: javascript

Link to this answer
Share Copy Link

Contributed on Jul 12 2022

Hilarious Hummingbird

0 Answers Avg Quality 2/10

Climbing Stairs Problem (JS)

Contents

More Related Answers

Climbing Stairs Problem (JS)

Grepper

Documentation

Social

Legal

Contact

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