how i can solve this problem
This problem is not a linked list problem
Problem : To find any path available from [0, 0] to [N - 1, N - 1].
Recursive Problem : Assume the recursion works and will give you ans whether any path exist for positions [cr, cc + 1] to [N - 1, N - 1] or [cr, cc - 1] to [N - 1, N - 1] or [cr - 1, cc] to [N - 1, N - 1] or [cr + 1, cc] to [N - 1, N - 1].
In order to make you smaller prblm your problem all you need to work for the current position by giving 4 calls to these positions.
It’s a recursion problem.
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.