You are given two integer arrays nums and target of length n.

In one operation, you can choose an integer x and set nums[i] = target[i] for all indices i where nums[i] == x.

Return the minimum number of operations required to make nums equal to target.

Constraints:

• $1 \leq$ n $==$ nums.length $==$ target.length $\leq 10^5$

• $1 \leq$ nums[i], target[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.