Leetcode Problem 548. Split Array with Equal Sum

548. Split Array with Equal Sum

Leetcode Solutions

Compute the cumulative sum array sum such that sum[i] holds the sum of elements from nums[0] to nums[i].
Iterate over the possible positions for the middle cut j.
For each j, create a new HashSet set.
Iterate over the possible positions for the left cut i that are less than j.
If sum[i-1] (sum of the first part) is equal to sum[j-1] - sum[i] (sum of the second part), add sum[i-1] to set.
Iterate over the possible positions for the right cut k that are greater than j.
If sum[n-1] - sum[k] (sum of the fourth part) is equal to sum[k-1] - sum[j] (sum of the third part) and the sum exists in set, return true.
If no such triplet is found, return false.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen