Solve biweekly contest question 3

Author: SartHak-0-Sach

Diff for: Leetcode contests/01-Biweekly Contest 110/3-Min_seconds_to_equalize_circular_arr.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <vector>
+#include <climits>
+#include <algorithm>
+#include <unordered_map>
+using namespace std;
+
+int minimumSeconds(vector<int> &nums)
+{
+    unordered_map<int, vector<int>> mp;
+    for (int i = 0; i < nums.size(); i++)
+        mp[nums[i]].push_back(i);
+
+    int ans = nums.size(), x = 0;
+
+    for (auto &k : mp)
+    {
+        x = k.second[0];
+        int y = nums.size() - k.second.back() - 1;
+        x += y;
+        x = (x + 1) / 2;
+        for (int i = 0; i < k.second.size() - 1; i++)
+            x = max(x, (k.second[i + 1] - k.second[i]) / 2);
+        ans = min(ans, x);
+    }
+
+    return ans;
+}
+
+int main(int argc, char const *argv[])
+{
+    vector<int> nums = {2, 4, 6, 23, 34, 12, 233, 45553, 45795};
+    int sec = minimumSeconds(nums);
+    cout << sec << endl;
+    return 0;
+}