Given an integer array nums, an integer x is defined as a lonely number if it appears exactly once in nums and neither $x - 1$ nor $x + 1$ appears in nums.

Return a list containing all the lonely numbers in nums.

Note: You may return the answer in any order.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

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

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.