You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNestProblem Set
🔥Rotting Oranges: Multi-Source Grid Wavefront BFSMedium
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak
Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.
MediumTrees & Graphs•Acceptance: 54.1%
Rotting Oranges: Multi-Source Grid Wavefront BFS
Targeted in FAANG & Tech OA:AmazonUberSwiggy
Real-World Engineering Context
Used in epidemiology contagion spread models, wildfire propagation simulators, and cascading node failure alerts in AWS data center clusters.
You are given an `m x n` grid where each cell can have one of three values:
- `0` representing an empty cell,
- `1` representing a fresh orange, or
- `2` representing a rotten orange.
Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.
Return the minimum number of minutes that must elapse until no cell has a fresh orange. If this is impossible, return `-1`.
Sample Test Cases
Input: [[[2,1,1],[1,1,0],[0,1,1]]]
Expected: 4
Input: [[[2,1,1],[0,1,1],[1,0,1]]]
Expected: -1
Input: [[[0,2]]]
Expected: 0
Constraints
- m == grid.length
- n == grid[i].length
- 1 <= m, n <= 10
- grid[i][j] is 0, 1, or 2.
Recruiter Fast-Track ReferralVerified Candidate
Direct pipeline to Google, Amazon, Microsoft, Swiggy, & Uber recruiters
Top DevScore profiles bypass resume screening filters. Every verified problem solve writes authentic proof-of-work to your profile and dispatches you directly into employer inboxes on RoleNest.
Explore 5,000+ Direct ATS Openings on RoleNest ↗✓ Direct Referral Active
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.