# Magnetic Force Between Two Balls: Explained
Magnetic Force Between Two Balls shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sort the positions and binary-search the minimum gap F. A greedy left-to-right placement then checks whether you can seat m balls with every consecutive pair at least F apart.
## 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 log n + n log W).
## Common mistake
Placing balls as evenly as possible in index space rather than checking a candidate force against the sorted positions.
## 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 www.linkjob.ai.