Easy Aproach O(N) - Time complexity only
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
```python3 []
class Solution:
    def waysToSplitArray(self, nums: List[int]) -> int:
        result=0
        n=len(nums)
        l_sum,r_sum=0,sum(nums)
        for i in range(n-1):
            l_sum+=nums[i]
            r_sum-=nums[i]
            if l_sum>=r_sum:
                result+=1
        return result


        
```
['Array', 'Python3']