Given a rectangular grid obstacleGrid with m rows and n columns, a robot starts at the top left cell and wants to reach the bottom right cell. The robot may move only one cell at a time either right or down.

Each cell in obstacleGrid is either empty or blocked by an obstacle. An obstacle is represented by 1, and an empty cell is represented by 0. Return the number of distinct paths from the start to the destination that avoid all obstacles.

Constraints:

• m == obstacleGrid.length

• n == obstacleGrid[i].length

• $1 \leq$ m, n $\leq 100$

• obstacleGrid[i][j] is 0 or 1

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.