Your question is Minimize Array Sum Difference. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
How would you solve the problem of dividing an array into two subarrays so the absolute difference of their sums is minimum?