Available question text
Choose an axis-aligned square centered at the origin to maximize the number of points inside it with all tags distinct. Because a square includes exactly the points with max(|x|,|y|) ≤ r, sort points by that value and sweep increasing r while tracking tag frequencies to find the largest prefix with no duplicate tags.
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 3143. Maximum Points Inside the Square
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source