← All problemsSign in

Valid Boomerang

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. ###Input: - First line will contain $T$, number of testcases. - Each testcase contains of a single line of six space seperated integers , x1, y1, x2, y2, x3, y3 respectively ###Output: For each testcase, output is a boolea

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start