Given a matrix representing a warehouse floor plan, implement a breadth-first search algorithm to find the shortest path for a mobile robot navigating around dynamic obstacles.
Problem
Given a matrix representing a warehouse floor plan, implement a breadth-first search algorithm to find the shortest path for a mobile robot navigating around dynamic obstacles.
Your answer
Try one AI text evaluation on us
Get structured feedback, scored against a 4-axis rubric. Premium unlocks unlimited.
