3143. Maximum Points Inside the Square

You are given a 2D array

`points`

and a string`s`

where,`points[i]`

represents the coordinates of point`i`

, and`s[i]`

represents thetagof point`i`

.A

validsquare is a square centered at the origin`(0, 0)`

, has edges parallel to the axes, anddoes notcontain two points with the same tag.Return the

maximumnumber of points contained in avalidsquare.Note:

- A point is considered to be inside the square if it lies on or within the square’s boundaries.
- The side length of the square can be zero.

1 | class Solution { |