Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.