Leetcode 1828. Queries on Number of Points Inside a Circle

Given a set of 2D integer points and multiple circular queries, compute for each circle how many points lie inside or on it; the main challenge is answering many geometric range-count queries efficiently—naively O(n) distance checks per query can be improved using spatial indexing or bucketing (the small coordinate range [0,500] is helpful).