Solution: Magnetic Force Between Two Balls

Explore how to distribute balls among baskets to maximize the smallest magnetic force between any two balls. Understand how to apply sorting and binary search techniques to systematically find the optimal spacing, and implement a helper function to validate ball placement under constraints. This lesson helps you solve a classic allocation problem with an efficient binary search approach.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

In the universe Earth C-137, Rick has discovered a unique type of magnetic force between two balls when placed in his newly invented baskets. He has $n$ baskets, each located at specific positions given by the array position[i]. Morty has m balls and needs to distribute these balls across the baskets in such a way that the minimum magnetic force between any two balls is as large as possible.

The magnetic force between two balls placed at positions $x$ and $y$ is calculated as the absolute difference $|x−y|$ .

Given an integer array position and the number of balls m, return the maximum possible value of the minimum magnetic force between any two balls after they have been placed in the baskets.

Constraints:

$2 \leq$ position.length $\leq 10^3$ ...