@@ -0,0 +1,619 @@
+package algorithms.implementation;%0A%0Aimport java.util.Scanner;%0A%0A/**%0A * %0A * Challenge: https://www.hackerrank.com/challenges/sock-merchant%0A * @author Sudharsanan Muralidharan%0A */%0Apublic class SockMerchant %7B%0A  public static void main(String%5B%5D args) %7B%0A    Scanner in = new Scanner(System.in);%0A    int%5B%5D bitArr = new int%5B101%5D;%0A    int n = in.nextInt();%0A    int count = 0;%0A    %0A    for (int i = 0; i %3C n; i++) %7B%0A      int cost = in.nextInt();%0A      if(bitArr%5Bcost%5D == 0) %7B%0A        bitArr%5Bcost%5D = 1;%0A      %7D else %7B%0A        count++;%0A        bitArr%5Bcost%5D = 0;%0A      %7D%0A    %7D%0A%0A    System.out.println(count);%0A    in.close();%0A  %7D%0A%7D%0A

Add solution for SockMerchant using integer array