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

Solution: Swim in Rising Water

Explore how to apply a Dijkstra-like algorithm to solve the problem of swimming in a grid with rising water levels. Understand the use of min heaps to track the lowest elevation and determine the minimum time to reach the goal. This lesson helps you work through grid traversal techniques and optimize pathfinding under constraints.

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