198. Swim in Rising Water

Hard

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: grid = [[0,2],[1,3]]

Output: 3

Explanation: At time 0, you are at (0,0). Neighbors (0,1) with elevation 2 and (1,0) with elevation 1 are higher. You cannot move. To reach (1,1) with elevation 3, the path (0,0) -> (0,1) -> (1,1) requires water level at least max(0,2,3) = 3. Path (0,0) -> (1,0) -> (1,1) requires max(0,1,3) = 3. Thus, minimum time is 3.

Example 2:

Input: grid = [[0,1,2,3,4],[24,23,22,21,5],[12,13,14,15,16],[11,17,18,19,20],[10,9,8,7,6]]

Output: 16

Explanation: To connect (0,0) to (4,4), you need a path where all cells have elevation at most 16. The provided route typically involves navigating through cells whose maximum elevation along the path is 16. For example, a path might be (0,0) -> (0,1) -> ... -> (0,4) -> (1,4) -> ... -> (4,4), if the elevations along this path are all <= 16. The specific path found by the algorithm will be the one minimizing this maximum bottleneck. In this case, 16 is the earliest time all necessary cells are submerged.

Constraints:

•
•
•

Time Complexity

O(N^2 log N)

Space Complexity

O(N^2)

198. Swim in Rising Water

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

198. Swim in Rising Water

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases