✔️PYTHON || EASY || ✔️ BEGINER FRIENDLY
l -> sum of left array\nr -> sum of right array\n\nAs we keep iterating we keep adding to l and delete from r\n\n\n\nclass Solution:\n    def minimumAverageDiff
l -> sum of left array\nr -> sum of right array\n\nAs we keep iterating we keep adding to **l** and delete from **r**\n![image](https://assets.leetcode.com/users/images/77ee6f46-f8ed-40a1-80d0-8cc4dff1d386_1654090771.8141484.jpeg)\n\n```\nclass Solution:\n    def minimumAverageDifference(self, a: List[int]) -> int:\n        l=0\n        r=sum(a)\n        z=100001\n        y=0\n        n=len(a)\n        \n        for i in range(n-1):\n            l+=a[i]\n            r-=a[i]\n        \n            d=abs((l//(i+1))-(r//(n-i-1)))\n            if d<z:\n                z=d\n                y=i\n        \n        if sum(a)//n<z:\n            y=n-1\n        \n        return y\n```\n![image](https://assets.leetcode.com/users/images/ef6ef7cc-c4b8-48f3-ab7a-eb7fe4296e67_1654090737.6638153.jpeg)\n
['Python', 'Python3']