Search
⌘K

Leetcode 1610. Maximum Number of Visible Points

Convert each point to its polar angle around your location (counting points at the exact location separately), sort these angles and handle the circular wrap (e.g., by duplicating angles +360°), then use a sliding window / two-pointer scan to find the maximum number of points within any angular interval of width = angle; expected O(n log n) for n up to 1e5.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.