The time complexity is mentioned as O(log n). To meet this, an additional constraint needs to be added in the question: "All repeated numbers appear in pairs in the input." The examples in the question seem to illustrate this, but the condition is not mentioned in the question itself.
PS: I received this question in a real interview too, and that is how I am aware.
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.