You are given an integer array nums of length n $+ 2$, which contains numbers ranging from $0$ to n $- 1$. In this collection, exactly two numbers appear twice, while every other integer appears once.

Return an array containing the two duplicate numbers. The resulting numbers may be returned in any order.

Constraints:

• $2 \leq$ n $\leq 100$

• nums.length $==$ n $+ 2$

• $0 \leq$ nums[i] $<$ n

• The input is generated such that nums contains exactly $2$ repeated elements.

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.