You are given an array points where points[i] = [x_i, y_i] represents a distinct point on the $X-Y$ plane.

A boomerang is a tuple of points (i, j, k) such that the distance between points[i] and points[j] is equal to the distance between points[i] and points[k], where i, j, and k are all distinct indices.

Return the total number of boomerangs.

Constraints:

• n == points.length

• $1 \leq n \leq 500$

• points[i].length $== 2$

• $-10^4 \leq x_i, y_i \leq 10^4$

• All the points are unique.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.