How is this question relevant to limked lists

#1

I have solved this using recursion, I wanted to if there is a better or different way to solve using linked list

#2

See, basically when we are dealing with a grid based question where we have to move from src to destination, graph traversal ( bfs , dfs ) comes to any one`s mind.
i dont see using a linked list would solve the purpose, like how would u even map those addresses to left , right, top and up pointers where u are likely to move in the next move. U are probably thinking of using too much extra space, compared to the solution where are just using a stack for recursion purpose.
also tracing the top left right bottom pointers in the Linked list would be hard and less efficient for going about the problem.

If u still have some approach in your mind as to how to go about this problem do share it in the comments, we might build up some solution if it is efficient

#3

This question is under the Linked list challenges in my course, that’s why I wanted to know if there is a better way to do it using linked lists.

#4

I cant relate this question to a linked list, might be some updation issues in the website