Another Casual Coder

Requires a standard BFS to solve it. The only caveat is that you may reach a cell that has been reached before but if you reach it with more health than before, it is OK to proceed. Code is down below, cheers, ACC.

Find a Safe Walk Through a Grid - LeetCode

public class CellHealth
{
 public int row = 0;
 public int col = 0;
 public int health = 0;
 public int key = 0;
 public CellHealth(int row, int col, int health)
 {
 this.row = row;
 this.col = col;
 this.health = health;
 this.key = row * 57 + col;
 }
}
public bool FindSafeWalk(IList> grid, int health)
{
 Queue queue = new Queue();
 CellHealth cellHealth = new CellHealth(0, 0, (grid[0][0] == 1) ? health - 1 : health);
 queue.Enqueue(cellHealth);
 Hashtable visited = new Hashtable();
 visited.Add(cellHealth.key, cellHealth.health);
 while (queue.Count > 0)
 {
 CellHealth currentCellHealth = queue.Dequeue();
 if (currentCellHealth.row == grid.Count - 1 &&
 currentCellHealth.col == grid[grid.Count - 1].Count - 1 &&
 currentCellHealth.health > 0)
 {
 return true;
 }
 int[] deltaRow = { 1, -1, 0, 0 };
 int[] deltaCol = { 0, 0, 1, -1 };
 for (int i = 0; i < deltaRow.Length; i++)
 {
 int newRow = currentCellHealth.row + deltaRow[i];
 int newCol = currentCellHealth.col + deltaCol[i];
 if (newRow >= 0 &&
 newRow < grid.Count &&
 newCol >= 0 &&
 newCol < grid[newRow].Count)
 {
 CellHealth newCellHealth = new CellHealth(newRow, newCol, (grid[newRow][newCol] == 1) ? currentCellHealth.health - 1 : currentCellHealth.health);
 if (newCellHealth.health > 0)
 {
 if (!visited.ContainsKey(newCellHealth.key))
 {
 queue.Enqueue(newCellHealth);
 visited.Add(newCellHealth.key, newCellHealth.health);
 }
 else
 {
 int vHealth = (int)visited[newCellHealth.key];
 if (vHealth < newCellHealth.health)
 {
 queue.Enqueue(newCellHealth);
 visited[newCellHealth.key] = newCellHealth.health;
 }
 }
 }
 }
 }
 }
 return false;
}