Shortest Bridge

Given an n×n binary grid containing exactly two 4-connected islands, return the minimum number of 0→1 flips needed to connect them. The core challenge is finding the shortest bridge between island boundaries (commonly solved by marking one island and doing a multi-source BFS outward across water until the other island is reached).