Add solution #3516

Author: JoshCrozier

README.md

@@ -2759,6 +2759,7 @@
 3496|[Maximize Score After Pair Deletions](./solutions/3496-maximize-score-after-pair-deletions.js)|Medium|
 3506|[Find Time Required to Eliminate Bacterial Strains](./solutions/3506-find-time-required-to-eliminate-bacterial-strains.js)|Hard|
 3511|[Make a Positive Array](./solutions/3511-make-a-positive-array.js)|Medium|
+3516|[Find Closest Person](./solutions/3516-find-closest-person.js)|Easy|
 3520|[Minimum Threshold for Inversion Pairs Count](./solutions/3520-minimum-threshold-for-inversion-pairs-count.js)|Medium|
 3535|[Unit Conversion II](./solutions/3535-unit-conversion-ii.js)|Medium|
 

solutions/3516-find-closest-person.js

@@ -0,0 +1,39 @@
+/**
+ * 3516. Find Closest Person
+ * https://leetcode.com/problems/find-closest-person/
+ * Difficulty: Easy
+ *
+ * You are given three integers x, y, and z, representing the positions of three people
+ * on a number line:
+ * - x is the position of Person 1.
+ * - y is the position of Person 2.
+ * - z is the position of Person 3, who does not move.
+ *
+ * Both Person 1 and Person 2 move toward Person 3 at the same speed.
+ *
+ * Determine which person reaches Person 3 first:
+ * - Return 1 if Person 1 arrives first.
+ * - Return 2 if Person 2 arrives first.
+ * - Return 0 if both arrive at the same time.
+ *
+ * Return the result accordingly.
+ */
+
+/**
+ * @param {number} x
+ * @param {number} y
+ * @param {number} z
+ * @return {number}
+ */
+var findClosest = function(x, y, z) {
+  const distancePerson1 = Math.abs(x - z);
+  const distancePerson2 = Math.abs(y - z);
+
+  if (distancePerson1 < distancePerson2) {
+    return 1;
+  } else if (distancePerson2 < distancePerson1) {
+    return 2;
+  } else {
+    return 0;
+  }
+};