Leetcode 1031. Maximum Sum of Two Non-Overlapping Subarrays

Find the maximum total sum of two non-overlapping contiguous subarrays of given lengths firstLen and secondLen (either order allowed). Typical approach uses prefix sums or sliding windows to precompute subarray sums and combine the best left/right placements to maximize the combined sum.