Most Stones Removed With Same Row Or Column, is a LeetCode problem. In this post we will see how we can solve this challenge in Python

Problem Description

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

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



You can find the full details of the problem Most Stones Removed with Same Row or Column at LeetCode

Solution: Please check the snippet for the solution.

This solution originally posted at: Github by @kamyu104