Search⌘ K
AI Features

Solution: Swim in Rising Water

Understand how to solve the Swim in Rising Water problem by applying a greedy Dijkstra algorithm. Learn to traverse a matrix with elevation constraints and determine the minimum time needed to swim from the top-left to bottom-right cell in a rising water scenario.

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