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

The absolute sum difference between two arrays is defined as the sum of $|$nums1[i] $-$ nums2[i]$|$ for all $0 \leq$ i $< n$.

You can replace at most one element of nums1 with any other element present in nums1 to minimize the absolute sum difference.

Return the minimum absolute sum difference after replacing at most one element. Since the answer may be large, return it modulo $10^9 + 7$.

Constraints:

• n $==$ nums1.length

• n $==$ nums2.length

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

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

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.