Rotten Oranges Java |
Given a matrix of integers A of size N x M consisting of 0, 1 or 2.
Each cell can have three values:
The value 0 representing an empty cell.
The value 1 representing a fresh orange.
The value 2 representing a rotten orange.
Every minute, any fresh orange that is adjacent (Left, Right, Top, or Bottom) 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 instead.
Note: Your solution will run on multiple test cases. If you are using global variables, make sure to clear them.
#leetcode #java #programming #coding #scaleracademy #hackerank
please visit the website for the source code: https://www.contentforgeeks.com
Thanks for watching..
On this page of the site you can watch the video online Rotten Oranges Java | with a duration of hours minute second in good quality, which was uploaded by the user ContentForGeeks 19 June 2023, share the link with friends and acquaintances, this video has already been watched 66 times on youtube and it was liked by 1 viewers. Enjoy your viewing!
