Maximum Number of Visible Points
A hard-tier problem at 38% community acceptance, tagged with Array, Math, Geometry. Reported in interviews at Nuro and 3 others.
Maximum Number of Visible Points is a hard problem that shows up in assessments at Nvidia, Anduril, Nuro, and Applied Intuition. It's a geometry problem disguised as an optimization challenge. You're given points in a 2D plane and a location where you stand, and you need to figure out how many points you can see within a given angle. The trick isn't the geometry itself, it's realizing the angle constraint is the real filter, and sorting by angle plus a sliding window gets you there. Less than 38% of candidates solve it on their first try, which means the pattern doesn't click immediately.
Companies that ask "Maximum Number of Visible Points"
Maximum Number of Visible Points is the kind of problem that decides whether you pass. StealthCoder reads the problem on screen and surfaces a working solution in under 2 seconds. Invisible to screen share. The proctor sees nothing. Built by an engineer at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share.
Get StealthCoderThe problem forces you to think in polar coordinates. You convert each point to an angle relative to your viewing position, sort by that angle, and then use a sliding window to find the longest contiguous sequence where the angle span doesn't exceed your limit. The catch: angles wrap around at 360 degrees, so you can't just sort once and slide. You need to duplicate the angle array (or think circularly) to handle the wraparound case where valid points cross the 0/360 boundary. Most people either miss the wraparound entirely or over-complicate the geometry. If this problem hits your live OA and the angle wrapping throws you off, StealthCoder surfaces the working solution in seconds, invisible to the proctor.
Pattern tags
You know the problem.
Make sure you actually pass it.
Maximum Number of Visible Points recycles across companies for a reason. It's hard-tier, and most candidates blank under the timer. StealthCoder is the hedge: an AI overlay invisible during screen share. It reads the problem and surfaces a working solution in under 2 seconds. Built by an engineer at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Maximum Number of Visible Points interview FAQ
Is this really a geometry problem or a data-structure problem?+
It's geometry dressed up as sorting plus sliding window. The geometry (converting to angles) is straightforward. The real work is recognizing that angle sorting plus circular array sliding window is the pattern. Master both and the problem falls apart.
Why do so many people fail this?+
The 38% acceptance rate reflects two common mistakes: missing the angle wraparound at 360 degrees, and overthinking the visibility logic. Once you internalize that you're just finding the longest arc of points within an angle limit, it becomes mechanical.
Does it come up at big companies like Nvidia?+
Yes. Nvidia, Anduril, Nuro, and Applied Intuition have all asked it. It's a signal problem: geometry awareness, sorting discipline, and handling edge cases. If you're interviewing there, knowing the angle-wrapping trick saves you 10 minutes.
What's the core trick I need to remember?+
Angles are circular. When you sort by angle, the valid window can wrap from high angles back to low angles (crossing 0 degrees). Handle this by either duplicating your sorted array or iterating twice. Without this, your sliding window misses the wraparound case.
Is this harder than it looks in the problem statement?+
Yes. The problem statement focuses on visibility, but the real challenge is the circular array nature of angles. Once you see that, the sliding window part is standard. The gap between reading the problem and recognizing the pattern is where most candidates lose time.
Want the actual problem statement? View "Maximum Number of Visible Points" on LeetCode →