We’re preparing your current view and syncing the latest data.
You are given an array of n unique binary strings, each of length n. Your task is to find any binary string of length n that does not appear in this array. Since the array contains unique strings, there is guaranteed to be at least one such string not included in the array. Return any such binary string.
An array of n unique binary strings, each of length n.
A binary string of length n that does not appear in the input array.
1 <= n <= 16 (or suitable constraints as per the problem statement). All strings are binary and of equal length n.
Example 1
Input
01,10
Output
00
Explanation
The input array contains "01" and "10". Strings of length 2 are "00", "01", "10", and "11". The string "00" does not appear in the array.