I cant understand how to proceed.
Also i dont understand the question fully
If we have 2 3 , cant we place 2 tiles of 13
Also in 4 4 cant we place 4 tiles of 14??
Please explain
Can you please explain the approach to the question?
hey @bhavik911
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, dynamic programming
Another example:
It involves DP?
Should i attempt it after doing that section?
Ohkay cool, I will try it later’
Involves DP try later