Untitled

class Solution {
public:
    int waysToSplitArray(vector<int>& nums) {
        int n = nums.size();
        long long prefixSum = 0,suffixSum = 0;

        for(int i=0;i<n;i++) {
            suffixSum+=nums[i];
        }

        int ans = 0;
        for(int i=0;i<n-1;i++) {
            suffixSum-=nums[i];
            prefixSum+=nums[i];

            if(prefixSum>=suffixSum) {
                ans++;
            }
        }

        return ans;
    }
};