Problem 62 of 75

Domino and Tromino Tiling

MediumNot solved yetInterview me on this
Before you code · which pattern fits?

The problem

You can tile a 2 x n board with 2 x 1 dominoes and L-shaped trominoes (rotations allowed). Return the number of ways to fully tile the board, modulo 10⁹ + 7.

n=3 → 5 n=1 → 1

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.

Hint

Reference solution

Video explanation

Domino and Tromino Tiling, explainedcodestorywithMIK