Available question text
You must find the minimum number of moves from a starting cell to a target in a 2D grid that is initially unknown and can only be discovered by moving/probing neighboring cells; the challenge is to explore and map the hidden, obstacle-filled grid (usually via DFS/BFS) and then compute the shortest path on the discovered graph.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Path Cost in a Hidden Grid
Coding
- 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 to Gold 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
Airbnb
Leetcode 1778. Shortest Path in a Hidden Grid
Reported Nov 14, 2024 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source