Easy || TC - O(N logN) || Python
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n1. Sorting nums first.\
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n1. Sorting nums first.\n\n2. Using the Datastructure deque to pop the max and min elements form nums in O(1) time complexity.\n\n3. Starting a "For" loop from 0 till len(nums)//2, and popping max and min elements and calculating their average.\nAppending the average everytime we calculate it in AVG list.\n\n4. In the end we are returning the min element from AVG.\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(N logN)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n\n# Code\n```\nclass Solution:\n    def minimumAverage(self, nums: List[int]) -> float:\n        nums.sort()\n        DEQ = deque(nums)\n        AVG = []\n        for i in range(len(nums)//2):\n            AVG.append( (DEQ.pop() + DEQ.popleft())/2 )\n        return min(AVG)\n\n```
['Python3']