Very Easy Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int minimumSeconds(vector<int>& nums) {\n        map<int, vector<int> > mp;\n        int n = nums.size();\n        for(int i = 0; i < n; i++) mp[nums[i]].push_back(i);\n\n\n        int ans = 1e9;\n        for(auto it: mp){\n            vector<int>& v = it.second;\n            int num = v.size();\n            int cnt = 0;\n            cnt = (v[0] + n - v.back()) / 2;\n            for(int i = 1; i < num; i++) cnt = max(cnt, (v[i] - v[i-1]) / 2);\n\n            ans = min(cnt, ans);\n        }\n\n        return ans;\n    }\n};\n```
['Array', 'Hash Table', 'C++']