How can i solve this problem?

#1

I have gone through the video but i am not able to think about the approach and base cases of recursion?

#2

Approach: For a given value of n and m, the number of ways to tile the floor can be obtained from the following relation.

        |  1, 1 < = n < m

count(n) = | 2, n = m
| count(n-1) + count(n-m), m < n

#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.