1980. Find Unique Binary String
https://leetcode.com/problems/find-unique-binary-string
Description
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 answers, you may return any of them.
Example 1:
Example 2:
Example 3:
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.
ac
Previous1979. Find Greatest Common Divisor of ArrayNext1981. Minimize the Difference Between Target and Chosen Elements
Last updated