Tiling Problem is not cleared

#1

I am not getting the question exactly, should i need to take the 2d array for allocation of tiles or just simply input the n and find the number of ways through (n-1)+(n-4) .

#2

Hi Ashutosh, no need of 2D array. Solve it using simple recursion.

#3

Hey Ashutosh,
As you are not responding to this thread, I am marking your doubt as Resolved for now. Re-open it if required.

Please mark your doubts as resolved in your course’s “ Ask Doubt ” section, when your doubt is resolved.