Rotting Oranges at Tekion
Medium58.1% acceptance
This problem has 75.0% frequency at Tekion.
Problem Description
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....
Read full problem and hintsTopics
Also asked at 52 companies
More Tekion Questions
Count the Number of Infection SequencesHardTrapping Rain WaterHardProduct of Array Except SelfMediumBest Time to Buy and Sell Stock IIIHardSplit Array Largest SumHard
View all Tekion questions