BFS Coding Question | Dataford Interview Questions

Solve a BFS coding problem.

Implement shortest_path(grid). The grid contains 0 for an open cell and 1 for an obstacle. Starting at the top-left cell, return the minimum number of cells in a four-directional path to the bottom-right cell, or -1 if no path exists.

Input is a non-empty rectangular list of lists. The start or destination may be blocked.

Constraints

1 <= number of rows <= 100
1 <= number of columns <= 100
Each cell is either 0 or 1
Movement is allowed only up, down, left, or right
The path length counts both the starting and destination cells

Function Signature

def shortest_path(grid):

Your question is BFS Coding Question. 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

Solve a BFS coding problem.

Input is a non-empty rectangular list of lists. The start or destination may be blocked.

Constraints

1 <= number of rows <= 100
1 <= number of columns <= 100
Each cell is either 0 or 1
Movement is allowed only up, down, left, or right
The path length counts both the starting and destination cells

Function Signature

def shortest_path(grid):

Your question is BFS Coding Question. 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.