Leetcode Problem 947. Most Stones Removed with Same Row or Column

947. Most Stones Removed with Same Row or Column

Leetcode Solutions

Create an adjacency list to represent the graph, where each stone is a vertex.
For each stone, add an edge to any other stone that shares the same row or column.
Initialize a visited set to keep track of stones that have been visited during DFS.
Initialize a componentCount variable to 0.
For each stone, if it has not been visited, perform DFS from that stone, marking all reachable stones as visited.
Increment componentCount each time a new DFS traversal starts.
The result is the total number of stones minus the componentCount.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen