Rat in the maze problem

#1


code is showing timelimit and wrong answer in 2 and 6 testcase

#2

In this code, you have to print only one path, so you have to maintain a visited array, initialised it to 1, and then check:
if(j+1<=M && !visited[i][j+1])
{
bool rightSuccess=ratmaze(maze,i,j+1,N,M);
if(rightSuccess==true)
{
return true;
}
}
Repeat this for down also, Try using this approach to prevent TLE, in your 6th testcase.

#3

i am not able to understand.

#4

I have edited your code, try to submit it now,

#5

thanks for correcting