Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1980. Find Unique Binary String
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source