BFS Matrix Pathfinding | Dataford Interview Questions

Find a path from the top-left to the bottom-right of a matrix using BFS.

The matrix contains 0 for an open cell and 1 for a blocked cell. Move only up, down, left, or right, and return the path as a list of [row, column] coordinates. Return an empty list if no path exists. If multiple shortest paths exist, any one is valid.

Function: def find_path(matrix):

Input/Output: matrix is a non-empty rectangular binary matrix; return a coordinate list including the start and destination, or [].

Constraints

1 <= number of rows <= 50
1 <= number of columns <= 50
Each matrix value is either 0 or 1
The matrix is rectangular
Movement is allowed only up, down, left, and right

Function Signature

def find_path(matrix):

Your question is BFS Matrix Pathfinding. 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