Available question text
Determine whether there's a 4-directional path from the top-left to bottom-right of an m×n binary grid such that the number of unsafe cells (grid[i][j]==1) encountered is less than health (so your health stays positive). It's a budgeted shortest-path problem on a grid where unsafe cells cost 1 and you must stay within the given health budget.
Related questions
Continue with questions that share topics or the same question type.
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
- Find and Count Maximum-Score Grid Paths
Coding · Dynamic Programming · Grids & Matrices
- Find Eventual Safe States
Coding
- Find the Grid of Region Average
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
Amazon
Leetcode 3286. Find a Safe Walk Through a Grid
Reported Oct 5, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source