Comments by Cricket HiLites (Top 1 by date)

Please ignore that code, I made a small modification.


#include<bits stdc++.h="">
using namespace std;
int func(int arr[], int n)
{
int i;
sort(arr,arr+n);
for(i=0;i<n-2;i++)
{
="" if(arr[i]="=arr[i+1]&&arr[i]==arr[i+2])
" return="" arr[i];
="" }
="" -1;
}

int="" main()
{
="" int="" t,p,="" a[10000],i;
="" cin="">>t;
p=t;
while(t--)
{
int n, arr[20000];
cin>>n;
for(i=0;i<n;i++)
{
="" cin="">>arr[i];
}
a[p-t-1]=func(arr,n);
}

for(i=0;i