Question

You are given a n x m grid consisting of values 0 and 1. A value of 1 means that you can enter that cell and 0 implies that entry to that cell is not allowed. You start at the upper-left corner of the grid (1, 1) and you have to reach the bottom-right corner (n, m) such that you can only move in the right or down direction from every cell. Your task is to calculate the total number of ways of reaching the target.

Answer 1

Explanation:

Input: [[0, 0, 0],

[0, 1, 0],

[0, 0, 0]]

Output : 2

There is only one obstacle in the middle