Recursion challenge -7

#1

I am not able to understand this problem. Problem statement and description is unclear.

#2

@rohitgupta4991,
Imagine you have a floor of size n × m and you are given tiles of size 1× m.
Now you can either place the tiles vertically. Where a tile can be either place vertically,meaning it will only occupy a cell of width 1 and a complete height of M

there are 3 possibilities:

  1. n>m - here you can place a tile vertically(left with n-m,m) as well as horizontally(left with n-1,m).
  2. n==m then there are always 2 ways - horizontally or vertically.
  3. n<m here you have only 1 choice,that is to place tile horizontally, so 1 way only.
    Also mere recursion won’t help in passing all test cases, you have to use DP.
#3

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.