Goldman sachs | Number of Boomerangs

link:- https://leetcode.com/problems/number-of-boomerangs/


class Solution:
    def numberOfBoomerangs(self, points: List[List[int]]) -> int:
        n=len(points)
        ans=0
        for p in points:
            cmap = {}
            for q in points:
                f = p[0]-q[0]
                s = p[1]-q[1]
                cmap[f*f + s*s] = 1 + cmap.get(f*f + s*s, 0)
            for k in cmap:
                ans += cmap[k] * (cmap[k] -1)
        return ans