Tilling problem -2

#1

bhaiya how to approach the problem cannot get dry run & video approach.can any one please elaborate

#2

@S18LPC-OL0078 Refer this Please help me to understand the question
I have explained a test case here.
We have to find a recursive relation to tile a floor of size 4 x N given tile size is 1 x 4
When you keep the tile vertically, number of ways of tiling the remaining floor is f(n-1) as n-1 is the remaining width.
When you keep the tiles horizontally, number of ways of tiling remaining floor is f(n-4).
So total number of ways pf tiling is the sum of both.

I would suggest you to watch the lecture video on Tiling problem by Prateek bhaiya again. Watching it again will bring some clarity.
Also Tilling Problem 2 can be solved with all test cases passed using Dynamic Programming as the constraints are large. Simple recursive approach will give Time Limit Exceed Error.So attempt this question after learning Dynamic Programming.