Leetcode Problem 2219. Maximum Sum Score of Array

Algorithm\n1. Initialize leftSum and rightSum to 0.\n2. Initialize maxSumScore to the smallest possible integer value.\n3. Iterate through the array from index 0 to n - 1:\n a. Add the current element to leftSum.\n b. Calculate rightSum by subtracting the current element from the total sum of the array and adding it back (since rightSum includes the current element).\n c. Calculate the sum score at the current index as the maximum of leftSum and rightSum.\n d. Update maxSumScore if the current sum score is greater than the current maxSumScore.\n4. Return maxSumScore as the result.