1037. Valid Boomerang

Problem

Given an array points where points[i] = [xi, yi] represents a point on the X-Y plane, return true **if these points are a *boomerang***.

A boomerang is a set of three points that are all distinct and not in a straight line.

  Example 1:

Input: points = [[1,1],[2,3],[3,2]]
Output: true

Example 2:

Input: points = [[1,1],[2,2],[3,3]]
Output: false

  Constraints:

• points.length == 3

• points[i].length == 2

• 0 <= xi, yi <= 100

Solution

/**
 * @param {number[][]} points
 * @return {boolean}
 */
var isBoomerang = function(points) {
    var a = points[0][0] - points[1][0];
    var b = points[0][1] - points[1][1];
    var c = points[0][0] - points[2][0];
    var d = points[0][1] - points[2][1];
    return a * d !== b * c;
};

Explain:

Math

Complexity:

• Time complexity : O(1).
• Space complexity : O(1).