Problem: Most Stones Removed with Same Row or Column

med

30 min

Explore how to use the Union Find algorithm to solve the problem of removing the maximum number of stones placed in a 2D plane, where stones can be removed if they share a row or column with an unremoved stone. This lesson guides you through understanding the problem, developing the solution logic, and implementing it to strengthen your graph connectivity skills.

Given an array of $n$ 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 $n$ , where $stones[i] = [x_i, y_i]$ represents the $i^{th}$ stone. Return the maximum possible number of stones that can be removed.

Constraints:

$1\leq$ stones.length $\leq 1000$
$0\leq x_i, y_i \leq50$

Problem: Most Stones Removed with Same Row or Column

med

30 min

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 $n$ , where $stones[i] = [x_i, y_i]$ represents the $i^{th}$ stone. Return the maximum possible number of stones that can be removed.

Constraints:

$1\leq$ stones.length $\leq 1000$
$0\leq x_i, y_i \leq50$

Problem: Most Stones Removed with Same Row or Column

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Most Stones Removed with Same Row or Column

Statement

Examples

Understand the problem

Figure it out!

Try it yourself