Given an array of points, where each point is represented as points[i]$\text = [x_i, y_i]$, which are the coordinates of the $i^{th}$ point on an X-Y plane where some points may have identical coordinates. Additionally, given an array of queries, where each queries[j] $\text = [x_j, y_j, r_j]$ represents a circle centered at the point $[x_j, y_j]$ with a radius $r_j$.

For each query, your task is to determine how many points lie within or on the boundary of the specified circle. The function should return an array answer, where answer[j] holds the number of points inside the $j^{th}$ circle.

Note: Points on the circle’s edge should also be counted inside the circle.

Constraints:

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

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

• $0 \leq x_i, y_i$ $\leq 100$

• $1 \leq$ queries.length $\leq 100$

• queries[j].length $== 3$

• $0 \leq x_j, y_j$ $\leq 100$

• $1 \leq r_j$ $\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 problem correctly:

We have a game for you to play. Rearrange the logical building blocks to better understand how to solve this problem.

Implement your solution in the following coding playground.