Leetcode 2321. Maximum Score Of Spliced Array

Given two equal-length arrays where you may swap at most one contiguous subarray between them, maximize the larger of the two arrays' sums after the swap. This reduces to computing base sums and using Kadane's algorithm on the difference arrays (nums2−nums1 and nums1−nums2) to find the best subarray gain for boosting either array.