DFS Maze Pathfinding | Dataford Interview Questions

Implement a depth-first search (DFS) algorithm to solve a standard maze or pathfinding problem.

Use a rectangular grid where 0 represents an open cell and 1 represents a blocked cell. Return True if four-directional movement can connect start to end, otherwise return False.

Implement has_path(grid, start, end) with list coordinates in [row, column] format.

Constraints

1 <= len(grid) <= 100
1 <= len(grid[0]) <= 100
The grid is rectangular.
Each cell is either 0 or 1.
start and end are valid [row, column] coordinates.
Movement is allowed only up, down, left, or right.

Function Signature

def has_path(grid, start, end):

Your question is DFS Maze 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