Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 790. Domino and Tromino Tiling
Count the number of ways to tile a 2×n board using 2×1 dominoes and L-shaped trominoes (rotations allowed), returning the result modulo 10^9+7. The core challenge is handling tromino-induced partial-column configurations, typically solved with dynamic programming over column states (full/partial) for n up to 1000.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.