Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C#

Minimum Time Takes to Reach Destination Without Drowning

Explore how to calculate the minimum time to reach a destination in a grid with obstacles and spreading flood conditions. Understand how to navigate through safe cells, avoid stones and flooding, and determine if reaching the destination is possible using matrix traversal methods.

We'll cover the following...

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 ...