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

Solution: Swim in Rising Water

Explore a Dijkstra-like approach to solve the Swim in Rising Water problem on a 2D grid. Understand how to simulate rising water levels, use a min heap for efficient traversal, and determine the earliest time a swimmer can reach the destination by analyzing elevations and valid moves within the matrix.

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