Tiling 2xN with Dominoes and L-Trominoes — Solution & Editorial

Back to the Problem

Model the count as a linear state transition (a fixed matrix acting on the current state vector) and raise the matrix to the N-th power in O(log N).

Complexity: O(log N)

Watch out: Two coupled sequences (with/without a protruding cell) must be tracked together.