You are given two integer arrays nums1 and nums2, each of length n.

You may choose two indices left and right such that $0 \leq$ left $\leq$ right $<$ n, and swap the elements between nums1 and nums2 from index left to index right inclusive. You can perform this operation at most once, or choose not to perform any swap.

The score is defined as the maximum of the sum of elements in nums1 and the sum of elements in nums2.

Return the maximum possible score you can achieve.

Constraints:

• n $==$ nums1.length $==$ nums2.length

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ nums1[i], nums2[i] $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.