Simple O(n) Time and O(1) Space Solution || Python
If you have any doubts or suggestion, put in comments.\n\nclass Solution(object):\n    def waysToSplitArray(self, nums):\n        lSum, rSum = 0, sum(nums)\n   
If you have any ***doubts*** or ***suggestion***, put in comments.\n```\nclass Solution(object):\n    def waysToSplitArray(self, nums):\n        lSum, rSum = 0, sum(nums)\n        ans = 0\n        for i in range(len(nums) - 1):\n            lSum += nums[i]\n            rSum -= nums[i]\n            if lSum >= rSum: ans += 1\n        return ans\n```\n**UpVote**, if you like it **:)**
['Python', 'Python3']