Available question text
Given a 2D grid of a specified size, start coordinates, and end coordinates, find the shortest path between the two points. The problem is presented in parts: Part 1 — find the shortest distance between start and end on an empty grid; Part 2 — given a list of obstacle coordinates that cannot be traversed, find the shortest distance avoiding them; Part 3 — print the actual path taken for the shortest route.
Related questions
Continue with questions that share topics or the same question type.
- Shortest Path in a Grid with Obstacles Elimination
Coding · Array · Breadth-First Search · Matrix
- Shortest Path in a Hidden Grid
Coding
- Shortest Path to Gold in a Grid
Coding
- Check if There is a Valid Path in a Grid
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
Amazon
Shortest Path in a 2D Grid with Obstacles (with Path Reconstruction)
Reported Sep 1, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceAnduril
Shortest Path in a 2D Grid with Obstacles (with Path Reconstruction)
Reported Jul 15, 2026 · 2 source reports
MID_LEVEL
Source snapshot: Nov 12, 2026
View source