# Unique paths in a Grid with Obstacles

Given a grid of size m * n, let us assume you are starting at (1, 1) and your goal is to reach (m, n). At any instance, if you are on (x, y), you can either go to (x, y + 1) or (x + 1, y).

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space are marked as 1 and 0 respectively in the grid.

Examples:

Input: [[0, 0, 0], [0, 1, 0], [0, 0, 0]] Output : 2 There is only one obstacle in the middle.

We have discussed a problem to count the number of unique paths in a Grid when no obstacle was present in the grid. But here the situation is quite different. While moving through the grid, we can get some obstacles which we can not jump and that way to reach the bottom right corner is blocked.

The most efficient solution to this problem can be achieved using dynamic programming. Like every dynamic problem concept, we will not recompute the subproblems. A temporary 2D matrix will be constructed and value will be stored using the bottom up approach.

### Approach

- Create a 2D matrix of same size of the given matrix to store the results.
- Traverse through the created array row wise and start filling the values in it.
- If an obstacle is found, set the value to 0.
- For the first row and column, set the value to 1 if obstacle is not found.
- Set the sum of the right and the upper values if obstacle is not present at that corresponding position in the given matirx
- Return the last value of the created 2d matrix

`# Python code to find number of unique paths in a ` `# matrix with obstacles. ` ` ` `def` `uniquePathsWithObstacles(A): ` ` ` ` ` `# create a 2D-matrix and initializing with value 0 ` ` ` `paths ` `=` `[[` `0` `]` `*` `len` `(A[` `0` `]) ` `for` `i ` `in` `A] ` ` ` ` ` `# initializing the left corner if no obstacle there ` ` ` `if` `A[` `0` `][` `0` `] ` `=` `=` `0` `: ` ` ` `paths[` `0` `][` `0` `] ` `=` `1` ` ` ` ` `# initializing first column of the 2D matrix ` ` ` `for` `i ` `in` `range` `(` `1` `, ` `len` `(A)): ` ` ` `if` `A[i][` `0` `] ` `=` `=` `0` `: ` `/` `/` `If ` `not` `obstacle ` ` ` `paths[i][` `0` `] ` `=` `paths[i` `-` `1` `][` `0` `] ` ` ` ` ` `# initializing first row of the 2D matrix ` ` ` `for` `j ` `in` `range` `(` `1` `, ` `len` `(A[` `0` `])): ` ` ` `if` `A[` `0` `][j] ` `=` `=` `0` `: ` `/` `/` `If ` `not` `obstacle ` ` ` `paths[` `0` `][j] ` `=` `paths[` `0` `][j` `-` `1` `] ` ` ` ` ` `for` `i ` `in` `range` `(` `1` `, ` `len` `(A)): ` ` ` `for` `j ` `in` `range` `(` `1` `, ` `len` `(A[` `0` `])): ` ` ` ` ` `# If current cell is not obstacle ` ` ` `if` `A[i][j] ` `=` `=` `0` `: ` ` ` `paths[i][j] ` `=` `paths[i` `-` `1` `][j] ` `+` `paths[i][j` `-` `1` `] ` ` ` ` ` `# returning the corner value of the matrix ` ` ` `return` `paths[` `-` `1` `][` `-` `1` `] ` ` ` ` ` `# Driver Code ` `A ` `=` `[[` `0` `, ` `0` `, ` `0` `], [` `0` `, ` `1` `, ` `0` `], [` `0` `, ` `0` `, ` `0` `]] ` `print` `(uniquePathsWithObstacles(A)) ` |

*chevron_right*

*filter_none*

Output:

2

This article is contributed by **Rishabh Bansal**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

## Recommended Posts:

- Unique paths covering every non-obstacle block exactly once in a grid
- Number of cells a queen can move with obstacles on the chessborad
- Largest connected component on a grid
- Count possible moves in the given direction in a grid
- Minimum sum falling path in a NxN grid
- Search a Word in a 2D Grid of characters
- Check if a word exists in a grid or not
- Minimum distance to the end of a grid from source
- Count Magic squares in a grid
- Maximum sum in a 2 x n grid such that no two elements are adjacent
- Shortest distance between two cells in a matrix or grid
- Minimum cost to cover the given positions in a N*M grid
- Minimum distance to the corner of a grid from source
- Check if the robot is within the bounds of the grid after given moves
- Collect maximum points in a grid using two traversals