Leetcode 305. Number of Islands II

Given an initially all-water m×n grid, process a sequence of add-land operations and return the number of islands (4-directionally connected land components) after each addition. The problem requires maintaining dynamic connectivity efficiently—typically via Union-Find (disjoint set) with handling for duplicate adds and frequent merges.