Escape the Spreading Fire: coding question

Available question text

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.

Continue with questions that share topics or the same question type.

Find the Safest Path in a Grid
Coding · Array · Binary Search · Breadth-First Search
Contain Virus
Coding · Array · Breadth-First Search · Depth-First Search
Leftmost Column with at Least a One
Coding · Array · Binary Search · Interactive
Making A Large Island
Coding · Array · Breadth-First Search · Depth-First Search

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Google
Leetcode 2258. Escape the Spreading Fire
Reported May 14, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

Uber
Escape the Spreading Fire
Reported date not specified · Source window: 30d
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source
Uber
Escape the Spreading Fire
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source

Available question text

Escape the Spreading Fire

Available question text

Related questions

Escape the Spreading Fire

Available question text

Related questions