2. Fibonacci

//solution 1:

function main(n) {
    let arr = [1, 1];

    for (let i = 2; i < n; i++) {
        let next = arr[i - 1] + arr[i - 2];
        console.log(arr[i - 1]);
        arr.push(next);
    }

    if (n === 1) arr = [1];

    return arr;
}

console.log(main(1));

//solution: 2:

function solution(n) {
    let solve = (function main() {
        let f1 = 0;
        let f2 = 1;

        return function () {
            let f3 = f1 + f2;
            [f1, f2] = [f2, f3];
            return f1;
        }
    })();
    let arr = [];
    for (let i = 0; i < n; i++) {
        let result = solve();
        arr.push(result);
    }
    return arr;
}

console.log(solution(6));