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

Solution: Swim in Rising Water

Explore a Dijkstra-like algorithm to determine the minimum time to swim across an n by n elevation grid. Learn how to use a min heap to track elevations and find a valid path in a rising water scenario, applying matrix operations and greedy strategies effectively.

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