DIY: Shortest Bridge
Explore how to solve the shortest bridge problem where two islands in an n x n grid must be connected by flipping the fewest zeros. Learn to analyze and implement this algorithm in Ruby, enhancing your problem-solving skills for technical interviews.
We'll cover the following...
We'll cover the following...
Problem statement
You are given an n x n binary matrix grid containing 0s and 1s. Each cell in the grid represents either land or water. A cell with a value 1 represents land, while one with a value 0 represents water. A bunch of four-directionally adjacent cells with the value 1 constitutes an island.
There are exactly two islands in the
grid. ...