Available question text
Count ordered tuples (i, j, k) of distinct 2D points where j and k are equidistant from i; for each point build a frequency map of squared distances to others and sum m*(m-1) over each distance group (O(n^2) time).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 447. Number of Boomerangs
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source