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

Minimum Time Takes to Reach Destination Without Drowning

Explore how to determine the minimum time required to reach a destination from a source in a flooded grid with stones and empty cells. Understand constraints like avoiding flooded or stone cells, and learn to implement an efficient traversal strategy to solve this pathfinding problem in a matrix environment.

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