A level editor has a grid of strings where "#" is ground and "." is water. Ground cells that touch up, down, left, or right form an island, and the grid has exactly two islands.
Write shortestBridge(grid) that returns the fewest water cells you must turn into ground so that the two islands become connected.
Input: grid = ["#..","...","..#"] Output: 3
The islands are 4 steps apart, so 3 water cells between them must be filled, for example (0, 1), (0, 2), and (1, 2).
Input: grid = ["#.#"] Output: 1
Fill the single water cell in the middle.
2 <= rows * cols <= 10000Run tries your code on the examples. Submit runs every test, including hidden edge cases, and solves the problem when they all pass.
Ctrl + Enter runs, Ctrl + Shift + Enter submits (⌘ on a Mac).
I'm here to help with #428 Shortest Bridge Between Two Shapes. I give hints, never the solution, so you get to solve it yourself. Ask for a hint, select code to ask about it, or press Ask Tuto why on a failing test.
Your first 3 answers need no account. for free to keep asking.