Missing Number Problem Statement

You are provided with an array named BINARYNUMS consisting of N unique strings. Each string represents an integer in binary, covering every integer from 0 to N except for one. Your task is to identify this missing integer and return its binary representation as a string without any leading zeros.

Input:

The first line indicates an integer T, the number of test cases. Each test case consists of: First line: An integer N indicating the number of binary strings in BINARYNUMS. Second line: N space-separated binary strings representing BINARYNUMS. 

Output:

For each test case, output a single string, representing the binary form of the missing integer without leading zeros. Each test case result should be on a different line. 

Example:

Input: N = 5, BINARYNUMS = ["0", "01", "010", "100", "101"] Output: "11" Explanation: The missing number is 3 and its binary representation is "11". 

Constraints:

• 1 <= T <= 50
• 1 <= N <= 10^4
• Time limit: 1 second.

Note:

Ensure your implementation returns the output without printing to the console, as output handling is already managed.