Easy To Understand & Fast Approach with eliminating TLE using Sliding Window
Intuition\n Describe your first thoughts on how to solve this problem. \nIn order to answer this issue, we must add up two different array segments, find their 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nIn ***order*** to ***answer*** this ***issue***, we ***must add*** up two different array ***segments***, find ***their*** average, then ***reduce*** the ****absolute**** ***difference*** ***between*** them.\n\n***Therefore***, we will ***first compute*** the ***total*** of the left portion ***using*** left sum, then we will ***get its*** average, and ***finally***, we can do the same for the right portion ***using*** right sum, after which we will ***determine*** which is the ***least absolute*** difference to store in mini.\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nHere we are simply using technique same as ***sliding window*** technique\n\n# Complexity\n- Time complexity:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def minimumAverageDifference(self, nums: List[int]) -> int:\n        size = len(nums)\n        mini = sys.maxsize\n        ind = 0\n        left_sum = 0\n        right_sum = sum(nums)\n        for i in range(size):\n            left_sum += nums[i]\n            right_sum -= nums[i]\n\n            st = left_sum // (i + 1)\n            if i == size - 1:\n                end = 0\n            else:\n                end = right_sum // (size - (i + 1))\n\n            if mini > abs(st - end):\n                mini = abs(st - end)\n                ind = i\n        return ind\n```
['Array', 'Sliding Window', 'Python3']