Unique Paths :
Difficulty Level : Easy
Submissions : 306
Asked In :
Marks :10
: 3 | : 0
You are given an $$$m$$$ x $$$n$$$ integer array grid. There is a robot initially located at the top-left corner $$$(i.e., grid[0][0])$$$. The robot tries to move to the bottom-right corner $$$(i.e., grid[m - 1][n - 1])$$$. The robot can only move either down or right at any point in time.
An obstacle and space are marked as $$$1$$$ or $$$0$$$ respectively in the grid. A path that the robot takes cannot include any square that is an obstacle.
Return the number of possible unique paths that the robot can take to reach the bottom-right corner. Since answer may be large output answer modulo $$$998244353.$$$
The first line contains two space-separated integers $$$m$$$ and $$$n$$$ the number of rows and columns respectively. The next $$$m$$$ lines contain $$$n$$$ spaced separated integers $$$0$$$ or $$$1$$$.$$$(1 \le m, n \le 100).$$$
The number of possible unique paths that the robot can take to reach the bottom-right corner modulo $$$998244353.$$$
2 3 0 0 0 0 0 0
3
4 5 0 0 0 0 0 0 1 1 1 1 0 0 1 0 1 0 0 0 1 0
0
3 9 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0
27
