• Home
• com.github.javadev
• leetcode-in-java21
• 1.30
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1001_1100.s1037_valid_boomerang.readme.md Maven / Gradle / Ivy

1037\. Valid Boomerang

Easy

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