easy solution beats 100% of the users please upvote guys
Intuition\nTo solve the problem of finding the minimum average of subarrays of length 2 from a given list of integers (nums), we can leverage a straightforward 
# Intuition\nTo solve the problem of finding the minimum average of subarrays of length 2 from a given list of integers (nums), we can leverage a straightforward approach:\n\nIterate through pairs: Since we need to find subarrays of length 2, we can iterate through the list in pairs (nums[i], nums[i+1]).\n\nCalculate averages: For each pair (nums[i], nums[i+1]), compute the average (nums[i] + nums[i+1]) / 2.\n\nTrack the minimum average: Maintain a variable to keep track of the minimum average encountered during the iteration.\n\nReturn the minimum average: Once all pairs have been processed, return the minimum average found.\n\n# Approach\nInitialize a variable min_average to store the minimum average encountered, initially set to a large number.\nIterate through the list nums up to the second last element (since we need pairs).\nFor each index i, compute the average of nums[i] and nums[i+1].\nUpdate min_average if the current average is smaller.\nAfter iterating through all possible pairs, return min_average.\nThis approach ensures that we efficiently find the minimum average without unnecessary computations.\n\n# Complexity\n- Time complexity:\nO(n)\n\n- Space complexity:\nO(1)\n\n# Code\n```\nclass Solution:\n    def minimumAverage(self, nums: List[int]) -> float:\n        averages = []\n        n = len(nums)\n        \n        for _ in range(n // 2):\n            minElement = min(nums)\n            maxElement = max(nums)\n            nums.remove(minElement)\n            nums.remove(maxElement)\n            averages.append((minElement + maxElement) / 2)\n        \n        return min(averages)\n```\n\n![download.jpg](https://assets.leetcode.com/users/images/de9028db-8d58-448f-870a-ed7a62c24d24_1719117444.2690127.jpeg)\n
['Python3']