Dynamic Programming for Robotic Pathing | Dataford Interview Questions

Solve a dynamic programming problem relevant to optimization in robotic pathing. Implement min_robot_path_cost(grid, turn_penalty), where the robot moves only right or down through a rectangular grid. Each cell contains a nonnegative traversal cost, and -1 marks an obstacle. Return the minimum total cost from the top-left to the bottom-right, including the cost of every visited cell and turn_penalty whenever the robot changes direction. Return -1 if the destination is unreachable. The first move does not incur a turn penalty. Input is a 2D integer list and a nonnegative integer; output is an integer.

Constraints

1 <= len(grid), len(grid[0]) <= 200
All rows have the same number of columns
1 <= len(grid) * len(grid[0]) <= 10^5
grid[r][c] is -1 or an integer from 0 through 10^6
turn_penalty is an integer from 0 through 10^6
The robot may move only right or down

Function Signature

def min_robot_path_cost(grid, turn_penalty):

Your question is Dynamic Programming for Robotic Pathing. 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), len(grid[0]) <= 200
All rows have the same number of columns
1 <= len(grid) * len(grid[0]) <= 10^5
grid[r][c] is -1 or an integer from 0 through 10^6
turn_penalty is an integer from 0 through 10^6
The robot may move only right or down

Function Signature

def min_robot_path_cost(grid, turn_penalty):

Your question is Dynamic Programming for Robotic Pathing. 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.