Tiling Problelm

given a wall of size 1xN, fnd the no of ways in which the bricks (1,N) and (N,1) can be placed.

check if the above code is correct.

it’s problem of Recursion section 3 in videos

hello @Gurjot
yeah ur code is correct

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.