Split array in three equal sum subarrays | Arrays | MEDIUM

[@galepraveen]

vector findSplit(vector& arr) { int total = accumulate(begin(arr), end(arr), 0); int n = arr.size(); if(total == 0) return {0, 0}; if(total % 3 != 0) return {-1, -1}; int equalHalves = total / 3; int firstHalf = 0; int i = 0; while(i < n && firstHalf + arr[i] = i && thirdHalf + arr[j]