0.3 The Unique
(RankList for this Question)
Score: 20pts
Time Limit: 5.00 sec
Hey Coder! You are appointed as a software development engineer at a big tech company. You have one task pending and have to complete it today.
The task is as follows-
You have to calculate the number of non-repeating elements present in an array and report whether this number is divisible by 2 or not.
Print “Yes” if it is divisible by 2, else print “No”.

1 ≤ t ≤ 100
1 ≤ n ≤ 10^5
1 ≤ a[i] ≤ 10^5

Input Format
The first line contains one integer (t) - the number of test cases.
Each test case consists of two lines-
n - Size of the list (1<=n<=10^5)
List of integers (a[0], a[1]…..a[n-1])

Output Format
For each test case,
Print “Yes” if number of non-repeating elements is divisible by 2, else print “No”.

Example 1
1 2 4 5
3 4 5 7 4


In the first test case:
No of the elements that are not repeating is 4 and 4 is divisible by 2. Hence answer is Yes

Log In to solve the Question