Available question text
Given positions of n seats and n students, minimize the total number of moves (sum of absolute position changes) to assign each student to a distinct seat; this reduces to pairing students and seats to minimize the sum of absolute differences (optimal via sorting both arrays and matching corresponding elements).
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 2037. Minimum Number of Moves to Seat Everyone
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source