CodingHardcod-g478

Subject Bitmask dpLevel Senior–Staff~40 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Count the number of ways to tile an m x n grid completely with 1x2 dominoes (each domino covers two orthogonally adjacent cells, placed horizontally or vertically, no overlaps, no gaps). Return the exact count. The smaller dimension is small (min(m,n) up to ~10); return 0 when m*n is odd.

Implement

domino_tilings(m: int, n: int) → int

Examples

in[2,3]out3

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.