climbStairs = (n) => {
    const isBaseCase = (n === 1);
    if (isBaseCase) return 1;

    const tabu = initTabu(n);/* Space O(N) */

    search(n, tabu);

    return tabu[n];
}
DP - Bottom Up
Array - Tabulation
Time O(N) | Space O(N)
https://leetcode.com/problems/climbing-stairs/
@param {number} n
@return {number}