Given an integer array nums of even length n and an integer limit.

In $1$ move, you can replace any integer in nums with any integer value between $1$ and limit, inclusive.

The array nums is complementary if nums[i] $+$ nums[n - 1 - i] is equal to the same constant sum for every index i such that $0 \leq$ i $<$ n.

Return the minimum number of moves required to make nums complementary.

Constraints:

• n $==$ nums.length

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

• $1 \leq$ nums[i] $\leq$ limit $\leq 10^5$

• n is even.

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.