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();
    }
}

@@ -271,16 +271,69 @@
 m790();%0A
+        System.out.println(prob.numTilings(3)); // 5%0A
     %7D%0A%7D%0A

Update problem 790