Sock Merchant ( Hackerrank ) Problem Statement.

Sock Merchant Hackerrank Problem Statement.

Solution :-

import java.util.*;

class socks{

    public static void main(String args[]){

        int n;

        Scanner sc=new Scanner(System.in);

        

        n=sc.nextInt();

        int ar[]=new int[n];

        

        for(int i=0;i<n;i++){

            ar[i]=sc.nextInt();

        }

        for(int i=0;i<n;i++){

            for(int j=i+1;j<n;j++){

                if(ar[i]>ar[j]){

                    int c=ar[i];

                    ar[i]=ar[j];

                    ar[j]=c;

                }    

            }    

        }

        int count=0;

        for(int j=1;j<n;j++){

            if(ar[j-1]==ar[j]){

                count++;

                j++;

            }

        }

    

        System.out.println(count);

    }

}