Leetcode 2219. Maximum Sum Score of Array

Given an integer array, compute the maximum possible "sum score" produced by choosing a selection (typically a split, rotation, or contiguous subarray) whose elements contribute to the score under the problem's rules. This requires scanning and comparing candidate selections efficiently using prefix sums and sliding-window/Kadane-style techniques to avoid brute-force O(n^2) checks.