#1977Medium#36 in eBay's list· asked at 8 companies
Walls and Gates
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: rooms = [[INF,-1,0,INF],[INF,INF,INF,-1],[INF,-1,INF,-1],[0,-1,INF,INF]] Output: [[3,-1,0,1],[2,2,1,-1],[1,-1,2,-1],[0,-1,3,4]]
Example 2
Input: rooms = [[-1]] Output: [[-1]]
Constraints
- •
m == rooms.length - •
n == rooms[i].length - •
1 <= m, n <= 250 - •
rooms[i][j]is -1, 0, or 2^31 - 1.