Search
⌘K
Get Premium
Leetcode 2814. Minimum Time Takes to Reach Destination Without Drowning
Find the earliest time you can travel from start to destination on a grid/graph where water levels (or cell safety thresholds) change over time so that cells/edges become unusable if you wait too long, i.e., you must find a time-respecting path that avoids drowning. This is a time-dependent reachability/shortest-path problem — essentially decide feasibility of a path under monotone temporal constraints (commonly tackled with binary search over time plus BFS/Dijkstra or a time-aware Dijkstra).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.