Can u pls give a hint as to what i have to do to solve the problem…
How to solve this prob
Hey @code_breaker-1001 We have to find a recursive relation to tile a floor of size M x N given tile size is 1 x M
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-m).
So total number of ways of tiling is the sum of both.
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.