LeetCode question

[sachin4429]

1828. Queries on Number of Points Inside a Circle

You are given an array points where points[i] = [xi, yi] is the coordinates of the ith point on a 2D plane. Multiple points can have the same coordinates.

You are also given an array queries where queries[j] = [xj, yj, rj] describes a circle centered at (xj, yj) with a radius of rj.

For each query queries[j], compute the number of points inside the jth circle. Points on the border of the circle are considered inside.

Return an array answer, where answer[j] is the answer to the jth query.

[sachin4429]

Can I work on this Issue for Hactoberfest 2021.

[Karthik-59]

Hey @rjkalash can I work on spiral matrix question in java ?

[rohan9024]

Can I work on this Issue for Hactoberfest 2021?

[Pratixingh]

I want to work on this issue could you please assign me .

[shashwat010]

I would like to work on this issue in C++.

[rjkalash]

this repo is no more participating in hacktoberfest