Function search

javascript/0070-climbing-stairs.js:76–83

(n, tabu)

};

var search = (n, tabu) => {
    for (let index = 3; index <= n; index++) {
        /* Time O(N) */
        const [prev, prevPrev] = [index - 1, index - 2];

        tabu[index] = tabu[prev] + tabu[prevPrev]; /* Space O(N) */
    }
};

/**
 * DP - Fibonacci Number