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

Solution: Swim in Rising Water

Explore how to implement a greedy, Dijkstra-inspired algorithm to determine the earliest time to swim from the top-left to bottom-right of an elevation grid. Learn to simulate rising water levels, track elevations with a min heap, and manage visited cells to solve matrix path problems 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 ...