Doubt in Rat in a Maze

#1

Not able to understand how to code for right most path

#2

https://ide.codingblocks.com/s/308310 this is the code

#3

hi @gods_eye first visit the right path and check if a path is possible. if right path returns true, then you dont need to check for down path, simply return from there only.
But, if right path is not there, only then check if a path is possible by going in downwards direction.

#4

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.