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 that appears once where every element occurs twice
Submit Your Solution :- Click Here
Solution :-
#include <iostream>
using namespace std;
int appearance(int a[],int n){
int res=a[0];
//int bit_mask;
for(int i=1; i<n; i++){
res=res^a[i];
}
return res;
}
int main() {
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
cout<<appearance(a,n)<<endl;
}
return 0;
}
Output:-
Add caption |
0 Comments: