You are provided with an array, points, an integer angle, and your location, where points[i] = [xi, yi] and location = [posx, posy], 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, posx and posy 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}]$.

Note: The following slide deck illustrates the observer’s location, angle, observer’s rotation, and the corresponding fields of view.

A set of points is visible to you if, for each point, the angle formed by the point, your position, and the immediate east direction from your position falls within your field of view.

There can be multiple points at one coordinate. There may be points at your location, and you can always see these points regardless of your rotation. Points do not obstruct your vision to other points.

Return the maximum number of points you can see.

Constraints:

• $1 \leq$ points.length $\leq 1000$

• points[i].length $== 2$

• location.length $==2$

• $0 \leq$ angle $< 360$

• $0 \leq$ posx $,$posy $,$ xi $,$ yi $\leq 100$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.