GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers
Problem :- Element appearing once
Submit Your Solution :- Click Here
Solution :-
#include <bits/stdc++.h>
using namespace std;
int findOdd(int arr[], int n)
{
int res = 0, i;
for (i = 0; i < n; i++)
res ^= arr[i];
return res;
}
int main()
{
int t;
cin>>t;
while(t--)
{
int n,i,j,sum,res=0;
cin>>n;
int arr[n];
for(i=0;i<n;i++)
cin>>arr[i];
printf ("%d\n", findOdd(arr, n));
}
return 0;
}
Output:-
0 Comments: