Tap here to switch tabs
Problem
Submissions

Problem: Find Unique Binary String

Find Unique Binary String gives you an array of distinct binary strings, each as long as the array, and asks you to return any string of that length missing from it.

Statement

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

Constraints:

  • n ==== nums.length

  • 1≤1 \leq n ≤16\leq 16

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

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

  • All strings in nums are unique

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Find Unique Binary String

Find Unique Binary String gives you an array of distinct binary strings, each as long as the array, and asks you to return any string of that length missing from it.

Statement

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

Constraints:

  • n ==== nums.length

  • 1≤1 \leq n ≤16\leq 16

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

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

  • All strings in nums are unique