JAVA || 3MS 🚀🚀|| BEATS 60 % || EASY SOLUTION✅✅ ||  
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int waysToSplitArray(int[] arr) {
		int count = 0;long sum = 0;
        for(int i = 0 ; i< arr.length; i++)
        {
            sum += arr[i];
        }
        long temp = 0;
        for(int i = 0; i < arr.length - 1; i++)
        {
            temp += arr[i];
            if(temp >= sum - temp)
            {
                count++;
            }
        }
        return count;
    }
}
```
['Java']