Given an array of strings nums containing $n$ unique binary strings, each of length $n$, return a binary string of length $n$ that does not appear in nums. If there are multiple valid strings, return any of them.

Constraints:

• n $==$ nums.length

• $1 \leq$ n $\leq 16$

• nums[i].length $==$ n

• nums[i] consists only of characters '0' or '1'

• All strings in nums are unique

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.