Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2258. Escape the Spreading Fire
Given a grid with grass, fire, and impassable walls, determine the maximum minutes you can wait at (0,0) before starting to move so that you can still reach (m-1,n-1) safely (return -1 if impossible, 1e9 if always safe). The core challenge is reasoning about two competing time-evolving spreads — multi-source fire propagation vs. your timed path — to decide feasibility for different start delays.
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.