We are given an unsorted array, nums, with $n$ elements and each element is in the range $[1, n]$ inclusive. The array originally contained all the elements from $1$ to $n$ but due to a data error, one of the numbers is duplicated, which causes another number missing. Find and return the corrupt pair (missing, duplicated).

Constraints:

• $2 \leq n \leq 10^3$
• $1 \leq$ nums[i] $\leq n$

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: