Rat in a maze | geeks for geeks solution| backtracking

 Consider a rat placed at (0, 0) in a square matrix of order N * N. It has to reach the destination at (N - 1, N - 1). Find all possible paths that the rat can take to reach from source to destination. The directions in which the rat can move are 'U'(up), 'D'(down), 'L' (left), 'R' (right). Value 0 at a cell in the matrix represents that it is blocked and rat cannot move to it while value 1 at a cell in the matrix represents that rat can be travel through it.

Note: In a path, no cell can be visited more than one time. If the source cell is 0, the rat cannot move to any other cell.

Example 1:

Input:
N = 4
m[][] = {{1, 0, 0, 0},
         {1, 1, 0, 1}, 
         {1, 1, 0, 0},
         {0, 1, 1, 1}}
Output:
DDRDRR DRDDRR
Explanation:
The rat can reach the destination at 
(3, 3) from (0, 0) by two paths - DRDDRR 
and DDRDRR, when printed in sorted order 
we get DDRDRR DRDDRR.

Example 2:

Input:
N = 2
m[][] = {{1, 0},
         {1, 0}}
Output:
-1
Explanation:
No path exists and destination cell is 
blocked.

Your Task:  
You don't need to read input or print anything. Complete the function printPath() which takes N and 2D array m[ ][ ] as input parameters and returns the list of paths in lexicographically increasing order. 
Note: In case of no path, return an empty list. The driver will output "-1" automatically.

Expected Time Complexity: O((3N^2)).
Expected Auxiliary Space: O(L * X), L = length of the path, X = number of paths.

Constraints:
2 ≤ N ≤ 5
0 ≤ m[i][j] ≤ 1

ans : 

class Solution{

    public:

    bool issafe(vector<vector<int>>&m , int x , int y , int n , vector<vector<int>>&isvisited)

    {

        if(x < n && y < n &&x >= 0 && y >= 0 && m[x][y] == 1 && isvisited[x][y] == 0)

         return true;

         return false;

    }

    void solve(vector<vector<int>>&m , vector<string>&sol , string &s  , int x , int y , int n,vector<vector<int>>&isvisited)

        {  

            if(x == 0 && y == 0 && m[0][0] == 0)

              {

                  return ;

              }

            if(x == n-1 && y == n-1)

              {

                  sol.push_back(s);

                  return ;

              }

              isvisited[x][y] = 1;

            

            if(issafe(m ,x+1 , y , n , isvisited))

             {

                 s.push_back('D');

                 solve(m  , sol , s , x+1  , y , n, isvisited);

                 s.pop_back();

             }

            

              if(issafe(m , x-1 , y ,n , isvisited))

            {

                s.push_back('U');

                solve(m , sol , s , x-1 , y, n , isvisited);

                s.pop_back();

            }

            

            

            if(issafe(m , x , y+1 ,n , isvisited))

            {

                s.push_back('R');

                solve(m , sol , s , x , y+1, n , isvisited);

                s.pop_back();

            }

            if(issafe(m , x , y-1 ,n , isvisited))

            {

                s.push_back('L');

                solve(m , sol , s , x , y-1, n , isvisited);

                s.pop_back();

            }

            

            isvisited[x][y]= 0;

        

         }

    vector<string> findPath(vector<vector<int>> &m, int n) {

        vector<string>sol;

        

        string s = "";

        vector<vector<int>>isvisited(n,vector<int>(n , 0));

        solve( m , sol , s , 0 , 0 , n , isvisited);

        return sol;

        

    }

};