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

Solution: Swim in Rising Water

Explore a greedy, Dijkstra-inspired algorithm that uses a min heap to find the minimum time for a swimmer to navigate from the top-left to bottom-right of a rising water grid. Understand elevation tracking, cell visitation, and the implementation details to solve this matrix traversal problem efficiently.

We'll cover the following...

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