Here is a Python solution for the problem:

```python
def can_partition(nums):
total_sum = sum(nums)
if total_sum % 3 != 0:
return False

count = 0
sub_sum = 0
for num in nums:
sub_sum += num
if sub_sum == total_sum / 3:
sub_sum = 0
count += 1

return count = 3

# Test the function
nums = [3, 3, 6, 5, -2, 2, 5, 1, -9, 4]
print(can_partition(nums)) # Output: True
```

Here is the step-by-step explanation:

1. Calculate the total sum of the array. If the total sum is not divisible by 3, return False because it's impossible to partition the array into three equal sums.

2. Initialize a counter and a variable to keep track of the current subarray sum.

3. Iterate over the array. For each number, add it to the current subarray sum.

4. If the current subarray sum equals to the total sum divided by 3, reset the subarray sum to 0 and increment the counter.

5. After the loop, if the counter is greater than or equal to 3, return True. This means we can partition the array into at least three subarrays with equal sums. Otherwise, return False.

Question

Here is a Python solution for the problem:

```python
def can_partition(nums):
    total_sum = sum(nums)
    if total_sum % 3 != 0:
        return False

count = 0
    sub_sum = 0
    for num in nums:
        sub_sum += num
        if sub_sum == total_sum / 3:
            sub_sum = 0
            count += 1

return count >= 3

# Test the function
nums = [3, 3, 6, 5, -2, 2, 5, 1, -9, 4]
print(can_partition(nums))  # Output: True
```

Here is the step-by-step explanation:

1. Calculate the total sum of the array. If the total sum is not divisible by 3, return False because it's impossible to partition the array into three equal sums.

2. Initialize a counter and a variable to keep track of the current subarray sum.

3. Iterate over the array. For each number, add it to the current subarray sum.

4. If the current subarray sum equals to the total sum divided by 3, reset the subarray sum to 0 and increment the counter.

5. After the loop, if the counter is greater than or equal to 3, return True. This means we can partition the array into at least three subarrays with equal sums. Otherwise, return False.

Knowee AI · Accepted Answer