Tilling Problem 2 - not able to understand

I didnt get the hint…please explain me this hint as i am not able to understand…Dont send the code please…Just give me a better explanation

@archa_1712
Hello yogendra ,
here in this problem we are given n X m floor and 1 X m tile now we need to tell total number of ways we can fill this n X m floor using 1 X m tiles.

now let say f(n) is a function that tells total number of ways to place tiles on n*m floor
we can write recurrence relation as
f(n) = f(n-1) ( when 1 tile is placed horizontally ) + f(n-m) (when we place tiles vertically)
also pls check
a) https://www.geeksforgeeks.org/count-number-ways-tile-floor-size-n-x-m-using-1-x-m-size-tiles/
b) https://www.geeksforgeeks.org/tiling-problem/

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.