A boomerang is a set of 3 points that are all distinct and not in a straight line.
Given a list of three points in the plane, return whether these points are a boomerang.
 
Example 1:
Input: [[1,1],[2,3],[3,2]]
Output: true


Example 2:
Input: [[1,1],[2,2],[3,3]]
Output: false

 
Note:

points.length == 3
points[i].length == 2
0 <= points[i][j] <= 100

Source: leetcode | Difficulty: EASY
Tags: Geometry

Data structures

Mathematics

Starter code: class Solution:
    def isBoomerang(self, points: List[List[int]]) -> bool:
        

Solutions:
class Solution:

	def isBoomerang(self, points: List[List[int]]) -> bool:
		(x1, y1) = points[0]
		(x2, y2) = points[1]
		(x3, y3) = points[2]
		return (y2 - y1) * (x3 - x1) != (y3 - y1) * (x2 - x1)


class Solution:

	def isBoomerang(self, points: List[List[int]]) -> bool:
		return points[0][0] * (points[1][1] - points[2][1]) + points[1][0] * (points[2][1] - points[0][1]) + points[2][0] * (points[0][1] - points[1][1]) != 0