Dry run for ratinmaze problem

#1

i need a call stack to the ratinmaze program…like the whole calling process…how the recursion is working

#2

@PoojaSingh22 hey,basically hm ye mante hi ki recursion smaller work ka ans hme lakr dedegi but if you want how recirsion work just make a stack and push rec func name into stack with argument and call recursiom or use bhi stack me push krna and so on and recursion khtm hojaye to backtraking bhi assume krna and use stack se bhar krdena ,try it yourself once.

#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

just send me the whole call stack

#5

@PoojaSingh22 Initially you are traversing in a matrix with the help of bfs or dfs traversal. As you reach any node you mark it visited and try to go to next node and reach the last node of the matrix after you reach that node you back track your previous position from where you came with every call a new stack is being generated. You may try to dry run yourself to have a better understanding.

#6

@PoojaSingh22 hey yes dry run it yourself as mentioned by @amankumarkeshu

#7

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.