Solution: Maximum Number of Visible Points

Understand how to calculate angles of points relative to a fixed position and determine the largest subset visible within a given field of view. This lesson guides you through sorting angles, handling angle wrap-around, and applying the two pointers technique to solve visibility problems on the X-Y plane efficiently.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

You are provided with an array, points, an integer angle, and your location, where points[i] = [x_i, y_i] and location = [pos_x, pos_y], both representing integer coordinatesInteger coordinates refer to points on a plane where x and y values are whole numbers. on the X-Y plane.

You initially face directly east from your fixed location and cannot move. In other words, pos_x and pos_y cannot be changed. However, you can rotate to adjust your viewing direction. Your field of view, measured in degrees, is specified by the angle, representing the width of visibility. If you rotate counterclockwise by an angle $d$ , your visible field spans the inclusive range of angles $[d-\frac{angle}{2}, d+\frac{angle}{2}]$ ...