✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)Code #1 - ShortTime complexity: O(n). Space complexi
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)

# Code #1 - Short
Time complexity: $$O(n)$$. Space complexity: $$O(n)$$.
```python3
class Solution:
    def waysToSplitArray(self, a: List[int]) -> int:
        return sum(map(ge,accumulate(a),[*accumulate(a[:0:-1])][::-1]))
```

# Code #2
Time complexity: $$O(n)$$. Space complexity: $$O(n)$$.
```
class Solution:
    def waysToSplitArray(self, a: List[int]) -> int:
        return (p:=[*accumulate(a)]) and sum(2*q>=p[-1] for q in p[:-1])
```

# Code #3 - Memory Saving
Time complexity: $$O(n)$$. Space complexity: $$O(1)$$.
```python3
class Solution:
    def waysToSplitArray(self, a: List[int]) -> int:
        return sum(map(ge,accumulate(a),accumulate(a[1:-1],sub,initial=sum(a[1:]))))
```

(Disclaimer 2: code above is just a product of fantasy packed into one line, it is not claimed to be 'true' oneliners - please, remind about drawbacks only if you know how to make it better)
['Array', 'Prefix Sum', 'Python', 'Python3']