codingstuff.io
ExploreTutorialsProblemsCS Subjects
Get Started
ExploreTutorialsProblemsCS Subjects
Get Started
codingstuff.io

Master the art of building software through interactive tutorials, real-world problems, and guided projects.

Pune, Maharashtra, India

codingstuffmail@gmail.com

Product

  • Explore
  • Tutorials
  • Problems
  • CS Subjects

Company

  • About
  • Contact
  • Privacy Policy
  • Terms & Conditions
  • Sitemap

© 2026 codingstuff.io. All rights reserved.

Built with ❤️ for developers everywhere

ProblemsFind Unique Binary String

Find Unique Binary String

Medium
BacktrackingStrings

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:

Input: nums = ["01","10"]
Output: "11"

Example 2:

Input: nums = ["00","01"]
Output: "11"

Example 3:

Input: nums = ["111","011","001"]
Output: "101"

 

Constraints:

  • n == nums.length
  • 1 <= n <= 16
  • nums[i].length == n

Related Problems

View all
Subsets
Medium•Recursion
Combination Sum
Medium•Recursion
Permutations
Medium•Recursion
Subsets II
Medium•Recursion
Combination Sum II
Medium•Recursion
Word Search
Medium•Recursion
Input:
nums = ["01","10"]