human
I found an interesting problem on https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/:
Given an array A of integers, return true if and only if we can partition the array into three non-empty parts with equal sums.
Formally, we can partition the array if we can find indexes i+1 < j with (A[0] + A[1] + ... + A[i] == A[i+1] + A[i+2] + ... + A[j-1] == A[j] + A[j-1] + ... + A[A.length - 1])
 
Example 1:
Input: A = [0,2,1,-6,6,-7,9,1,2,0,1]
Output: true
Explanation: 0 + 2 + 1 = -6 + 6 - 7 + 9 + 1 = 2 + 0 + 1

Example 2:
Input: A = [0,2,1,-6,6,7,9,-1,2,0,1]
Output: false

Example 3:
Input: A = [3,3,6,5,-2,2,5,1,-9,4]
Output: true
Explanation: 3 + 3 = 6 = 5 - 2 + 2 + 5 + 1 - 9 + 4

 
Constraints:

3 <= A.length <= 50000
-10^4 <= A[i] <= 10^4

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is Python program to find indexes i+1 < j with (A[0] + A[1] + .

class Solution:
    def canThreePartsEqualSum(self, A: List[int]) -> bool:
        s = sum(A)
        if s%3 != 0: 
            return False
        ps = s//3
        count = 0
        for x in A:
            ps -= x
            if not ps:
                ps = s//3
                count+=1
        return count >= 3