I understand the question but i stuck

#1

I understand the question , but i can’t able to develop the logic . I mean how to proceed

#2

Hey @nigamshubham1998
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:

n>m - here you can place a tile vertically(left with n-m,m) as well as horizontally(left with n-1,m).
n==m then there are always 2 ways - horizontally or vertically.
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.

Another example:

#3

Thanks for the reply , but as u told this question can be done by using DP but at this i dont’ have DP knowledge and i don’t know exactly what DP is so what should i do ?

#4

at this point i don’t know what DP is DP comes in this course at very last so how can i do this ?

#5

@nigamshubham1998
Leave it for now