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.