#1864Medium· asked at 4 companies
Swim in Rising Water
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: grid = [[0,2],[1,3]] Output: 3
At time 3 every cell is reachable.
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
Constraints
- •
n == grid.length == grid[i].length - •
1 <= n <= 50 - •
0 <= grid[i][j] < n^2 - •
Each value
grid[i][j]is unique.