How to approach Rat Chases its cheese?

#1

I am not able to figure out how to approach this question?

#2

You can solve this question by backtracking. You have to take 4 variables, rightSuccess, downSuccess, leftSuccess and topSuccess and check if a rat can move in left, right, top or bottom path to reach the destination and maintain a visited array along with that to check if a particular path is already visited or not

#3

This question is given in the linked list section. Tell me how I can solve this question using linked list?

#4

This question is not solved using linked list, even if it is given in linked list section. You have to solve it like that only, as I told you earlier