# Maximum Number Of Darts Inside Of A Circular Dartboard: Study Guide

Maximum Number Of Darts Inside Of A Circular Dartboard shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

n points and a circle of radius r; place the circle to cover as many points as possible. For each pair of points at distance <= 2r there are at most two candidate centers (intersection of two radius-r circles); count how many points lie within r of each candidate (plus each single-point center).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n^3) or O(n^2 log n) with angular sweep.

## Common mistake

Using the bounding box centroid, or skipping the two-circle intersection geometry.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at interview copilot app.