Leetcode 1013. Partition Array Into Three Parts With Equal Sum
Determine whether an integer array can be split into three non-empty contiguous parts whose sums are equal. Key insight: the total sum must be divisible by 3, and you must be able to find two cut points (in one pass) where the running sum equals one-third of the total.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.