package leetcode;

/**
 * https://leetcode.com/problems/domino-and-tromino-tiling/
 */
public class Problem790 {
    public int numTilings(int N) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem790 prob = new Problem790();
        System.out.println(prob.numTilings(3)); // 5
    }
}

@@ -318,17 +318,177 @@
 ngs(
-3)); // 5
+1)); // 1%0A        System.out.println(prob.numTilings(2)); // 2%0A        System.out.println(prob.numTilings(3)); // 5%0A        System.out.println(prob.numTilings(4)); // 11
 %0A   

Update problem 790