https://vhaos-leetcode-solutions.now.sh/tags/breadth-first-search/ Recent content in Breadth-first Search on Vhaos's Leetcode Solutions Hugo -- gohugo.io en-us Kareem Daggash Sun, 09 Aug 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/9-rotting-oranges/ Sun, 09 Aug 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/9-rotting-oranges/ LeetCode August - Day 9 Problem Statement In a given grid, each cell can have one of 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 (4-directionally) to a rotten orange becomes rotten. Return the minimum number of minutes that must elapse until no cell has a fresh orange.