chore: add LeetCode daily solution

Author: TechnoBlogger14o3

Easy/2025-09-04-3516-Find-Closest-Person/explanation.md

@@ -0,0 +1,31 @@
+# Find Closest Person (Easy)
+
+**Problem ID:** 3516  
+**Date:** 2025-09-04  
+**Link:** https://leetcode.com/problems/find-closest-person/
+
+## Approach
+
+To solve the problem of determining which person reaches Person 3 first on a number line, we can break down the solution into a few clear steps:
+
+### Main Idea:
+The core idea is to calculate the distance each person (Person 1 and Person 2) needs to travel to reach Person 3 and then compare these distances. The person with the shorter distance will reach Person 3 first.
+
+### Steps:
+1. **Calculate Distances**:
+   - Compute the absolute distance from Person 1 (position `x`) to Person 3 (position `z`): `distance1 = |x - z|`.
+   - Compute the absolute distance from Person 2 (position `y`) to Person 3 (position `z`): `distance2 = |y - z|`.
+
+2. **Compare Distances**:
+   - If `distance1` is less than `distance2`, return `1` (Person 1 arrives first).
+   - If `distance1` is greater than `distance2`, return `2` (Person 2 arrives first).
+   - If both distances are equal, return `0` (both arrive at the same time).
+
+### Data Structures:
+This problem does not require any complex data structures. Simple integer variables are sufficient to store the positions and distances.
+
+### Complexity:
+- **Time Complexity**: O(1), as we perform a constant number of operations regardless of input size.
+- **Space Complexity**: O(1), since we only use a fixed amount of space to store the distances and results.
+
+This approach is efficient and straightforward, leveraging basic arithmetic operations to arrive at the solution.

Easy/2025-09-04-3516-Find-Closest-Person/solution.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int findClosestPerson(int x, int y, int z) {
+        int distance1 = Math.abs(x - z);
+        int distance2 = Math.abs(y - z);
+        
+        if (distance1 < distance2) {
+            return 1;
+        } else if (distance1 > distance2) {
+            return 2;
+        } else {
+            return 0;
+        }
+    }
+}

Easy/2025-09-04-3516-Find-Closest-Person/solution.js

@@ -0,0 +1,12 @@
+function findClosestPerson(x, y, z) {
+    const distance1 = Math.abs(x - z);
+    const distance2 = Math.abs(y - z);
+    
+    if (distance1 < distance2) {
+        return 1;
+    } else if (distance2 < distance1) {
+        return 2;
+    } else {
+        return 0;
+    }
+}

Easy/2025-09-04-3516-Find-Closest-Person/solution.py

@@ -0,0 +1,11 @@
+class Solution:
+    def findClosestPerson(self, x: int, y: int, z: int) -> int:
+        dist1 = abs(x - z)
+        dist2 = abs(y - z)
+        
+        if dist1 < dist2:
+            return 1
+        elif dist2 < dist1:
+            return 2
+        else:
+            return 0

README.md

@@ -138,3 +138,4 @@ Each problem includes:
 - 2025-09-01 — [Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/) (Medium) → `Medium/2025-09-01-1792-Maximum-Average-Pass-Ratio`
 - 2025-09-02 — [Find the Number of Ways to Place People I](https://leetcode.com/problems/find-the-number-of-ways-to-place-people-i/) (Medium) → `Medium/2025-09-02-3025-Find-the-Number-of-Ways-to-Place-People-I`
 - 2025-09-03 — [Find the Number of Ways to Place People II](https://leetcode.com/problems/find-the-number-of-ways-to-place-people-ii/) (Hard) → `Hard/2025-09-03-3027-Find-the-Number-of-Ways-to-Place-People-II`
+- 2025-09-04 — [Find Closest Person](https://leetcode.com/problems/find-closest-person/) (Easy) → `Easy/2025-09-04-3516-Find-Closest-Person`