Number of Ways to Split Array LeetCode solution in Python

1
class Solution:
2
    def waysToSplitArray(self, nums: List[int]) -> int:
3
        prefix_sum = [nums[0]]
4
        n = len(nums)
5
        for i in range(1, n):
6
            prefix_sum.append(nums[i] + prefix_sum[-1])
7

8
        count = 0
9
        for i in range(n - 1):
10
            if prefix_sum[i] >= prefix_sum[n - 1] - prefix_sum[i]:
11
                count += 1
12
        return count