Mars Rover Pathfinding Implementation | Dataford Interview Questions

Tell me about how you would implement a solution for a Mars Rover pathfinding problem.

Given a 2D grid of cells, a start position, and a target position, return the shortest path length from start to target, or -1 if no path exists. The rover can move up, down, left, or right, and cannot enter blocked cells.

Function Signature

mars_rover_path(grid, start, target)

Input

grid: list of lists of integers, where 0 is open and 1 is blocked
start: [row, col]
target: [row, col]

Output

Integer shortest number of moves, or -1

Constraints

1 <= len(grid) <= 200
1 <= len(grid[0]) <= 200
grid[i][j] is either 0 or 1
start and target are valid open cells
Movement is allowed only in four directions

Function Signature

def mars_rover_path(grid, start, target):

Your question is Mars Rover Pathfinding Implementation. 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

Tell me about how you would implement a solution for a Mars Rover pathfinding problem.

Function Signature

mars_rover_path(grid, start, target)

Input

grid: list of lists of integers, where 0 is open and 1 is blocked
start: [row, col]
target: [row, col]

Output

Integer shortest number of moves, or -1

Constraints

1 <= len(grid) <= 200
1 <= len(grid[0]) <= 200
grid[i][j] is either 0 or 1
start and target are valid open cells
Movement is allowed only in four directions

Function Signature

def mars_rover_path(grid, start, target):

Your question is Mars Rover Pathfinding Implementation. 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.