🧑‍🤝‍🧑 Day 29

Author: AkashRajpurohit

README.md

@@ -47,7 +47,7 @@
 
 ## Week 5 🚧
 
-Coming Soon...
+1. [Maximize Distance to Closest Person](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/563/week-5-october-29th-october-31st/3512/) ➡️ [CPP Solution](Week5/maxDistToClosest.cpp)
 
 ## Other Challenges 💪
 

Week5/maxDistToClosest.cpp

@@ -0,0 +1,25 @@
+class Solution {
+public:
+    int maxDistToClosest(vector<int>& seats) {
+        vector<int> onesPos;
+        int n = seats.size();
+        int maxDistance = 0;
+        
+        for(int i = 0; i < n; ++i) {
+            if(seats[i] == 1) onesPos.push_back(i);
+        }
+        
+        int m = onesPos.size();
+        
+        if(onesPos[0] != 0)
+            maxDistance = max(maxDistance, onesPos[0]);
+        
+        for(int i = 0; i < m - 1; ++i)
+            maxDistance = max(maxDistance, (onesPos[i + 1] - onesPos[i]) / 2);
+        
+        if(onesPos[m - 1] != n - 1)
+            maxDistance = max(maxDistance, n - 1 - onesPos[m - 1]);
+        
+        return maxDistance;
+    }
+};