Tiling problem in recursion

#1

can’t understand this problem.please send the code

#2

Hi Ayush, the problem states that you have a floor of NxM dimensions, and a tile of (1xM),
you place the tile horizonatlly/vertically and you have to tell total possible ways.
For example for if you have a tile 1x4
then if floor is 3x4, then ways = 1 (only horizontal is allowed)
if floor is 4x4 then ways = 2(both vertical and horizontal) but note that
when you place tile horizontally floor size becomes (N-1)xM
and for vertical it becomes Nx(M-1).
try to code for this. For code you may refer solution/editorial.

#3

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.