Please check the code , not giving correct output

#1
#2
#3

I hope this solves your problem, if it does, please mark the problem as solved
thank you.

#4

i have corrected it but still code not working for the given test case , also runtime on submission

#5
#6

You need to check on whether n,m is X or not. As we want right most path, you need to modify your recursive call
arr[i][j]=‘1’;
boolean right=ratMaze(arr,i,j+1,m,n);
if(right)
return true;
boolean down=ratMaze(arr,i+1,j,m,n);
arr[i][j]=‘O’; //multiple paths due to this,backtrack

       if(right || down){
           return true;
       }
#7

sir , i have corrected
still the code is not working

#8

sir ,you havnt replied?