solulubeta
Sign in
NeetCode 150 / Advanced Graphs
12.04 · Problem

Swim in Rising Water

Hard Dijkstra on the max along the path 1 video LC 778 Pro

This problem is part of solulu Pro

In an n × n grid, grid[r][c] is the elevation of a cell; the values are a permutation of 0 … n²−1. At time t the water level is t, and you can swim between 4-directionally adjacent cells if both elevations are at most t…

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 96 of 150 · updated 2026-10-12