2024-06-13 07:32:12 +0000 UTC

Minimum Number of Moves to Seat Everyone
Categories:
Tags:

Code

class Solution:
    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:
        seats.sort()
        students.sort()
        moves = 0

        for i in range(len(seats)) :
            moves += abs(seats[i] - students[i])

        return moves