you give m x n integer array grid there robot initially locate topleft corner ie grid00 the robot try bottomright corner ie gridm 1n 1 the robot right point timeAn obstacle space mark 1 0 respectively grid a path robot take include square obstaclereturn number possible unique path robot reach bottomright cornerthe testcase generate answer equal 2 109 Example 1input obstacleGrid 000010000output 2explanation there obstacle middle 3x3 grid aboveThere way reach bottomright corner1 right right down down2 down down right RightExample 2input obstacleGrid 0100output 1 Constraintsm obstacleGridlengthn obstaclegridilength1 m n 100obstaclegridij 0 1