Efficiently count pairs of points with equal Manhattan and Euclidean distances

A new algorithm efficiently counts pairs of points with equal Manhattan and Euclidean distances. The method groups points by shared x or y coordinates, calculating combinations within these groups. It then adjusts for duplicate points to ensure accuracy. This approach achieves O(n) time complexity, a significant improvement over the naive O(n^2) method.