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

Solution: Swim in Rising Water

Understand how to apply a Dijkstra-like algorithm to navigate a grid where water levels rise over time. Learn to determine the minimum time for a swimmer to reach the bottom-right cell by exploring adjacent cells with the lowest elevations. This lesson covers grid traversal, priority queues, and handling matrix constraints 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 ...