Path Existence in 2D Grid with Blocks | Dataford Interview Questions

Given a source and distance, in a 2d array containing blocks which breaks if we reach adjacent to it twice, return true if there exists a path

Asked in the Code-pair technical stage.

Use four-directional movement. The grid contains 0 for open cells and 1 for blocks. Return whether an open-cell path starting at source has exactly distance moves without being orthogonally adjacent to the same block more than once.

Function

def has_safe_path(grid, source, distance):

Constraints

1 <= len(grid), len(grid[0]) <= 8
grid is rectangular and contains only 0 and 1
source is a two-element coordinate inside the grid
The source cell must be open
0 <= distance <= 20

Function Signature

def has_safe_path(grid, source, distance):

Your question is Path Existence in 2D Grid with Blocks. 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