Tiling Problem 2

#1

I am unable to get what should be the base cases for this problem while approaching through recursion. Pls help

#2

Hi,

Base Case: if(n==m)
return 2;
if(n<m)
return 1;
if n and m are equal then you can place either horizontal or vertical.
if n is less than m then you can only place horizontal.

#3

unable to get the error. pls help sir.

#4

ide : https://ide.codingblocks.com/s/192003

#5

Hi,

try to Solve this problem in bottom up approach int dp. otherwise it won’t be accepted.

#6

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.