Search⌘ K
AI Features

Solution: Most Stones Removed with Same Row or Column

Discover how to apply the Union Find pattern to group stones sharing rows or columns and compute the maximum stones removable without violating constraints. Understand the algorithm’s steps, including union and find operations, and how this approach improves time efficiency compared to naive methods.

Statement

Given an array of nn stones in a two-dimensional plane, where each stone is represented by a pair of x and y coordinates, find the maximum number of stones we can remove with the following condition:

A stone can be removed if it shares either the same row or the same column with another stone that has not been removed so far.

Stones are provided as an array, stones, of length nn, where stones[i]=[xi,yi]stones[i] = [x_i, y_i] ...