Shortest Path on Dispatch Grid | Dataford Interview Questions

Implement an algorithm to find the shortest path in a grid representing a service technician's dispatch route. Use four-directional movement, where 0 represents an open cell and 1 represents a blocked cell. Implement def shortest_dispatch_path(grid, start, end):, returning the path as coordinates from start to end, inclusive, or [] when no route exists. Coordinates are [row, column], and every valid input has an open start and end cell.

Constraints

1 <= len(grid) <= 50
1 <= len(grid[0]) <= 50
Every row has the same number of columns
Each grid value is either 0 or 1
start and end are valid coordinates
The start and end cells are open
Movement is allowed only up, down, left, or right

Function Signature

def shortest_dispatch_path(grid, start, end):

Your question is Shortest Path on Dispatch 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

Constraints

1 <= len(grid) <= 50
1 <= len(grid[0]) <= 50
Every row has the same number of columns
Each grid value is either 0 or 1
start and end are valid coordinates
The start and end cells are open
Movement is allowed only up, down, left, or right

Function Signature

def shortest_dispatch_path(grid, start, end):

Your question is Shortest Path on Dispatch 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.