Tilling proble II in recursion

#1

can u please tell me how to approach this problem.

#2

The Tilling problem-1 already discussed in class can be said to be a special case of this problem. You can solve it by thinking different cases for n==m, n<m, n>m
But Recursive solution may not pass all the test cases. You may for sometime, once DP is done, you’ll be able to solve this problem more efficiently.

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