ALL TEST CASES SHOWING WRONG EXCEPT ONE TEST CASE

#1

#include
using namespace std;

void Tiling(int n,int m)
{
if(n<m)
cout<<1;

else
  cout<<2;

}

int main()
{
int n,m;
cin>>n>>m;
Tiling(n,m);
}

#2

hi @Mukul-Shane-1247687648773500, you have to breakdown this problem recursively and apply dp on it for timr complexity

refer here https://ide.codingblocks.com/s/660229

#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.