790. Leetcode Solution in cpp

class Solution {
 public:
  int numTilings(int N) {
    constexpr int kMod = 1e9 + 7;

    vector<long> dp(1001, 0);
    dp[1] = 1;
    dp[2] = 2;
    dp[3] = 5;

    for (int i = 4; i <= N; ++i)
      dp[i] = (2 * dp[i - 1] + dp[i - 3]) % kMod;

    return dp[N];
  }
};

leetcode

solution

Here is the link for the problem:
https://leetcode.com/problems/domino-and-tromino-tiling/