# Unique Paths to Goal

Let's solve the Unique Paths to Goal problem using Dynamic Programming.

## Statement

Given a robot located at the top-left corner of an $m \times n$ matrix, determine the number of unique paths the robot can take from start to finish while avoiding all obstacles on the matrix.

The robot can only move either down or right at any time. The robot tries to reach the bottom-right corner of the matrix.

An obstacle is marked as `1`

, and an unoccupied space is marked as `0`

in the matrix.

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.