3286. Find a Safe Walk Through a Grid

Given a binary matrix grid of size m × n and an integer health. Start at the top-left (0,0) and reach the bottom-right (m-1, n-1). You can move in 4 directions as long as health stays positive. A…