Available question text
Given a 2D grid with open cells, walls, a starting cell, and one or more food cells, find the minimum number of steps to reach the nearest food using 4-directional moves. Core challenge: perform a shortest-path search on the grid (BFS) while handling obstacles and boundaries, returning -1 if no food is reachable.
Related questions
Continue with questions that share topics or the same question type.
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
No company association
Leetcode 1730. Shortest Path to Get Food
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source