climbStairs = (n) => {
    const prev = [ [1, 1], [1, 0] ];
    const next = power(n, prev);/* Time O(log(N)) */

    return next[0][0];
}
Matrix - Bitnets Method
Time O(log(N)) | Space O(1)
https://leetcode.com/problems/climbing-stairs/
@param {number} n
@return {number}