We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
int i, pair=0, temp, j, count=1;
// sorting the array first
for(i=0;iar[j+1]){
temp=ar[j];
ar[j]=ar[j+1];
ar[j+1]=temp;
}
}
}
// searching the occurrence of a color
for(i=0;i
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Equal
You are viewing a single comment's thread. Return to all comments →
int i, pair=0, temp, j, count=1; // sorting the array first for(i=0;iar[j+1]){ temp=ar[j]; ar[j]=ar[j+1]; ar[j+1]=temp; } } } // searching the occurrence of a color for(i=0;i