Rat in a maze problem

#1

Showing TLE and only 1 test case passing please tell whats wrong ?

#2

Your mistakes

  1. you have to find the righmost path hence first call right and then if right path doesn’t exists then only call down

if(i>m||j>n)

{

    return false;

}

here you swap m and n

  1. also inc size of array by 1 other it may give run time error

Modified Code

Now i after done all the corrections
your code passes all testcases
i hope this helps

if you understand it plz give feedback from link given below
else feel free to ask doubt

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

#4

Sir i am not able to understand properly how the backtracking is working sol[i][j]=0 in your code and also in the code which i shared , i would be grateful if you would explain that.

#5

sure kindly i will explain

#6

Really sorry sir i could not see the meeting link earlier . Please explain it .This time i will join on time.

#7

No problem
Whenever you are available drop a msg here
I will also join within minutes

#8

I can join now also sir, you can share the link .

#9

yes join now
same link share above

#10

kindly give feedback from above post

#11

Done , given the feedback , thanks for helping.