Solution: Swim in Rising Water
Explore a matrix-based problem where rising water levels determine the swimmer's path. Learn to apply a greedy Dijkstra-like algorithm using a min heap to identify the earliest time to swim from the top-left to the bottom-right corner by navigating adjacent cells within elevation constraints. Understand the algorithm's time and space complexity and how it ensures the optimal path is found efficiently within grid boundaries.
We'll cover the following...
Statement
Given an 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 ...