حل مشكلة Domino and Tromino Tiling من LeetCode بلغة Java | شرح كامل باستخدام Dynamic Programming

[@anwaraltadfi5833]

class Solution { public int numTilings(int N) { int MOD = 1000000007; long[] dp = new long[N + 1]; // Base cases dp[0] = 1; dp[1] = 1; if (N > 1) dp[2] = 2; for (int i = 3; i