PYHTON SOLUTION FOR BEGGINERS || VERY EASY USING
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def minMovesToSeat(self, seats: List[int], students: List[int]) -> int:\n         qadam = 0\n         seats.sort()\n         students.sort()\n         for st in range(len(students)):\n             qadam += abs(students[st] - seats[st])\n         return qadam\n\n\n\n\n\n\n\n\n              \n              \n              \n\n\n\n             \n          \n\n         \n```
['Python3']