← Questions
Shortest bridge
0
I was asked this
No reports yet. Sign in to say where you were asked it.
A grid holds exactly two islands. Return the fewest water cells to flip to connect them: mark one island with depth-first search, then expand from all its cells with breadth-first search until you reach the other.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding