Sock Merchant Solution in C | Hacker Rank

In this Article I am writing the Code for Hacker Rank problem on Sock Merchant  in C programming Language . 

Q) John works at a clothing store. He has a large pile of socks that he must pair by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are.

For example, there are  socks with colors . There is one pair of color  and one of color . There are three odd socks left, one of each color. The number of pairs is .


Solution:

As you are required to know how many pairs are present.
lets say if 1 is called a color "red" and 2 is called a color "green".
so number of pairs of 1 that is red in above array ar is 1 .
if you ask how?
remember pair is formed when there is 2 similar color.in the above array
there are 3 1's(red) therefore 1 Pair is formed .
if there was 4 1's(red) then you would get 2 pairs.


#include <stdio.h>
int main()
{
int a[100],n,i,temp,c=0;

scanf("%d",&n);
//printf("enter number in array");
for(i=0;i<n;i++)
{
    scanf("%d",&a[i]);
}
for(i=0;i<n;i++) // sort
{
  for(int j=i+1;j<n;j++) 
  {
      if(a[i]>a[j])
   {
       temp=a[i];
       a[i]=a[j];
       a[j]=temp;
   }
  }
}
//printf("SORTED number in array");
for(i=0;i<n;i++) // sort
{
  //  printf("%d\t",a[i]);
}

for(i=0;i<n;i++) 
{
    if(a[i]==a[i+1])
    {
        c++;
        i++;
    }
}
printf("%d",c);
}

Comments

Post a Comment

Popular posts from this blog

Write a Function | Hacker Rank Solution in Python

Problem: An extra day is added to the calendar almost every four years as February 29, and the day is called a  leap day . It corrects the calendar for the fact that our planet takes approximately 365.25 days to orbit the sun. A leap year contains a leap day. In the Gregorian calendar, three conditions are used to identify leap years: The year can be evenly divided by 4, is a leap year, unless: The year can be evenly divided by 100, it is NOT a leap year, unless: The year is also evenly divisible by 400. Then it is a leap year. This means that in the Gregorian calendar, the years 2000 and 2400 are leap years, while 1800, 1900, 2100, 2200, 2300 and 2500 are NOT leap years.  Source Solution: def is_leap(year):     leap = False     if year%4==0 and (year%400==0 or year%100!=0):             leap=True     else:         leap=False     return leap year =  int ( raw_input ()) print ...
Read more

Diagonal Difference | Hacker Rank Solution in C

Problem: Given a square matrix, calculate the absolute difference between the sums of its diagonals. For example, the square matrix   is shown below: 1 2 3 4 5 6 9 8 9 The left-to-right diagonal =  . The right to left diagonal =  . Their absolute difference is  . Solution: #include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> int main() {     int a[100][100],n,c=0,d=0,i,j,sum=0;     scanf("%d",&n);     for(i=0;i<n;i++)         for(j=0;j<n;j++)             scanf("%d",&a[i][j]);     for(i=0;i<n;i++)          c=c+a[i][i];             for(i=0;i<n;i++)          d=d+a[i][n-1-i];     sum=abs(c-d);     printf("%d",sum);                   /* Enter your code here....
Read more

Print Function | Hacker Rank Solution in Python

Problem: The included code stub will read an integer,  , from STDIN. Without using any string methods, try to print the following: Note that " " represents the consecutive values in between. Example Print the string  . Solution: from  __future__  import  print_function if  __name__ ==  '__main__' :     n =  int ( raw_input ())     i= 1      print (* range ( 1 ,n+ 1 ),sep= "" )         
Read more