You are given two integer arrays source and target, both of length n. You are also given an array allowedSwaps where each element allowedSwaps[i] = [$a_i, b_i$] indicates that you can swap the elements at index $a_i$ and index $b_i$ in the array source.

You may apply any number of swap operations on source using the index pairs from allowedSwaps in any sequence.

The Hamming distance between two arrays of equal length is defined as the total number of indices where their corresponding elements are not equal.

Return the minimum achievable Hamming distance between source and target after applying any number of swap operations on source.

Constraints:

• n $==$ source.length $==$ target.length

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

• $1 \leq$ source[i], target[i] $\leq 10^5$

• $0 \leq$ allowedSwaps.length $\leq 10^5$

• allowedSwaps[i].length $== 2$

• $0 \leq a_i, b_i \leq n - 1$

• $a_i \neq b_i$

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.