Given an array points where points[i] $= [x_i, y_i]$ represents a point on the $2 ext{D}$ plane, determine whether these points form a boomerang.

A boomerang is defined as a set of $3$ points that are all pairwise distinct and do not lie on a straight line.

Return true if the given points form a boomerang, and false otherwise.

Constraints:

• points.length $= 3$

• points[i].length $= 2$

• $0 \leq x_i, y_i \leq 100$

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.