DISPRZ Hiring Challenge | On-Campus OA (2024) | Minimum Number of Moves

Q1: Minimum Number of Moves to Seat Everyone Problem Statement You are given two arrays: seats – positions of available seats. students – positions of students. Each student can move left or right by one position in one move. Return the minimum total number of moves required so every student occupies exactly one seat. Example Input seats = [3,1,5] students = [2,7,4] Output 4 Constraints 1 ≤ seats.length = students.length ≤ 100