You are given an integer array nums and a $2 ext{D}$ integer array swaps, where swaps[i] $= [p_i, q_i]$ indicates that you can swap the elements at indices $p_i$ and $q_i$ any number of times.

The alternating sum of an array nums of length $n$ is defined as:

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.