Given an integer array nums where every value occurs exactly twice except for two distinct values that occur exactly once, return the two values that appear only once. The returned order can be arbitrary.

Constraints:

• $2 \leq$ nums.length $\leq 3 \cdot 10^4$

• $-2^{31} \leq$ nums[i] $\leq 2^{31} - 1$

• Every integer in nums appears exactly twice, except for exactly two integers that appear once

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.