Dsa
Dynamic Programming
Easy
Tile Arrangement
You are given a wooden plank of length n and tiles of lengths 1, 2, and 3. Determine the number of ways to cover the entire plank using these tiles.
Input format:
An integer n (1 <= n <= 30), the length of the plank.
Output format:
Print the number of ways to arrange the tiles to cover the plank.
Example:
Input:
4
Output:
7
Key concepts
dynamic_programmingcombinatorics
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