Split Array with Equal Sum

Determine whether you can choose three split indices to partition an integer array into four non-overlapping subarrays that all have the same sum. The core challenge is to efficiently search candidate split positions using prefix sums and set/hash lookups to match equal segment sums.