Dsa
Recursion
Hard
Tiling Problem with 1x2 Tiles
You have a 1×N board and want to tile it with 1×2 dominoes. Each domino covers exactly two squares. Count the number of ways to completely cover the board with dominoes. For a board of length N, print the number of ways to tile it.
Example Input:
5
Example Output:
8
Key concepts
recursiondynamic programmingcombinatorial
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now