Find Unique Binary String
Given an array of strings nums containing n unique binary strings, where each string has length n, return a binary string of length n that does not appear in nums.
If there are multiple valid answers, you may return any of them.
Example 1
Input
nums = ["01","10"]Output
"11""11" does not appear in nums, and "00" would also be correct.
Example 2
Input
nums = ["00","01"]Output
"11""11" does not appear in nums, and "10" would also be correct.
Constraints
- n == nums.length
- 1 <= n <= 16
- nums[i].length == n
- nums[i] is either '0' or '1'.
- All the strings of nums are unique.