Leetcode: Most Stones Removed with Same Row or Column

Most Stones Removed with Same Row or Column



Similar Problems:


On a 2D plane, we place stones at some integer coordinate points. Each coordinate point may have at most one stone.

Now, a move consists of removing a stone that shares a column or row with another stone on the grid.

What is the largest possible number of moves we can make?

Example 1:

Input: stones = [[0,0],[0,1],[1,0],[1,2],[2,1],[2,2]]
Output: 5

Example 2:

Input: stones = [[0,0],[0,2],[1,1],[2,0],[2,2]]
Output: 3

Example 3:

Input: stones = [[0,0]]
Output: 0

Note:

  1. 1 <= stones.length <= 1000
  2. 0 <= stones[i][j] < 10000

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


  • Solution: XXX

General Thinkings:


Key Observations:


Walk Through Testdata


// Blog link: https://code.dennyzhang.com/most-stones-removed-with-same-row-or-column

linkedin
github
slack

Share It, If You Like It.

Leave a Reply

Your email address will not be published.