I am unable to understand the solution and i also watched the hint video, but am not able to understand the entire concept.
TilingProblem - unable to understand
@Ans 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.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.