# Domino And Tromino Tiling: Practice Notes
Domino And Tromino Tiling shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
dp[n] = 2*dp[n-1] + dp[n-3], derived from full and half-filled column states. Take everything mod 1e9+7.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Counting only domino tilings, which gives Fibonacci and misses tromino shapes.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI help for online coding assessments.