I am unable to understand the question. Please explain the given test cases.
Please help me to understand the question
@zanj0 Tilling Problem ii is a problem based on recursion/dynamic programming.
For a given floor of size n x m,you have to find the total number of ways of flooring it using tiles of size 1 x m. The tile can be placed horizontally and vertically.
Consider the given sample input:
2
2 3
4 4
For the first case: n=2 m=3
For the second case: n=4 m=4
Try to build a recursive relation to solve the problem. It is similar to the Tiling problem discussion in lecture videos. Please refer it.
Hope this helps.