Fibonacci Code through Recursion Optimised Solution

/* SOLUTION 1:
const fibonacci = (n) => {
    if(n<=2) return 1;
    return fibonacci(n-1)+fibonacci(n-2);
}
fibonacci(2);
*/

// SOLUTION 2:
//This solution is optimized solution which  O(n) time and space complexity;

const fibonacci = (n, memo = []) => {
    if(n in  memo) return memo[n]; 
    if(n<=2) return 1;
    memo[n] = fibonacci(n-1, memo)+fibonacci(n-2, memo);
    return memo[n];
}
fibonacci(2);