Leetcode Problem 1013. Partition Array Into Three Parts With Equal Sum

1013. Partition Array Into Three Parts With Equal Sum

Leetcode Solutions

Calculate the total sum of the array.
Check if the total sum is divisible by 3. If not, return false.
Set the target sum as the total sum divided by 3.
Initialize a running sum and a counter for the number of parts found.
Iterate through the array, adding each element to the running sum.
If the running sum equals the target sum, reset the running sum to 0 and increment the counter.
If the counter reaches 2 before the end of the array, return true.
If the end of the array is reached without the counter reaching 2, return false.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen