Simple Python 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```\nclass Solution:\n    def minimumSeconds(self, nums: List[int]) -> int:\n\n        n = len(nums)\n        counter = {}\n\n        for j in range(2*n):\n\n            i = j%n\n\n            if nums[i] not in counter:\n                counter[nums[i]] = [0, j]\n            else:\n                counter[nums[i]] = [max(counter[nums[i]][0], j-counter[nums[i]][1]), j]\n                        \n        ans = float("inf")\n        \n        for i in counter.keys():\n            ans = min(ans, floor(counter[i][0]/2))\n            \n        return ans\n            \n\n            \n\n            \n        \n            \n            \n        \n```
['Hash Table', 'Python3']