Search⌘ K
AI Features

Solution:Minimum Time Takes to Reach Destination Without Drowning

Explore how to determine the minimum time needed to move from a source to a destination cell in a matrix grid while avoiding stones and expanding floods. Learn to apply a breadth-first search technique that alternates flood spread and safe moves to find the quickest valid path or identify if none exists.

Statement

Given a m x n grid of the string land. It consists of the following types of cells:

  • S: Source cell where you are standing initially.

  • D: Destination cell where you have to reach.

  • .: These cells are empty.

  • X: These cells are stone.

  • *: These cells are flooded.

Each second, you can move to a neighboring cell directly next to your current one. At the same time, any empty cell next to a flooded cell also becomes flooded. There are two challenges in your path:

  1. You can’t step on stone cells.

  2. You can’t step on flooded cells or cells that will flood right when you try to step on them because you’ll drown.

Return the minimum time it takes you to reach the destination from the source ...