Shortest Path in Grid Lot | Dataford Interview Questions

Given an m x n grid of integers, find the length of the shortest path from a start cell to a destination cell. Each cell is either open (0) or blocked (1). You may move one step at a time in four directions: up, down, left, or right. Return the minimum number of steps needed to reach the destination, or -1 if no path exists.

Constraints

1 <= m, n <= 200
grid[i][j] is either 0 or 1
start.length == 2 and end.length == 2
0 <= start[0], end[0] < m
0 <= start[1], end[1] < n

Function Signature

def shortest_path_grid(grid, start, end):

Your question is Shortest Path in Grid Lot. 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 <= m, n <= 200
grid[i][j] is either 0 or 1
start.length == 2 and end.length == 2
0 <= start[0], end[0] < m
0 <= start[1], end[1] < n

Function Signature

def shortest_path_grid(grid, start, end):

Your question is Shortest Path in Grid Lot. 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.