[Programmers] Lv 2. 2 x N 타일링

https://school.programmers.co.kr/learn/courses/30/lessons/12900

프로그래머스

 

(solution = (n) => {
    const dp = [1, 1];
    for (let i = 2; i <= n; ++i)
        dp[i] = (dp[i - 2] + dp[i - 1]) % 1000000007;
    return dp[n];
});

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/tree/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/12900.%E2%80%852%E2%80%85x%E2%80%85n%E2%80%85%ED%83%80%EC%9D%BC%EB%A7%81

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드