python beginner friendly code must check it for simply code and neat explaination .
Intuitionsoo basically what we want in this problem is that to find the number of pairs that can be formed with splitting the nums ( array) given through.thats
# Intuition
soo basically what we want in this problem is that to find the number of pairs that can be formed with splitting the nums ( array) given through.thats the basic idea of this problem except under few critereas for those who are new to solve python u totally need not to understand the whole logic of the code instead the basic criteria of the question and what to do except whats given in the question.

# Approach
<!-- Describe your approach to solving the problem. -->
i have mentioned the approach in comments within the solution code
1) from the question : i+ 1 >= n-i-1 (left >= right) im taking the
 (i + 1 ) as left and (n- i-1 ) as right ,
2)Declare "c" to increment the count by one .
3)find the total sum of the array 
4)declare left = 0 we can increment the array later 
5)for i in range(len(nums) - 1) : ------> what this does is that simply take the array ie the nums in the loop and store it in i 
6)add the nums[i] into the left section .
7)then use the formula given in the question that is right = total - left(n-i-1).
8)compare the left and right if left >= right 
9) increment c by 1 
10)return c

GUYS CODING AINT THAT HARD AS U THINK ITS HARD CUS YOU GUYS DONT THINK THANK YOU AND HAVE A NICE DAY AHEAD

# Code
```python3 []
class Solution:
    def waysToSplitArray(self, nums: List[int]) -> int:
        #i+ 1 >= n-i-1 (left >= right)
        #total = sum(nums)
        # one element to the right ( i (right) = total - left )
        total = sum(nums)
        c =  0
        left = 0 
        for  i in range( len(nums)  - 1 ) :
            left += nums[i]
            right = total - left 
            if left >= right :
                c += 1
        return c
```
['Python3']