# Introduction In this challenge, we'll solve a problem by finding how many unique paths exist in a grid containing obstacles. There's a robot located at the top-left corner of the grid that can only move either down or right. Our task is to determine the number of unique paths from the top-left corner to the bottom-right corner while considering the grid's obstacles. We will create a function called `uniquePathsWithObstacles` that takes an obstacle grid as input and returns the number of unique paths.
Click the virtual machine below to start practicing