Available question text
Given an m × n grid containing a robber's starting position (*), one or more gold cells ($), open cells (O), and obstacles (X), find the length of the shortest path from the robber's starting position to any gold cell.
Related questions
Continue with questions that share topics or the same question type.
- Shortest Path in a 2D Grid with Obstacles (with Path Reconstruction)
Coding
- Shortest Path in a Grid with Obstacles Elimination
Coding · Array · Breadth-First Search · Matrix
- Shortest Path in a Hidden 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 · 1 record
eBay
Shortest Path to Gold in a Grid
Reported Jul 24, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source