Leetcode 1980. Find Unique Binary String

Given n distinct binary strings each of length n, return any n-bit string that does not appear in the array. This leverages the pigeonhole/Cantor diagonalization idea: among 2^n possible strings at least one is missing, and you can construct one systematically.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1980. Find Unique Binary String

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact