Please can you provide me the solution of the que

[Chhayansh (Chhayansh Purohit)]

please can you provide me the solution of the que,
or tell me the appproach to find the base cases

[pratyush63 (Pratyush Kumar)]

For Tilling Problem 1, there is already a lecture video. Please refer that.
If your question is for Tilling Problem 2…then refer these:

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 [16][16%20(1)] Try to build a recursive relation to solve the problem. It is similar to the Tiling problem discussion in lecture videos. Please …

Tilling problem

@rupeshjha909 Recursive function for this problem should be something like this: int noofways(int n,int m) { if(n==0) return 1; if(n<0) return 0; int way1=noofways(n-1,m); int way2=noofways(n-m,m); return (way1+way2)%1000000007; } However just by recursion, your code will not pass all the test cases and will give Time Limit Exceed error since the constraints are large. You need dynamic programming to solve this problem. So i would suggest you to attempt this problem after completing D…

[pratyush63 (Pratyush Kumar)]

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.