solves minimum number of moves to seat everyone

Author: anishLearnsToCode

README.md

@@ -485,7 +485,7 @@
 | 2022 | [Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array)                                                            |                                                            [![Java](assets/java.png)](src/Convert1DArrayInto2DArray.java)                                                            |                                                                                                                                   |
 | 2027 | [Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string)                                                          |                                                           [![Java](assets/java.png)](src/MinimumMovesToConvertString.java)                                                           |                                                                                                                                   |
 | 2032 | [Two Out of Three](https://leetcode.com/problems/two-out-of-three)                                                                                        |                                                                  [![Java](assets/java.png)](src/TwoOutOfThree.java)                                                                  |                                                                                                                                   |
-| 2037 | [Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone)                                        |                                                                                                                                                                                      |                                                                                                                                   |
+| 2037 | [Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone)                                        |                                                       [![Java](assets/java.png)](src/MinimumNumberOfMovesToSeatEveryone.java)                                                        |                                                                                                                                   |
 | 2042 | [Check if Numbers Are Ascending in a Sentence](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence)                                |                                                                                                                                                                                      |                                                                                                                                   |
 | 2047 | [Number of Valid Words in a Sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence)                                                  |                                                                                                                                                                                      |                                                                                                                                   |
 | 2053 | [Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array)                                                          |                                                                                                                                                                                      |                                                                                                                                   |

src/MinimumNumberOfMovesToSeatEveryone.java

@@ -0,0 +1,17 @@
+// https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone
+// T: O(n log(n))
+// S: O(1)
+
+import java.util.Arrays;
+
+public class MinimumNumberOfMovesToSeatEveryone {
+    public int minMovesToSeat(int[] seats, int[] students) {
+        Arrays.sort(seats);
+        Arrays.sort(students);
+        int minMoves = 0;
+        for (int i = 0 ; i < students.length ; i++) {
+            minMoves += Math.abs(seats[i] - students[i]);
+        }
+        return minMoves;
+    }
+}