LeetCode 827 Making A Large Island - Problem Statement

Problem: Making A Large Island Task: You have a grid of $0$s and $1$s. You can flip one $0$ to $1$. Find the maximum island size achievable. Use DSU to track island components.

For each $0$, check its neighbors. If flipping this $0$ connects distinct islands, sum their sizes plus one. Track the maximum. Be careful not to double-count: if two neighbors belong to the same island, count that island's size only once. Use the component leader to detect duplicates.