O(n) very Easy And Intutive Solution || JAVA
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    public int minimumAverageDifference(int[] nums) {\n        int diff = Integer.MAX_VALUE;\n        int i = 0;\n        int n = nums.length;\n        int ans = -1;\n        long totalsum = 0;\n        for(int T:nums){\n            totalsum+= T;\n        }\n        long leftsum = 0;\n        while(i<nums.length){\n            leftsum += nums[i];\n            long rightsum = totalsum - leftsum;\n            int lsavg = (int)(leftsum/(i+1));\n            int rsavg = (i == n - 1) ? 0 : (int)(rightsum / (n - i - 1));\n            int currdiff = Math.abs(lsavg-rsavg);\n            if(currdiff<diff){\n                diff = currdiff;\n                ans = i;\n            }\n            i++;\n        }\n        return ans;\n    }\n}\n```
['Java']