Available question text
Find the minimum time to reach the bottom-right of an m×n grid where each cell specifies the earliest time it can be visited and each step to an adjacent cell takes 1 second (you may wait in place), or return -1 if unreachable. This is a shortest-path problem with time-dependent node availability—solve by computing earliest feasible arrival times per cell (e.g., with a modified Dijkstra/BFS that accounts for waiting).
Related questions
Continue with questions that share topics or the same question type.
- Minimum Time to Visit All Houses
Coding
- Minimum Time to Visit Disappearing Nodes
Coding
- Compute Infection Time in a Grid
Coding · Grids & Matrices
- Determine if a Cell Is Reachable at a Given Time
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
No company association
Leetcode 2577. Minimum Time to Visit a Cell In a Grid
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source