Search⌘ K
AI Features

Solution: Swim in Rising Water

Explore a Dijkstra-inspired algorithm for the swim in rising water problem, using matrix traversal and a min heap to find the minimum time to swim across by managing elevations and visited cells.

Statement

Given an n×nn \times n grid (2D matrix) where each cell grid[i][j] represents the elevation at position (i, j).

Once it starts to rain, the water level rises over time. At any given time t, the water depth across the grid equals t. A swimmer can move from one cell to an adjacent cell (up, down, left, or right) if both cells have elevations less than or equal to the current water level t.

If the elevation condition ...