Given a $2$D integer array circles where circles[i] = [x_i, y_i, r_i] represents the center (x_i, y_i) and radius r_i of the $i^{ ext{th}}$ circle, return the number of unique lattice points that lie inside or on the boundary of at least one circle.

Note: A lattice point is a point with integer coordinates. A point is considered inside a circle if the distance from the point to the center of the circle is less than or equal to the radius of the circle.

Constraints:

• $1 \leq$ circles.length $\leq 200$

• circles[i].length $= 3$

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

• $1 \leq$ r_i $\leq \min($x_i, y_i$)$

Input: circles = [[10, 7, 4]]-List[List[int]]
Output: 49-int
Explanation: The circle centered at (10, 7) with radius 4 contains 49 unique lattice points inside or on its boundary.

Input: circles = [[3, 8, 1], [12, 4, 2]]-List[List[int]]
Output: 18-int
Explanation: Counting the lattice points inside or on the boundary of both circles, while counting any overlapping points only once, gives 18 unique points.

Input: circles = [[8, 8, 3], [10, 8, 2], [8, 11, 2]]-List[List[int]]
Output: 40-int
Explanation: The union of the lattice points inside or on the boundary of the three circles contains 40 unique points.

Input: circles = [[6, 5, 2], [6, 5, 2], [7, 5, 1]]-List[List[int]]
Output: 13-int
Explanation: Duplicate circles and overlapping coverage are counted only once, resulting in 13 unique lattice points inside or on the boundary of at least one circle.

Now, 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.