Given a 2D matrix of 0s and 1s, and a starting position containing 1, calculate the minimum iterations (time) required to fill the entire matrix with 1s. A 1 can spread to its adjacent (up, down…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.