Available question text
Given n basket positions and m balls, place the balls to maximize the minimum pairwise distance (magnetic force) between any two balls. This is the classic "maximize minimum distance" problem — sort positions and binary-search the largest feasible distance, using a greedy placement check.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1552. Magnetic Force Between Two Balls
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source