Short and easy python solution using a queue. O(n)
\nAlgorithm.\nInitialize 2 sums, Left and Right. where left = nums[0] and right will sum of the rest of the elements from 1 to n.\nNow create a queue with nums[
\n**Algorithm.**\nInitialize 2 sums, Left and Right. where `left = nums[0]` and right will sum of the rest of the elements from 1 to n.\nNow create a queue with `nums[1:]`\nPop elements from the queue one by one until none are left.\nFor each element\n\t - add this to left sum\n\t - subtract this from right sum\n\t - if our condition is satisfied, add 1 to our count.\n\n```\ndef waysToSplitArray(self, nums: List[int]) -> int:\n\n    left_sum = nums[0]\n    right_sum = sum(nums[1: ])\n    count = 0\n    queue = deque(nums[1:])\n\n    while queue:\n        if left_sum >= right_sum:\n            count += 1\n\n        ele = queue.popleft()\n\n        # add to left_sum\n        left_sum += ele\n        # remove from right\n        right_sum -= ele\n\n    return count\n```
['Python']