Add solution #2037

Author: JoshCrozier

2037-minimum-number-of-moves-to-seat-everyone.js

@@ -0,0 +1,29 @@
+/**
+ * 2037. Minimum Number of Moves to Seat Everyone
+ * https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/
+ * Difficulty: Easy
+ *
+ * There are n availabe seats and n students standing in a room. You are given an array
+ * seats of length n, where seats[i] is the position of the ith seat. You are also given
+ * the array students of length n, where students[j] is the position of the jth student.
+ *
+ * You may perform the following move any number of times:
+ * - Increase or decrease the position of the ith student by 1 (i.e., moving the ith
+ * student from position x to x + 1 or x - 1)
+ *
+ * Return the minimum number of moves required to move each student to a seat such that
+ * no two students are in the same seat.
+ *
+ * Note that there may be multiple seats or students in the same position at the beginning.
+ */
+
+/**
+ * @param {number[]} seats
+ * @param {number[]} students
+ * @return {number}
+ */
+var minMovesToSeat = function(seats, students) {
+  seats.sort((a, b) => a - b);
+  students.sort((a, b) => a - b);
+  return seats.reduce((a, b, i) => a += Math.abs(seats[i] - students[i]), 0);
+};

README.md

@@ -368,6 +368,7 @@
 2011|[Final Value of Variable After Performing Operations](./2011-final-value-of-variable-after-performing-operations.js)|Easy|
 2016|[Maximum Difference Between Increasing Elements](./2016-maximum-difference-between-increasing-elements.js)|Easy|
 2027|[Minimum Moves to Convert String](./2027-minimum-moves-to-convert-string.js)|Easy|
+2037|[Minimum Number of Moves to Seat Everyone](./2037-minimum-number-of-moves-to-seat-everyone.js)|Easy|
 2047|[Number of Valid Words in a Sentence](./2047-number-of-valid-words-in-a-sentence.js)|Easy|
 2053|[Kth Distinct String in an Array](./2053-kth-distinct-string-in-an-array.js)|Medium|
 2085|[Count Common Words With One Occurrence](./2085-count-common-words-with-one-occurrence.js)|Easy|