Valid Boomerang Problem

Valid Boomerang Problem — ExecCode Easy DSA Practice

Solve the Valid Boomerang problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are 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 . Your task is to a boomerang is a set of three points that are all distinct and not in a straight line. Return the required answer exactly as shown in the examples.

Examples

Input {"points": [[1, 1], [2, 3], [3, 2]]}; Output True. Input {"points": [[1, 1], [2, 2], [3, 3]]}; Output False

Constraints

points.length == 3 points[i].length == 2 0 <= xi, yi <= 100

Practice Valid Boomerang free on ExecCode. Browse DSA problems, topic map, and placement guides.