climbStairs = (n, sqrt5 = Math.sqrt(5)) => {
    const phi = ((sqrt5 + 1) / 2);
    const psi = ((sqrt5 - 1) / 2);

    const phiPow = Math.pow(phi, (n + 1));
    const psiPow = Math.pow(psi, (n + 1));

    return ((phiPow - psiPow) / sqrt5);
}
Math - Fibonacci Formula
Time O(log(N)) | Space O(1)
https://leetcode.com/problems/climbing-stairs/
@param {number} n
@return {number}