Code of tiling problem

#1

i am unable to solve the tiling problem, please provide solution.

#2

You have to solve this question using 1-d Dynamic programming approach, you can basically initialise dp array as : dp[0]= dp[1]=1;
and then check,
if(i>=m)
{
dp[i]=(dp[i-1]+dp[i-m]);
}
else
{
dp[i]=dp[i-1];
}

#3

i have not studied dynamic programming yet…solve it using recursion

#4

Sawan, even though u will use recursion, the code will not be submitted because of increased time complexity, Study Dynamic Programming and then solve this problem with the approach I have told you.