Watch 10 video solutions for Valid Boomerang, a easy level problem involving Array, Math, Geometry. This walkthrough by NeetCode has 391,872 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
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 == 3points[i].length == 20 <= xi, yi <= 100