You are given an integer array nums consisting of distinct positive integers, and a $2 ext{D}$ integer array operations where operations[i] = [oldValue, newValue].

You need to apply all operations in sequence. For each operation operations[i], replace the element in nums that has the value operations[i][0] with the value operations[i][1].

Return the array nums after performing all operations.

Constraints:

• n $==$ nums.length

• m $==$ operations.length

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

• All the values of nums are distinct.

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

• $1 \leq$ nums[i], operations[i][0], operations[i][1] $\leq 10^6$

• operations[i][0] will exist in nums when applying the $i^{ ext{th}}$ operation.

• operations[i][1] will not exist in nums when applying the $i^{ ext{th}}$ operation.

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.