Coding Paths in Blocked Grid | Dataford Interview Questions

Consider a matrix of m by n sized grid where some cells are blocked. How many possible paths from start to finish are there?

Assume the start is the top-left cell and the finish is the bottom-right cell. A valid path moves only right or down and cannot enter a blocked cell. Implement count_paths(grid), where grid is a rectangular matrix containing 0 for open cells and 1 for blocked cells; return the number of valid paths as an integer.

Constraints

1 <= m, n <= 100
grid has m rows and n columns
grid[r][c] is either 0 for open or 1 for blocked
Moves are restricted to right and down

Function Signature

def count_paths(grid):

Your question is Coding Paths in Blocked Grid. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Consider a matrix of m by n sized grid where some cells are blocked. How many possible paths from start to finish are there?

Constraints

1 <= m, n <= 100
grid has m rows and n columns
grid[r][c] is either 0 for open or 1 for blocked
Moves are restricted to right and down

Function Signature

def count_paths(grid):

Your question is Coding Paths in Blocked Grid. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.