Request code Tiling prob

#1

please provide the code of this question

#2

u can refer this https://ide.codingblocks.com/s/590162

#3

In video return getNoOfWays(n - 1) + getNoOfWays(n - 2); is written as return getNoOfWays(n - 1) + getNoOfWays(n - 4);

#4

actually there are 2 different tiling problems… which one are u referring to??
getNoOfWays(n - 1) + getNoOfWays(n - 2); this one is for tiling problem 1

#5

Tiling Problem Recursion

#6

I am unable to understand the solution, please help

#7

the code i sent is for that only

#8

Let “count(n)” be the count of ways to place tiles on a “2 x n” grid, we have following two ways to place first tile.

  1. If we place first tile vertically, the problem reduces to “count(n-1)”

  2. If we place first tile horizontally, we have to place second tile also horizontally. So the problem reduces to “count(n-2)”
    Therefore, count(n) can be written as below.

    count(n) = n if n = 1 or n = 2
    count(n) = count(n-1) + count(n-2)

#9

we have to assume in every recursion that the smaller prob will be solved right?

#10

yes… that’s what recursion does… break bigger problems into smaller ones and solve them

#11

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.