Help me in solving MISSP problem

help
,
1

My issue

The below python code for this problem(Chef and Dolls) is written by the user (ahimanshu317).
I’m not getting the expected output, with the below test case

Code:

for i in range(int(input())):
n=int(input())
l=
for j in range(n):
l.append(int(input()))
for j in l:
if l.count(j)%2==1:
print(j)
break

Test case:
T = 1
N = 4
1
1
2
3

Here both 2 and 3 are missing pairs but we get only 2 as output from the above code

How can we revise the above the code?

My code

# cook your dish here
for i in range(int(input())):
    n=int(input())
    l=[]
    for j in range(n):
        l.append(int(input()))
    for j in l:
        if l.count(j)%2==1:
            print(j)
            break

Learning course: Arrays, Strings & Sorting
Problem Link: Chef and Dolls Practice Problem in - CodeChef

2

@tsk_08
the logic is just calculate the xor of the whole array.

3

But here in the question they asked us to find the missing paris and output the missing pair number right?

i.e count the occurence of number and check whether it is odd or even

→ if it is odd then the number misses it’s pair
→ if it is even then the number has it’s pair

so here 2 and 3 doesn’t have a pair so it should give the output as both 2 and 3 right?
Why giving the output only 2 ?

If I remove the break statement from if loop, the code is exceeding the time limit to execute